Numerical Error, Conditioning, and Stability
A stable algorithm controls the numerical errors it introduces; a well-conditioned problem does not amplify small input changes excessively. These are different properties. A solver can accurately solve a nearby matrix problem while the requested physical quantity remains sensitive to discretization, uncertain parameters, or a nearly closed spectral gap.
Required background. Precision diagnostics explains roundoff diagnostics; basis choice defines the overlap metric used by a finite representation.
Forward error and backward error
Section titled “Forward error and backward error”For an exact task and computed result , forward error measures . Backward error asks how much the input must change so that . A backward-stable algorithm produces a small relative to the input scale. The forward error also depends on the sensitivity of .
For a nonsingular linear system , define . Since ,
The inequality uses and assumes . A small relative residual guarantees a small forward error only with a useful condition bound. The scaled quantity is a common normwise backward-error diagnostic, with the exact interpretation depending on allowed perturbations.
For and , the exact solution is . The approximation has residual norm but an order-one error in the second component. Tightening the stopping tolerance can reduce the residual, but cannot change the conditioning of this linear system.
Hermitian eigenpair residuals
Section titled “Hermitian eigenpair residuals”Let , , and . Expanding in an orthonormal eigenbasis gives
Consequently, at least one eigenvalue lies within of . This statement does not identify which eigenvalue, nor does it prove approximates one particular eigenvector. If the target eigenspace is separated from every other eigenvalue by a distance at least from , then
where projects onto that eigenspace. Near degeneracies, compare subspaces and observables rather than individual eigenvectors. A tiny residual may coexist with a large change of eigenvector direction when the gap is tiny.
These are finite-matrix statements. They do not control errors between and the intended continuum Hamiltonian. A nonorthogonal basis also changes which residual norm belongs in the bound.
Residuals in a nonorthogonal trial space
Section titled “Residuals in a nonorthogonal trial space”Let and , with and positive definite. For nonzero coefficients , define . These residual entries are inner products with the trial functions, not expansion coefficients of a state. Their ordinary Euclidean norm therefore depends on how the basis functions are scaled.
Use the Cholesky reduction, , , and . It gives
Thus . The inverse metric appears because contains overlaps; the corresponding coefficient residual is , whose -norm is . Evaluate by a triangular solve, without forming . Uncertainty in , , or the factorization remains a separate numerical error.
For an explicit scaling check, take the physical two-level Hamiltonian in fixed energy units and the normalized state . Its Rayleigh quotient is , and . Now use trial functions , with . Then
At , the raw norm is only , although the state and its spectral error have not improved. The invariant residual is still ; indeed the nearest eigenvalue remains away from . Here : the misleading raw residual is caused by basis scaling, even without poor overlap conditioning.
When the trial space is truncated, measures only its projected residual. If is its orthogonal Hilbert-space projector and is normalized and in the operator domain, then
The omitted component is orthogonal to the trial space. An exactly solved Ritz problem has but can still have a nonzero full residual. Neither this missing component nor continuum accuracy is certified by the finite-basis solve; use basis refinement and appropriate independent bounds. For trial functions only in the quadratic-form domain, the full operator residual need not even exist.
Non-Hermitian sensitivity
Section titled “Non-Hermitian sensitivity”For a simple eigenvalue of a diagonalizable non-Hermitian matrix, let and . First-order perturbation theory gives
For unit-norm left and right vectors, a small signals large sensitivity. The Hermitian residual-distance bound does not transfer unchanged to such a problem. Complex absorbing potentials, effective Hamiltonians, and Liouvillians can be nonnormal; inspect left/right conditioning or pseudospectral behavior when apparently stable eigenvalues are suspect.
At a defective eigenvalue, the simple-eigenvalue expansion itself fails. More digits and a smaller residual do not justify interpreting every decimal place of a near-exceptional-point spectrum as robust physics.
Stability of propagation
Section titled “Stability of propagation”For a time-step map repeatedly applied to a state, a local error may accumulate or be amplified. In units with , explicit Euler for gives , with amplification modulus . Norm growth follows even though the differential equation is unitary.
Conversely, an exactly unitary step can have the wrong phase. Stability and invariant preservation are valuable constraints, but accuracy still requires step refinement or comparison with a known solution. Report both the conservation defect and the error in the target observable.
Exercises
Section titled “Exercises”For with and , evaluate the Rayleigh quotient and residual. Does a small residual for small make close to the ground-state eigenvector?
Solution
and , so . Nevertheless the overlap with is always . The gap shrinks with the residual; the two-dimensional low-energy subspace is the stable object.
A three-level Hamiltonian is , with real . Restrict the trial space to the first two coordinate vectors and take , . Compare the Ritz residual, full residual, and exact ground energy. Does solving the trial problem more accurately remove the discrepancy?
Solution
The trial Hamiltonian is , so its residual is exactly zero. In the full space, has norm . The coupled first/third block has eigenvalues , hence the ground energy is at small . The error comes from the omitted direction; tightening the trial eigensolver cannot remove it.
References
Section titled “References”- Anderson, E., et al., LAPACK Users’ Guide, 3rd ed., SIAM, 1999, Accuracy and Stability and Generalized Symmetric Definite Eigenproblems — spectral bounds and the Cholesky reduction used for the overlap-metric residual.
- Higham, N. J., Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, 2002, publisher edition — conditioning and stability.
- Trefethen, L. N., and M. Embree, Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators, Princeton University Press, 2005 — nonnormal sensitivity and transient behavior.