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.
Finite-dimensional Schwarz subspace-correction data
Definition
Work in exact real arithmetic. Let and , and let satisfy for every nonzero . Give the energy inner product and norm of The energy inner product and energy norm for a Hermitian positive-definite matrix. An operator is -self-adjoint when for all ; it is positive when for every nonzero . An -orthogonal projection is an idempotent -self-adjoint operator. Let be a finite ordered nonempty set and, for each , choose a full-column-rank prolongation with , and put . A one-level method has . A two-level method has , where and is the designated coarse space. Restriction of a global residual is and prolongation of a local coefficient vector is . Define the local energy matrix When the coarse index is present, is the Galerkin coarse matrix of Galerkin coarse matrices and the exact coarse-correction error map. By The Galerkin coarse correction is an energy-orthogonal projector, it is SPD and the exact coarse solve is well-defined.
For each , the exact local correction and additive preconditioner are When the spaces span , the exact additive Schwarz preconditioned operator is . For a fixed ordering of , a multiplicative sweep applies its corrections in that order; if is present, it is first. For an inexact additive method, replace each exact by the inverse of an SPD matrix satisfying, for fixed , For symmetric matrices, means for every vector . The order inequalities define uniform local spectral equivalence in this pair. The lemma Schwarz local matrices and exact solves are well defined ↗ proves the remaining local inverse and well-definedness claims.
Depends on
- Galerkin coarse matrices and the exact coarse-correction error map
- The Galerkin coarse correction is an energy-orthogonal projector
- The energy inner product $\langle u,v\rangle_A=\langle Au,v\rangle$ and energy norm $\|u\|_A$ for a Hermitian positive-definite matrix
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Transpose is linear and involutive, and $(AB)^{\mathsf T}=B^{\mathsf T}A^{\mathsf T}$
Used by
- A one-node coarse space misses a high-conductance channel Counterexample
- A uniform two-level 1D Poisson correction bound Example
- Inexact local solves enter through spectral-equivalence constants Example
- One-level point-patch Schwarz loses uniformity on 1D Poisson Example
- Exact Schwarz local corrections are energy-orthogonal projections Lemma
- Schwarz local matrices and exact solves are well defined Lemma
- The additive Schwarz inverse minimizes summed local energy Lemma
- Additive Schwarz condition bound from stable decomposition and synthesis Theorem
- Multiplicative Schwarz projection sweeps contract with explicit overlap constants Theorem
- Stable two-level P1 decomposition for structured Poisson meshes Theorem
- Two-level overlapping P1 Poisson bounds with explicit H-overlap dependence Theorem
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jinchao Xu, Iterative Methods by Space Decomposition and Subspace Correction, SIAM Review 34(4) (1992) (standard reference, not scraped)
- Peter Bastian, Lecture Notes on Parallel Solution of Large Sparse Linear Systems, University of Heidelberg (2015) (standard reference, not scraped)