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.
Krylov Subspaces, Arnoldi and GMRES: Examples and Counterexamples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalue Iterations and the QR Algorithm
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Krylov Subspaces, Arnoldi and GMRES
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples keep the exact traps visible. Early stabilization is controlled by the start vector's grade, not by the ambient matrix size; lucky Arnoldi breakdown is exact invariance, not a finite-precision accident; and GMRES can have monotone residuals without fast convergence on a nonnormal problem.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A Krylov chain can stabilize early when the start vector has a short relative minimal polynomial
Example
Let
Then , , and the relative minimal polynomial of is . Hence
So the Krylov chain stabilizes at grade , strictly before the ambient dimension .
Facts & Assumptions
Given: The matrix and vector displayed above.
Krylov dimensions grow one step at a time until the grade and then stabilize (The dimensions of the Krylov spaces grow by one until the grade and then stabilize).
Verification
Direct multiplication gives and . Therefore for , while no nonzero polynomial of degree annihilates because neither nor is zero. Hence the grade is .
The displayed Krylov spaces follow from the vectors . Since the grade is , [L1] predicts exactly the stabilization for , which agrees with the calculation.
A hand calculation of Arnoldi shows the Hessenberg factorization entry by entry
Example
Take
The first two Arnoldi steps give
so with and one has
Facts & Assumptions
Given: The matrix and start vector .
Before breakdown, Arnoldi produces an orthonormal Krylov basis and the factorization (Before breakdown, Arnoldi produces an orthonormal Krylov basis and a rectangular upper-Hessenberg factorization).
Verification
Since , the first Arnoldi coefficients are , , and . Next, , so , , , and .
Therefore and . The vectors are orthonormal exactly as [L1] predicts, and the Hessenberg entries are visible column by column.
Lucky breakdown occurs when the current Krylov space is already invariant
Example
Let
Then and , because . Arnoldi therefore breaks down exactly after the first step: the next residual is zero.
Facts & Assumptions
Given: The diagonal matrix and start vector .
Exact Arnoldi breakdown at the next step is equivalent to invariance of the current Krylov space (Exact Arnoldi breakdown is equivalent to invariance of the current Krylov space).
Verification
Here and , so the current Krylov space is -invariant.
By [L1], that invariance is equivalent to exact Arnoldi breakdown at the next step. Concretely, the Arnoldi residual is .
A Ritz pair from Arnoldi has a residual given by the last Hessenberg column entry
Example
Continue the Arnoldi run from the previous example, where
Take the unit eigenvector of with eigenvalue . Then the Ritz vector is
and its residual is
whose norm is .
Facts & Assumptions
Given: The Arnoldi data , , , and .
For an Arnoldi Ritz pair, (An Arnoldi Ritz pair has residual norm controlled by the last Hessenberg subdiagonal entry).
Verification
One has , so is a Ritz value and is the associated Ritz vector. Also .
Applying [L1] with gives . Therefore .
GMRES on a small nonsymmetric system becomes a two- or three-dimensional least-squares problem
Example
Consider
Then , so the one-step Arnoldi basis is , , and
Thus one-step GMRES minimizes
whose minimizer is . Hence
Facts & Assumptions
Given: The system with the displayed .
Arnoldi reduces GMRES to the least-squares problem (Arnoldi reduces GMRES to a least-squares problem for the small Hessenberg matrix).
Verification
Since , one has and . Also , so and the normalized residual is with . Hence .
By [L1], one-step GMRES minimizes , whose derivative is , so the minimizer is . Therefore .
A nonnormal matrix can make GMRES stagnate even when ordinary conditioning is not extreme
Statement refuted
Moderate ordinary conditioning by itself prevents GMRES stagnation.
The counterexample below shows a nonnormal matrix with for which the first GMRES step does not reduce the residual at all.
Facts & Assumptions
Given: The matrix , the right-hand side , and the initial guess .
The diagonalizable GMRES bound keeps the eigenvector-conditioning factor, not just the ordinary conditioning of (For a diagonalizable matrix, the GMRES residual bound carries the eigenvector-conditioning factor ).
Counterexample
The initial residual is , and the one-step GMRES search space is . The corresponding residual is , so , minimized at . Thus the first GMRES step leaves the residual norm equal to .
The matrix is invertible with , and has eigenvalues . Hence the singular values are and , so Therefore exact stagnation can occur even when ordinary conditioning is only moderate. This is consistent with [L1], which warns that nonnormal behavior depends on eigenvector geometry, not eigenvalues or alone.
Restarted GMRES can need more cycles than unrestarted GMRES on the same system
Example
For the system
full GMRES solves exactly in at most two steps because the matrix is , but restarted GMRES stagnates immediately: every one-step cycle returns the same iterate .
Facts & Assumptions
Given: The system from the previous counterexample.
Restarted GMRES keeps cyclewise minimization but need not inherit the full unrestarted termination guarantee (Restarted GMRES preserves cyclewise residual minimization but loses the unrestarted finite-termination guarantee).
Verification
The previous calculation gives the one-step GMRES minimizer , so a GMRES cycle starting from ends where it started. Restarting therefore reproduces the same residual and the same one-step problem, so every cycle returns again.
By contrast, unrestarted GMRES on an invertible system reaches the exact solution by step . Thus restart length preserves the cyclewise minimization promised by [L1] but discards the information needed for the full method's finite termination.
Matrix-free GMRES accesses the matrix only through applications of the operator to vectors
Example
Define a linear operator on by
Starting from , the first Krylov vectors are
So Arnoldi and GMRES can begin from repeated calls to the routine , without ever storing the full tridiagonal matrix of .
Facts & Assumptions
Given: The operator above and the start vector .
In the matrix-free model, Krylov methods need only operator applications, vector updates, inner products, and norms (The matrix-free access model for Krylov methods).
Restarted GMRES is built from ordinary GMRES cycles on such Krylov spaces (Restarted GMRES as repeated GMRES cycles on fixed-size Krylov spaces).
Verification
Direct evaluation of the operator routine gives the displayed vectors and . Those are exactly the data from which the first Krylov spaces and the first Arnoldi orthogonalization steps are formed.
No entrywise matrix storage was used in step 1.1: only the map , vector arithmetic, and inner products are needed. Therefore this sparse example fits the matrix-free access model [F1], and restarted cycles [F2] use the same access pattern on each new residual.
Sources
- Yousef Saad, CSCI 8314 Set 13: Krylov subspace methods; Introduction; Krylov subspaces; Gram-Schmidt process (review); The Arnoldi process; FOM and GMRES
- Lloyd N. Trefethen and David Bau III, Numerical Linear Algebra
- Yousef Saad, CSCI 8314 Set 14: Krylov subspace methods (continued); Practical variants: restarting and truncating; Hermitian case: The Lanczos algorithm; Conjugate gradients