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.
Static condensation is the exact interface problem
Statement
Let be local load contributions whose assembly is the global Galerkin load. For the global conforming Dirichlet finite-element system from Scalar finite-element substructuring model, eliminating all subdomain interior variables gives the assembled interface Schur system. Its solution trace is exactly the trace of the unique global Galerkin solution. After solving for this trace, reconstruct each local interior vector by
These interior values recover the unique global Galerkin solution; the trace-dependent homogeneous part of each local reconstruction is the discrete harmonic extension.
Facts & Assumptions
Given: The assembled global Galerkin right-hand side and stiffness system, its local interior/interface block partitions, the positive definite interior blocks, the local Schur complements, and the harmonic extensions. The local load vectors are chosen to assemble to that global right-hand side: interior entries are local, while contributions to a shared interface degree of freedom are summed.
Scalar finite-element substructuring model: the global stiffness is the sum of local subdomain contributions, with shared interface degrees of freedom assembled by equality of their nodal values.
Discrete harmonic extension and interface Schur complement: each local block has invertible , Schur complement , and harmonic extension .
An invertible leading block yields block LU through its Schur complement: for an invertible leading block , block elimination factors the matrix through and the same equations are solved by first eliminating the leading variables and then solving the Schur system.
Floating local kernels and positive interior blocks: the global Dirichlet stiffness matrix is positive definite and every local interior block is invertible.
Proof
Let be local load contributions whose assembly is the chosen global Galerkin load vector, as specified above. The global interior rows are local to each subdomain and give The local interface residual contribution is . Substituting the interior formula makes it , precisely the local Schur contribution in [F3]. The global interface rows are the assembled sum of these contributions, not separate local interface equations.
Sum the reduced equations from step 1.1 over subdomains and identify copies of each shared nodal value as in [F1]. Because both the stiffness and the local load vectors assemble by summing their shared interface components, this gives the assembled interface Schur system with the correspondingly reduced global right-hand side. Any solution of the original global system yields this trace. Conversely, a solution of the assembled interface system and the uniquely defined interior values from step 1.1 satisfy every local interior equation and the assembled sum of interface equations, hence the assembled global system.
The global stiffness is positive definite by [F4], so the original solution is unique. Once the interface trace is solved, each local interior vector is exactly the reconstruction formula in step 1.1, which is unique because is invertible. Its trace-dependent homogeneous part is from [F2]. Therefore static condensation is exact in both directions.
Depends on
Used by
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)
- Jan Mandel and Bedřich Sousedík, BDDC and FETI-DP under Minimalist Assumptions, §5 (standard reference, not scraped)