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.
Discrete harmonic extension and interface Schur complement
Definition
Use the interior/interface ordering of Scalar finite-element substructuring model. The boundary-trace spaces , , the conforming space , the partially assembled space , and the inclusion are those of Primal interface spaces and jump convention. In particular, identifies the copies of a conforming interface trace. In subdomain , write its stiffness matrix as
By Floating local kernels and positive interior blocks, is positive definite when nonempty; on the zero-dimensional interior space its unique endomorphism is invertible. For admissible boundary trace , the discrete harmonic extension is
The local interface Schur complement is
This is the Schur complement in Block LU factorisation and the associated Schur complement. The local Schur form on a trace is . The block identity and the associated block LU factorization use An invertible leading block yields block LU through its Schur complement with leading block . Assembling local Schur forms on gives ; restricting the same block-diagonal form to gives the partially assembled operator .
Depends on
Used by
- Coefficient-scaled averaging and BDDC Definition
- FETI-DP dual system and preconditioner Definition
- Two floating Poisson subdomains and primal anchoring Example
- Discrete Schur energy and the fractional trace norm Lemma
- Discrete harmonic extension minimizes energy Theorem
- Primal constraints remove local floating kernels Theorem
- Static condensation is the exact interface problem Theorem
Dependency tree · two levels
12 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. 35–37 (standard reference, not scraped)
- Oliver Rheinbach, Parallel Scalable Iterative Substructuring, Chapter 2, §§2.1–2.3 (standard reference, not scraped)