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.
The two-dimensional BDDC and FETI-DP polylogarithmic bound
Statement
Assume the scalar model of Scalar finite-element substructuring model, matching shape-regular quasiuniform meshes on bounded-shape polygonal subdomains in two dimensions, all subdomain vertices primal, coefficient scaling on each open interface edge, and nonzero assembled and multiplier spaces. Then both preconditioned interface operators satisfy
The constant is independent of , , the number of subdomains, and arbitrary positive jumps in the coefficient values . If either preconditioned space is zero-dimensional, that interface solve is trivial and its condition number is not asserted. This statement does not cover three-dimensional vertex-only constraints, arbitrary graph or mesh geometries, or unaligned/intra-subdomain high-contrast coefficients.
Facts & Assumptions
Given: The scalar second-order subdomain diffusion family and its primal/dual preconditioners; write for the operator norm induced by the partially assembled Schur energy.
Eigenvalue bounds from a left-inverse preconditioner: for , preconditioned eigenvalues lie between and .
Coefficient-scaled averaging and BDDC: BDDC has .
FETI-DP dual system and preconditioner: FETI-DP has , , and ; the latter convention makes injective on .
BDDC and FETI-DP have matching nontrivial spectra: the two positive preconditioned spectra agree except possibly at .
Proof
Apply [F2] with and . The BDDC eigenvalues are at least one and at most . By the triangle inequality for the induced operator norm, . Since , squaring yields the BDDC bound with a geometry-only constant.
Apply [F2] with and . This bounds the eigenvalues of below by one and above by by [F1] and [F4]. The Gram factors and are positive definite: is injective on by [F4], is injective by , and is positive definite. Thus both maps are isomorphisms, and the stated product has the same spectrum because
The lower eigenvalue bounds bound both condition numbers by their respective largest eigenvalues. The common nonunit spectrum in [F5] confirms that the paired methods have the same nontrivial convergence spectrum; neither assertion introduces a 3D, arbitrary-graph or unaligned-coefficient claim excluded in the Statement.
Depends on
Used by
Dependency tree · two levels
15 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
- Olof B. Widlund, Introduction to the Design and Theory of Domain Decomposition Algorithms, DD20 Tutorial, pp. 94–97 (standard reference, not scraped)
- Oliver Rheinbach, Parallel Scalable Iterative Substructuring, Chapter 2 §2.4, Theorems 2.4.1–2.4.3 (standard reference, not scraped)
- Jan Mandel and Bedřich Sousedík, BDDC and FETI-DP under Minimalist Assumptions, §4 (standard reference, not scraped)