Update numerical strategy documentation with verified evidence
This commit is contained in:
@@ -80,17 +80,22 @@ Use one numerical process at a time and preserve all capped failures as results.
|
||||
| Python checker | Synthetic passing, false-convergence, mutation, missing-data, negative-base, compact/fallback agreement, and NaN records | 30 seconds; standard-library unit tests |
|
||||
| Positivity frozen states | n=1 J=0.1 captured iteration 2 and iteration 11; a certified seed/control | 10 minutes per probe; iteration 11 must be negative and reject repair with `invalid_base`; no claim that the earlier base is positive before checking it |
|
||||
| Gravity curvature | n=1.5 J=0 captured iteration 1 | 15 minutes; alpha = 1, 0.1, 0.01, 0.001; gate fresh remainder cancellation and small-step order |
|
||||
| Reduced gravity | Same n=1.5 state, plus constrained n=3 saved seed direction | 15 minutes per probe; completion and three central-difference pairs; n=3 direction remains an approximate diagnostic correction |
|
||||
| Reduced gravity | Same n=1.5 state, plus constrained n=3 saved seed direction | 15 minutes per probe; completion and four central-difference pairs; n=3 direction remains an approximate diagnostic correction |
|
||||
| Regression equilibrium | n=1 J=0 and low-rotation J=0.05 baseline; opt-in strategies individually | Preserve existing nonlinear/linear caps, add a 20-minute wall limit per model; strict solver and all virial gates remain mandatory |
|
||||
| Failure-prone equilibrium | n=1 J=0.1 and n=1.5 J=0, strategies separately before combinations | 8 Newton steps / 20 minutes; report residual progress, auxiliary work, rejection causes, and physical endpoint without equating the cap with convergence |
|
||||
|
||||
At the supplied frozen-gravity defaults, there are at most 20 explicitly requested
|
||||
inner solves, each capped at 160 iterations, and at most 36 preparations in the
|
||||
normal completed path. The maximum covers four curvature corrections, seven
|
||||
At the supplied frozen-gravity defaults, there are at most 24 explicitly requested
|
||||
inner solves, each capped at 160 iterations, and at most 42 preparations in the
|
||||
normal completed path. The maximum covers four curvature corrections, nine
|
||||
gravity completions with up to two corrections each, and two reduced actions.
|
||||
Rejected preparations can reduce those counts. Root integration controls and
|
||||
end-to-end outer solves are separately bounded; their nested work is not covered
|
||||
by this frozen-probe count.
|
||||
|
||||
The completed n=1.5 frozen campaign passed all 124 algebraic and invariant
|
||||
checks, including the four-pair resolved central-difference trend and compact
|
||||
application comparisons. The checker regression suite passed 18 Python tests.
|
||||
These results do not replace physical acceptance of an end-to-end model.
|
||||
|
||||
Treat outer reduced-solve time as inclusive of nested gravity solves. Report the
|
||||
inner counters separately, but do not add the two times as if they were disjoint.
|
||||
|
||||
Reference in New Issue
Block a user