Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 n≥1 and V=Rn, and let A=AT satisfy xTAx>0 for every nonzero x. Give V the energy inner product a(x,y)=xTAy and norm ∥x∥A2=a(x,x) of The energy inner product ⟨u,v⟩A=⟨Au,v⟩ and energy norm ∥u∥A for a Hermitian positive-definite matrix. An operator S is A-self-adjoint when a(Sx,y)=a(x,Sy) for all x,y; it is positive when a(Sx,x)>0 for every nonzero x. An A-orthogonal projection is an idempotent A-self-adjoint operator. Let I be a finite ordered nonempty set and, for each i∈I, choose a full-column-rank prolongation Ri∈Rn×ni with 1≤ni≤n, and put Vi=Ran⁡(Ri). A one-level method has I={1,…,m}. A two-level method has I={0,1,…,m}, where R0=P and V0 is the designated coarse space. Restriction of a global residual is RiT and prolongation of a local coefficient vector is Ri. Define the local energy matrix Ai=RiTARi. When the coarse index 0 is present, A0=PTAP 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 i∈I, the exact local correction and additive preconditioner are Πi=RiAi−1RiTA,B=∑i∈IRiAi−1RiT. When the spaces span V, the exact additive Schwarz preconditioned operator is BA=∑i∈IΠi. For a fixed ordering of I, a multiplicative sweep applies its corrections in that order; if 0 is present, it is first. For an inexact additive method, replace each exact Ai−1 by the inverse of an SPD matrix A~i satisfying, for fixed 0<α≤β, αAi⪯A~i⪯βAi,B~=∑i∈IRiA~i−1RiT. For symmetric matrices, X⪯Y means zTXz≤zTYz for every vector z. 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

Used by

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