Symmetric Successive Over-Relaxation¶
A preconditioner built from matched forward and backward SOR triangular factors around an inverse diagonal, with optional relaxation parameter, for iterative linear-system solution.
Core Idea¶
SSOR symmetrizes the logic of successive over-relaxation. A matrix split into diagonal, lower, and transposed upper parts yields a factorized preconditioner applied through forward and backward triangular solves rather than dense inversion.
The diagonal must be suitable and the splitting convention explicit. The relaxation parameter changes scaling and performance; SSOR can improve convergence but its sequential sweeps, ordering sensitivity, and spectral effect must be evaluated within the chosen iterative solver.
Structural Signature¶
Sig role-phrases:
- System matrix A — Supplies the linear problem and ordering. It is target operator. Counterfactual: Changing ordering changes triangular factors and performance.
- Diagonal D — Provides the central easily inverted block. It is pivot factor. Counterfactual: Zero or unsuitable pivots make the stated form undefined.
- Strict lower factor L — Encodes forward triangular coupling. It is forward factor. Counterfactual: Using inconsistent sign/splitting changes the preconditioner.
- Transpose/upper factor L^T — Provides the symmetric backward sweep. It is backward factor. Counterfactual: Omitting it yields one-sided SOR rather than SSOR.
- Relaxation parameter ω — Scales diagonal and factors, conventionally away from singular endpoints. It is tuning parameter. Counterfactual: Poor ω can worsen conditioning or stability.
- Preconditioned iterative solver — Uses triangular solves with M to change spectral behavior. It is application frame. Counterfactual: M need not be formed densely and is not the exact solution operator.
What It Is Not¶
- It is not one forward SOR sweep.
- It is not Jacobi scaling.
- It is not generally the exact inverse of A.
- It is not automatically identical to incomplete Cholesky.
- Closest near-miss. Gauss–Seidel uses one triangular direction; symmetric Gauss–Seidel/SSOR combines forward and backward directions, with SSOR conventions adding relaxation scaling.
Scope of Application¶
- Numerical linear algebra. Preconditions sparse systems.
- Conjugate-gradient methods. Provides a symmetric positive-definite-compatible form under conditions.
- PDE solvers. Uses matrix locality and triangular sweeps.
- Iterative-method analysis. Studies ordering and spectral effects.
Clarity¶
State sign and matrix splitting, symmetry/definiteness, scalar or block D, ordering, ω convention and range, left/right/split preconditioning, triangular-solve accuracy, solver, stopping rule, and convergence comparison.
Manages Complexity¶
The method turns a stationary relaxation sweep into a symmetric factorized operator whose usefulness depends on matrix structure, ordering, tuning, and hardware execution.
Abstract Reasoning¶
- Verify matrix assumptions and choose ordering.
- Form D, L, and matching transpose under one convention.
- Select a valid relaxation parameter.
- Apply factors as triangular solves.
- Measure preconditioned convergence and computational cost.
Knowledge Transfer¶
SSOR settings transfer only with comparable matrix scaling, ordering, sparsity, definiteness, diagonal blocks, solver, and architecture; ω and iteration gains are problem-dependent.
Examples¶
Canonical¶
For symmetric A=D+L+L^T with nonsingular D, an iterative solver applies the SSOR preconditioner through a forward triangular solve, diagonal scaling, and backward solve.
Mapped back: matrix → symmetric A; split → D,L,L^T; forward → D/ω+L; center → D^-1; backward → transpose; use → preconditioner.
Applied / In Practice¶
Applying only (D+L)^{-1} as a forward Gauss–Seidel preconditioner lacks the backward transpose factor and is not symmetric SSOR.
Mapped back: forward → present; backward → absent; verdict → one-sided.
Structural Tensions¶
T1 — Cheap Triangular Sweeps versus Parallelism. Sequential triangular dependencies are inexpensive but harder to parallelize than diagonal or polynomial preconditioners.
Diagnostic: Does iteration reduction offset synchronization cost?
T2 — Relaxation Tuning versus Robustness. ω can improve spectral properties for one problem yet degrade another.
Diagnostic: What matrix assumptions or empirical evidence guide ω?
Structural–Framed Character¶
SSOR is structural as a symmetric triangular-factor preconditioner and numerically framed by splitting and relaxation choices.
Structural Core vs. Domain Accent¶
The core is operator split, forward factor, inverse diagonal, backward factor, and iterative use. Numerical analysis supplies convergence assumptions, ω, ordering, and cost.
Instantiates / Related Primes¶
This entry presupposes Iterative method.
-
Approved root. No reviewed parent entails this preconditioner factorization.
-
Related — SOR, Gauss–Seidel, Jacobi, incomplete Cholesky, and preconditioned conjugate gradient. They provide source method, limits, alternatives, and consumer.
Relationships to Other Abstractions¶
Current abstraction Symmetric Successive Over-Relaxation Domain-specific
Parents (1) — more general patterns this builds on
-
Symmetric Successive Over-Relaxation presupposes Iterative method Domain-specific
Symmetric Successive Over-Relaxation presupposes Iterative method because its preconditioner is built from the forward and backward factors of an iterative SOR scheme.Every reviewed Symmetric Successive Over-Relaxation instance depends on the parent role: its preconditioner is built from the forward and backward factors of an iterative SOR scheme. Removing that role makes the frozen child identity undefined or changes it into a different abstraction. Iterative method can occur without Symmetric Successive Over-Relaxation, so the relation is dependency rather than subsumption.
Hierarchy path (1) — routes to 1 parentless root
- Symmetric Successive Over-Relaxation → Iterative method → Iteration
Neighborhood in Abstraction Space¶
Symmetric Successive Over-Relaxation sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Physical & Geometric Dynamical Quantities (29 abstractions)
Nearest neighbors
- Matrix Multiplication — 0.90
- Symbolic Cholesky Decomposition — 0.89
- Low-rank matrix approximations — 0.88
- Parabolic Cylindrical Coordinates — 0.88
- Matrix equivalence — 0.88
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- SOR iteration. Tell: Is a stationary iteration, not necessarily a symmetric preconditioner.
- Symmetric Gauss–Seidel. Tell: Is closely related and often the ω=1 convention.
- Incomplete Cholesky. Tell: Builds approximate factors through elimination.
- Jacobi preconditioner. Tell: Uses only the diagonal.
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Symmetric_successive_over-relaxation (revision 1174854981).
- Preserved source candidate: http://www.cfd-online.com/Wiki/Iterative_methods
- Preserved source candidate: http://www.netlib.org/linalg/html_templates/node58.html
The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.