How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stationary iterations and relaxation
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate Gradients, MINRES and Preconditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page adds finite-budget Richardson, Jacobi, fixed-order Gauss–Seidel, and SOR procedures using the published stationary-splitting definition. The diagonal/lower/upper convention is , with and the negatives of the strict lower and upper parts. Zero pivots and the inadmissible Richardson or SOR parameter return explicit failure statuses; a finite iteration budget reports the iterate, not a convergence certificate.
The all-start, all-right-hand-side criterion remains the published equivalence on the canonical stationary-splitting page. This page proves the source-backed Jacobi and Gauss–Seidel sufficient conditions: strict row diagonal dominance, and weak row diagonal dominance with a strongly connected off-diagonal graph and at least one strict row. It also proves that for Hermitian with positive diagonal, SOR converges for every start exactly when is positive definite and .
These are exact-arithmetic asymptotic claims. A spectral-radius bound does not prevent transient growth for a nonnormal iteration matrix or polynomial factors from defective Jordan blocks. A norm contraction is sufficient but is not asserted as necessary. No universal convergence factor or optimal relaxation parameter is claimed; any optimal-parameter formula requires its matrix-ordering hypotheses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Diagonal, lower, and upper parts in the stationary-iteration convention
Definition
Let be either or , let , fix the coordinate order , and let . Define by
Thus is diagonal, is strictly lower triangular, is strictly upper triangular (in the sense of Upper triangular, lower triangular and diagonal square matrices over a commutative ring), and . If , then , where denotes conjugate transpose. The decomposition uses the fixed coordinate order and is an exact-arithmetic identity.
Finite-budget Richardson stationary iteration
Definition
Input , , , a real
relaxation parameter , and an iteration budget .
First, if dimensions do not match, return invalid-input. Otherwise, if
, return invalid-relaxation. If both checks pass, set
and , and for
set
Return completed with . This is the stationary iteration of
Stationary iteration from a matrix splitting for ; is
invertible because . The budget may be zero, in which case the
output is . The procedure reports no convergence or accuracy
certificate.
An irreducible row-substochastic matrix with a strict row has a weighted contraction
Statement
Let and let have nonnegative entries and row sums at most . Form the directed graph with vertices and an edge exactly when ; assume this graph is strongly connected, with paths of length allowed. Assume one row has sum strictly less than . Then, with ,
coordinatewise, and the series converges coordinatewise to a vector satisfying and coordinatewise.
Facts & Assumptions
Given: A nonnegative matrix with row sums at most , strongly connected directed support graph, and at least one strict row .
and coordinatewise, with for a strict row .
For every vertex , strong connectivity supplies a directed path from to ; a shortest path has length at most .
Proof
Put . Telescoping gives , since . Each summand is coordinatewise nonnegative by [A1].
For each , choose by [A2] a path of length from to . The product of the positive edge weights along it is a positive term of ; for this entry is . Hence . Step 1.1 then gives for every .
Let . Since for , nonnegativity gives for all and . Therefore converges coordinatewise and its sum satisfies .
Multiplying the convergent series by shifts its terms, so coordinatewise.
Finite-budget Jacobi stationary iteration
Definition
Input , , , and an
iteration budget . Check dimensions; on a mismatch return
invalid-input. Form by
Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of
is zero, return pivot-failure(i) for the least such index .
Otherwise set and , so . For each , compute the diagonal solve
equivalently, simultaneously for every ,
Return completed with . The solve is the unique diagonal instance of
Forward and backward substitution for triangular linear systems when the pivot
check succeeds; Forward and backward substitution are correct, unique, and quadratic in scalar operations
gives its well-definedness. A zero budget returns . The procedure
reports no convergence or accuracy certificate.
Finite-budget Gauss–Seidel stationary iteration
Definition
Input , , , and an
iteration budget . Use the fixed order . Check
dimensions; on a mismatch return invalid-input. Form by
Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of
is zero, return pivot-failure(i) for the least such index .
Otherwise set and , so . For each , solve the lower-triangular system
by forward substitution in increasing index order. Equivalently, the component updates are
Return completed with . The lower-triangular solve is unique after
the pivot check by Forward and backward substitution for triangular linear systems
and Forward and backward substitution are correct, unique, and quadratic in scalar operations.
After the dimension and pivot checks succeed, a zero budget returns
completed with . The procedure reports no convergence or accuracy
certificate.
Finite-budget successive over-relaxation stationary iteration
Definition
Input , , , a real
relaxation parameter , and an iteration budget .
Check dimensions; on a mismatch return invalid-input. If , return
invalid-relaxation. Form by
Diagonal, lower, and upper parts in the stationary-iteration convention. If some diagonal entry of
is zero, return pivot-failure(i) for the least such index .
Otherwise set
so . For each , solve
by forward substitution in increasing index order. The lower-triangular
coefficient matrix has diagonal entries , which are nonzero
after the checks. Return completed with . The solve is unique by
Forward and backward substitution for triangular linear systems and
Forward and backward substitution are correct, unique, and quadratic in scalar operations.
A zero budget returns . This procedure is defined for every real
; it reports no convergence or accuracy certificate.
Strict row diagonal dominance guarantees Jacobi and Gauss–Seidel convergence
Statement
Let and satisfy strict row diagonal dominance:
Then the Jacobi and fixed-order Gauss–Seidel iterations defined by Finite-budget Jacobi stationary iteration and Finite-budget Gauss–Seidel stationary iteration converge in exact arithmetic to the unique solution of for every .
Facts & Assumptions
Given: , a real matrix satisfying the displayed strict row diagonal-dominance inequalities, any , and the fixed order .
For each row , .
The diagonal/lower/upper convention has , with strictly lower and strictly upper (Diagonal, lower, and upper parts in the stationary-iteration convention).
Jacobi uses the stationary split , and solves (Finite-budget Jacobi stationary iteration).
Fixed-order Gauss–Seidel uses , and solves (Finite-budget Gauss–Seidel stationary iteration).
If a finite-dimensional triangular system has nonzero diagonal, forward or backward substitution gives its unique solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).
For a stationary split with invertible , the iteration matrix is and the update is (Stationary iteration from a matrix splitting ).
Such an iteration converges to the unique solution for every right-hand side and every start if and only if (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below ).
Proof
By [A1], every . Thus and the lower-triangular matrix have nonzero diagonal, so the solves in [F1] and [F2] are uniquely defined by [L2].
By [F1]–[F2] and [L3], the iteration matrices are and .
For each row , set and . Since below the diagonal and above it, . Hence for any eigenpair with , choose with ; the row equation gives , so and .
Let with , and choose with . The equation in row is , so . By the reverse triangle inequality and [A1], the left factor is at least , while the right side is at most . Therefore ; the denominators are positive and each strict inequality follows from [A1]. Thus .
The bounds in steps 3.1 and 3.2 and [L4] imply that both methods converge to the unique solution of for every and every initial vector.
Irreducibly weak row diagonal dominance with a strict row guarantees Jacobi and Gauss–Seidel convergence
Statement
Let and satisfy weak row diagonal dominance
with strict inequality in at least one row. Assume the directed off-diagonal graph, with edge when and , is strongly connected (paths of length are allowed). Then the Jacobi and fixed-order Gauss–Seidel iterations defined by Finite-budget Jacobi stationary iteration and Finite-budget Gauss–Seidel stationary iteration converge in exact arithmetic to the unique solution of for every .
Facts & Assumptions
Given: , a real matrix satisfying the displayed weak row inequalities, at least one strict row, and a strongly connected directed off-diagonal graph.
Every row satisfies , with at least one strict row; the off-diagonal graph has edges exactly when and is strongly connected.
, where is diagonal and are the negative strict lower and upper parts (Diagonal, lower, and upper parts in the stationary-iteration convention).
Jacobi has iteration matrix (Finite-budget Jacobi stationary iteration).
Fixed-order Gauss–Seidel has iteration matrix (Finite-budget Gauss–Seidel stationary iteration).
For the comparison matrix with row sums at most , strongly connected positive-entry graph, and a strict row, there is with (An irreducible row-substochastic matrix with a strict row has a weighted contraction).
In a stationary split , the update has iteration matrix (Stationary iteration from a matrix splitting ).
A stationary iteration converges to the unique solution for every right-hand side and every start exactly when (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below ).
A lower-triangular system with nonzero diagonal has a unique forward substitution solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).
Proof
If and , [A1] forces every off-diagonal entry in row to vanish, contradicting strong connectivity. If , the strict-row hypothesis forces . Hence every diagonal entry is nonzero, and the Jacobi and lower-triangular Gauss–Seidel solves are defined by [L5].
Define and for . Its row sums are at most , one is strictly below , and its positive-entry graph is the graph in [A1]. By [L2], choose with , and set .
By [F1], entrywise. For , nonnegativity gives . Thus every eigenvalue of satisfies , so .
Set and . Then , is strictly lower triangular, and . Thus . Since , multiplying by gives . Consequently .
Because and is strictly lower triangular, . Entrywise absolute values obey , so . The same weighted-vector estimate as in step 3.1 yields ; hence .
By [L3]–[L4], the two spectral-radius bounds imply convergence to the unique solution of for every right-hand side and every initial vector.
SOR converges exactly for positive-definite A and relaxation parameter in (0, 2)
Statement
Let , be Hermitian with strictly positive diagonal, and let . Write by Diagonal, lower, and upper parts in the stationary-iteration convention, and define
The SOR iteration is . It converges to the unique solution of for every if and only if is positive definite (meaning for every nonzero ) and .
Facts & Assumptions
Given: , a Hermitian matrix with positive diagonal, a real , and arbitrary .
, , and .
SOR uses and (Finite-budget successive over-relaxation stationary iteration).
The fixed diagonal/lower/upper convention gives for Hermitian (Diagonal, lower, and upper parts in the stationary-iteration convention).
For an invertible matrix and , the stationary update is (Stationary iteration from a matrix splitting ).
This iteration converges to the unique solution for every right-hand side and every start exactly when (A stationary splitting converges for every start if and only if its iteration matrix has spectral radius below ).
Hermitian positive definite means and for every nonzero (Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal).
A lower-triangular system with nonzero diagonal has a unique forward substitution solution (Forward and backward substitution are correct, unique, and quadratic in scalar operations).
Determinants are multiplicative for same-sized square matrices over a commutative ring (For same-sized finite square matrices over a commutative ring, ).
The determinant of a triangular matrix is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).
When the characteristic polynomial splits as , the determinant is (If in , then : determinant is the product of the eigenvalues counted with algebraic multiplicity).
Every complex polynomial splits over (The complex numbers are algebraically closed).
Proof
By [A1] and [F1], is lower triangular with diagonal , hence invertible by [L5]. Also by [L1], so [L2] applies with iteration matrix . The matrix is upper triangular with diagonal entries . Thus [L6]–[L7] give and . From and multiplicativity, .
For sufficiency, suppose is positive definite and . Then is positive definite. For an eigenpair with , one has since and is invertible. Put . Then , so . Therefore for every eigenvalue and .
If SOR converges for every right-hand side and start, [L3] gives . By [L8]–[L9], . Step 1.1 therefore gives , which for real is equivalent to .
Assume now that SOR converges for every right-hand side and start. Then by [L3], so is not an eigenvalue of and is invertible. By [L2], is invertible. For , its unique solution is . For arbitrary nonzero , set and . The homogeneous SOR recurrence gives , hence . Expanding the Hermitian quadratic form gives . The last equality follows from [L1] and [F1].
By step 2.1, . Summing the identity in step 2.2 from to and taking (the error tends to by the assumed convergence) gives . Moreover : otherwise step 2.2 implies , contrary to invertibility of . Since has positive diagonal, the first summand is strictly positive and all others are nonnegative. Thus for every nonzero , so [L4] gives that is positive definite.
By [L3], implies convergence to the unique solution for every right-hand side and every initial vector. Steps 2.1 and 3.1 prove the reverse implication.
Remarks
The conclusion is exact-arithmetic asymptotic convergence; it is not a one-step error decrease or a finite-precision accuracy guarantee. No optimal- formula is asserted.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §4.1
- David Bindel, Matrix Computations (CS 6210), Cornell University, Fall 2012, Lecture 31
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §4.2.1
- Rutgers University MATH 574, Lecture Notes, §3 Matrix iterative methods
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §4.2.3
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §4.2.4