Update numerical strategy documentation with verified evidence

This commit is contained in:
2026-09-17 12:09:57 -04:00
parent 8b307b43d3
commit b9e6794999
6 changed files with 63 additions and 35 deletions

View File

@@ -35,8 +35,9 @@ equations rather than silently dropped. These formulas require an invertible
gravity block; they do not regularize a singular full stellar problem or remove
the n=3 homology.
The production gravity subsystem owns its inner backend and restricted full
inverse. The reduced operator borrows it, allocates workspaces once, and checks
The production gravity subsystem owns its inner backend and selected gravity
preconditioner, using a supported compact action or full-root restriction.
The reduced operator borrows it, allocates workspaces once, and checks
its preparation generation through `IsCurrent()` before and after actions. Each
inner solve starts from zero to avoid importing a previous Krylov direction into
the next action. A successful backend report is checked against the requested
@@ -65,9 +66,10 @@ has only approximately completed gravity.
An action costs one gravity solve and two full Jacobian applications outside the
inner solve. Projection preconditioning costs one full inverse application.
This first implementation deliberately reuses existing operators and inverses;
its cost should be measured before replacing them with specialized gravity
kernels. All scratch vectors persist across applications. Objects borrow stable
The compact gravity applications reduce work inside the inner solve; they do
not remove these surrounding full-system actions. The measured improvement to
one inner solve therefore does not establish a cheaper reduced outer step.
All scratch vectors persist across applications. Objects borrow stable
addresses, are not reentrant, and must not outlive their prepared subsystem or
full inverse.
@@ -90,7 +92,11 @@ The focused test source `tests/solver/gravity_reduction.cpp` covers:
These algebraic tests establish the reduction contract. They do not establish
FEM convergence, a faster implementation, or an additional virial-qualified
stellar equilibrium; those require the integrated runtime experiments.
stellar equilibrium. Separately, the integrated serial n=1, J=0 reduced control
converged in six full steps and passed all eight virial checks, but took longer
than the curvature control. Supported low-level two-rank tests passed; full
stellar MPI operation remains unvalidated because of the existing single-rank
logical radial surface interpolation restriction.
## Resolved FEM difference sampling
@@ -110,8 +116,11 @@ two-correction completion budget. The inner tolerance, prepared completion gate,
and checker thresholds are unchanged. There is no assumption that larger steps
will prepare successfully or automatically pass the trend check.
These remain finite-range empirical derivative checks. The recorded arithmetic
scale is heuristic, and a gravity residual bound by itself is not a bound on its
amplified effect in the retained equations. The larger grid is intended to
resolve a measurable trend without claiming such an unmeasured amplification
bound or interpreting floor-limited differences as derivative failures.
The updated frozen n=1.5 probe passed all 124 algebraic and invariant checks.
Absolute central-difference errors on that grid were approximately `1.7784e-7`,
`1.5987e-8`, `1.7761e-9`, and `1.9661e-11`, resolving the expected second-order
trend without relaxing thresholds. These remain finite-range empirical
derivative checks. The recorded arithmetic scale is heuristic, and a gravity
residual bound by itself is not a bound on its amplified effect in the retained
equations. The result establishes no such unmeasured amplification bound and
does not reinterpret floor-limited differences as derivative failures.