Alphabeta Math
Pipeline-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.

✓ 13 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Substructuring, FETI-DP and BDDC

1 · Prerequisites

2 · Summary

This page develops the primal and dual interface formulations for a conforming scalar P1 discretization of second-order diffusion. It defines local discrete harmonic extensions and Schur complements, proves exact static condensation, and shows how primal corner constraints remove floating-subdomain constants. BDDC restores interface continuity through coefficient-scaled averaging; FETI-DP enforces the remaining jumps with multipliers in the range of the jump map, so redundant multiplier rows do not create retained zero modes. The two preconditioners share their nonunit spectrum when they use the same constraints and scaling.

The polylogarithmic estimate is proved only for two-dimensional polygonal subdomains with bounded shape complexity, matching quasiuniform shape-regular triangulations, scalar coefficients constant on each subdomain, all subdomain vertices primal, and coefficient-based edge scaling. Both condition-number claims also assume nonzero assembled and multiplier spaces; zero-dimensional solves are trivial and have no asserted condition number. The proof establishes the local H1/2 trace lift, edge cutoff logarithm and averaging stability. It makes no three-dimensional vertex-only or arbitrary-geometry claim. Coarse-solver work is kept separate from conditioning.

The schematic interface convention is shown below. Rectangles are subdomains, the shared vertical side is an interface, filled dots are primal corners, and open circles are dual edge nodes. The drawing encodes only these definitions; no proof uses it.

\begin{tikzpicture}[scale=0.9]
  \draw (0,0) rectangle (4,2);
  \draw (2,0) -- (2,2);
  \node at (1,1.5) {$\Omega_i$};
  \node at (3,1.5) {$\Omega_j$};
  \fill (2,0) circle (2pt);
  \fill (2,2) circle (2pt);
  \draw[fill=white] (2,0.65) circle (2pt);
  \draw[fill=white] (2,1.00) circle (2pt);
  \draw[fill=white] (2,1.35) circle (2pt);
  \node[anchor=west] at (2.08,0.65) {dual nodes};
  \node[anchor=west] at (2.08,1.90) {primal corners};
\end{tikzpicture}

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Scalar finite-element substructuring model

Definition

Fix a bounded, connected polygonal open set Ω⊂R2 with a nonempty Dirichlet boundary segment. A finite subdomain partition is a family of connected polygonal open sets Ωi, 1≤i≤N, whose closures cover Ω‾, whose interiors are disjoint, and for which Ω‾i∩Ω‾j (i≠j) is a whole common side, a common vertex, or empty. The outer Dirichlet segment is a union of mesh boundary sides. The edge-adjacency graph of each triangulated subdomain is connected, and the subdomain adjacency graph is connected to the Dirichlet boundary. Each subdomain has a matching affine simplicial triangulation; the triangulations match on every shared side. The family has a fixed shape-regularity bound, quasiuniform mesh size hi, uniformly bounded polygon side count, corner angles bounded below, inradius comparable to Hi, and a uniform interior-cone parameter. Write Hi=diam⁡(Ωi) and H/h=max⁡iHi/hi.

Use continuous piecewise-affine (P1) scalar functions on each triangulation. The reference-element and face-matching conventions are those of Reference finite elements and unisolvent degrees of freedom, Matching affine simplicial meshes and shape regularity, and Broken and conforming polynomial spaces on a matching mesh: local polynomials are affine, their nodal values determine them, and conforming functions have equal traces across a shared side. For each subdomain choose a coefficient ρi>0, constant on Ωi but allowed to jump across interfaces. Its local energy is

ai(v,w)=ρi∑K⊂Ωi∫K∇v⋅∇w dx.

The global finite-element space consists of the continuous piecewise-affine functions on the subdomain meshes that vanish on the outer Dirichlet boundary, with energy a(v,w)=∑iai(v∣Ωi,w∣Ωi). Local interior degrees of freedom are the mesh vertices strictly inside Ωi; local boundary degrees of freedom are its remaining vertices, with outer Dirichlet values fixed to zero. A floating local block means the same local energy before any outer-boundary values are fixed. A subdomain corner is a vertex of its polygonal boundary.

For uniform estimates, the fixed polygon-shape parameters include the scaled Lipschitz character: after rescaling each subdomain to diameter one, its boundary has a graph-chart cover with uniformly bounded chart count and Lipschitz constants and a uniformly positive neighborhood radius. The scaled mean-zero Poincaré constants are also included among these fixed shape parameters. A pointwise interior-cone bound alone is not a substitute for this uniform boundary-chart data. All constants in later two-dimensional estimates may depend on these polygon-shape, side-count, and mesh shape-regularity bounds, but not on h, H, the number of subdomains, or the positive numbers ρi.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Eigenvalue bounds from a left-inverse preconditioner

Statement

Let A:V→V′ be symmetric positive definite on a finite-dimensional real vector space, and let L:V→U, T:U→V satisfy LT=IU. Every eigenvalue of

G=(LA−1LT)(TTAT)

lies in [1,∥TL∥A2], where ∥Q∥A:=sup⁡v≠0⟨AQv,Qv⟩/⟨Av,v⟩. When V={0}, set ∥Q∥A=0 for its unique endomorphism. In that case LT=IU forces U={0}, the spectrum of G is empty, and the eigenvalue assertion is vacuous.

Facts & Assumptions

Given: Finite-dimensional real spaces V,U, a symmetric positive definite operator A:V→V′, linear maps L:V→U and T:U→V, and LT=IU.

[A1]

The energy form ⟨Av,v⟩ is positive for every nonzero v∈V, and LT is the identity on U.

Proof

1.1givenA1algebra

If V={0}, the identity LT=IU forces U={0} and G has no eigenvalues, so the assertion holds with the stated zero-space norm convention. Assume henceforth V≠{0}. Put D=TTAT, which is SPD because T is injective (if Tu=0, then u=LTu=0), and C=LA−1LT, which is SPD because L is onto (it has right inverse T). Hence G=CD is similar to the symmetric positive definite matrix D1/2CD1/2 and has positive real eigenvalues. For an eigenvector u≠0 with eigenvalue λ, let w=A−1LTDu, so Lw=Gu=λu and ∥w∥A2=⟨Du,Gu⟩=λ⟨Du,u⟩.

2.1givenA1step 1.1algebra

By [A1], ⟨Du,u⟩=⟨Du,LTu⟩=⟨Aw,Tu⟩. Cauchy–Schwarz in the A inner product gives ⟨Du,u⟩2≤∥w∥A2∥Tu∥A2=λ⟨Du,u⟩2. Dividing by the positive square gives λ≥1.

3.1givenA1step 1.1algebra∎

Also ∥Gu∥D2=∥TLw∥A2≤∥TL∥A2∥w∥A2. For the eigenvector, the left side is λ2⟨Du,u⟩ and step 1.1 makes the right side ∥TL∥A2λ⟨Du,u⟩. Divide by the positive factor to obtain λ≤∥TL∥A2.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Floating local kernels and positive interior blocks

Statement

In the setting of Scalar finite-element substructuring model, the nullspace of the floating local energy matrix on a connected Ωi is exactly the one-dimensional space of constants. The principal stiffness block KII(i) on interior nodal values with zero boundary trace is positive definite (including the empty 0-dimensional block convention). The assembled global Dirichlet stiffness matrix is positive definite.

Facts & Assumptions

Given: A connected, face-matched P1 triangulation of each Ωi, ρi>0, and the nonempty global Dirichlet boundary from Scalar finite-element substructuring model.

[F1]

Scalar finite-element substructuring model: ai(v,v)=ρi∑K∫K∣∇v∣2; local functions are continuous and affine on every triangle; each subdomain's triangle edge-adjacency graph is connected.

[F2]

Scalar finite-element substructuring model: the global functions are continuous across every subdomain interface and vanish on a nonempty outer boundary segment.

Proof

1.1givenF1algebra

If ai(v,v)=0, each nonnegative term ρi∫K∣∇v∣2 is zero. Since ∇v is constant on each triangle, it vanishes on every triangle, so v is constant there. Continuity across every shared edge makes neighboring constants equal; connectedness of the triangle adjacency graph makes v one constant on all of Ωi. Conversely, a constant has zero gradient, hence lies in the kernel. This proves the floating-block nullspace claim.

2.1givenstep 1.1

A vector in the interior block's kernel defines a local P1 function with zero boundary trace and zero energy. Step 1.1 makes it constant and the zero boundary trace makes that constant zero. Thus the interior quadratic form is strictly positive on every nonzero vector, so its symmetric matrix KII(i) is positive definite. If there are no interior vertices, the unique map on the zero vector space is invertible.

3.1givenF2step 1.1∎

If the global energy vanishes, step 1.1 applied triangle by triangle gives one constant on every subdomain. Interface continuity makes adjacent subdomain constants equal; connectedness propagates one constant through Ω. The nonempty Dirichlet segment forces it to be zero. Hence only the zero global vector has zero quadratic energy, proving positive definiteness.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Primal interface spaces and jump convention

Definition

For each i, let Wi be the vector space of local boundary nodal traces compatible with the fixed outer Dirichlet values, and set W=∏iWi (all interface copies independent). Let W^⊂W be the subspace whose nodal traces agree at every shared interface node; let R:W^→W be the inclusion. Choose a set of primal constraints, meaning finitely many linear functionals on local traces whose values are required to agree across their incident subdomains. Vertex values and normalized edge averages are examples. The partially assembled space W~ is the subspace of W satisfying those primal equalities, so W^⊂W~⊂W.

The remaining continuity equations are collected in a jump map B:W~→Rm with ker⁡B=W^. It may contain redundant rows. Fix the redundant-multiplier convention Λ:=range⁡B with its inherited Euclidean inner product: multiplier vectors are elements of this range, not arbitrary row-coordinate vectors modulo an unstated choice. Then BT is injective on Λ. For the PE26 two-dimensional estimate, all subdomain vertices are primal and the only remaining jump rows are nodal differences on open interface edges, each shared by exactly two subdomains.

An interface corner is primal whenever its value is among the selected primal functionals. An edge average on a side E is ∣E∣−1∫Evh ds, which is a finite sum of nodal values for a P1 trace. The two-dimensional bound below uses corner constraints; no edge-average bound is claimed there.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Discrete harmonic extension and interface Schur complement

Definition

Use the interior/interface ordering of Scalar finite-element substructuring model. The boundary-trace spaces Wi, W=∏iWi, the conforming space W^, the partially assembled space W~, and the inclusion R:W^→W are those of Primal interface spaces and jump convention. In particular, R identifies the copies of a conforming interface trace. In subdomain i, write its stiffness matrix as

Ki=(KII(i)KIΓ(i)KΓI(i)KΓΓ(i)).

By Floating local kernels and positive interior blocks, KII(i) is positive definite when nonempty; on the zero-dimensional interior space its unique endomorphism is invertible. For admissible boundary trace gi, the discrete harmonic extension is

Higi:=(−(KII(i))−1KIΓ(i)gigi).

The local interface Schur complement is

Si:=KΓΓ(i)−KΓI(i)(KII(i))−1KIΓ(i).

This is the Schur complement in Block LU factorisation and the associated Schur complement. The local Schur form on a trace is giTSigi. The block identity and the associated block LU factorization use An invertible leading block yields block LU through its Schur complement with leading block KII(i). Assembling local Schur forms on W^ gives S^=RT(diag⁡iSi)R; restricting the same block-diagonal form to W~ gives the partially assembled operator S~.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Primal constraints remove local floating kernels

Statement

Assume the hypotheses of Primal interface spaces and jump convention and the energy setting of Floating local kernels and positive interior blocks. If each floating local component has at least one primal vertex value fixed in its dual subproblem, its local dual stiffness is positive definite. If all subdomain vertices are primal and the global Dirichlet boundary is nonempty, the partially assembled interface energy is positive definite; hence the BDDC and FETI-DP exact local and coarse solves are well-defined.

Facts & Assumptions

Given: A conforming finite partition with connected subdomain adjacency, a nonempty global Dirichlet boundary, and primal constraints containing every subdomain vertex for the PE26 branch.

[F1]

Floating local kernels and positive interior blocks: each connected floating local energy has kernel exactly the constants.

[F2]

Primal interface spaces and jump convention: W~ shares primal corner values and W^=ker⁡B is the fully continuous trace space.

[F3]

Discrete harmonic extension and interface Schur complement: Higi=(−[KII(i)]−1KIΓ(i)gi,gi)T and Si=KΓΓ(i)−KΓI(i)[KII(i)]−1KIΓ(i); S~ restricts diag⁡iSi to W~. The interior inverse includes the empty-space convention established there.

Proof

1.1givenF1F2F3algebra

From [F3], block multiplication gives KiHigi=(0,Sigi)T and therefore (Higi)TKi(Higi)=giTSigi. Thus a zero local Schur energy is precisely zero energy of its harmonic lift. In a local dual subproblem the primal values are prescribed, so a zero-energy local vector, or the harmonic lift of a zero-energy dual trace, is constant by [F1]. A primal corner value is among its prescribed values; because the dual correction has zero primal values, that constant is zero. The local dual quadratic form therefore has trivial kernel and, being symmetric positive semidefinite, is positive definite.

2.1givenF1F2F3step 1.1algebra

For g=(gi)∈W~, [F3] and step 1.1 give gTS~g=∑igiTSigi=∑i(Higi)TKi(Higi). Each summand is a nonnegative local energy. If the partially assembled energy is zero, every summand is zero, so [F1] makes each local harmonic extension constant on its subdomain. Neighboring local constants agree at their shared primal corner. The adjacency graph is connected, so all constants agree; the global Dirichlet boundary makes the common value zero. Thus the partially assembled trace is zero, and its assembled energy matrix is positive definite.

3.1step 1.1step 2.1F2∎

The BDDC local dual solves use the positive local restrictions from step 1.1 and its coarse solve uses the positive partially assembled energy from step 2.1. The FETI-DP operator uses the same invertible partially assembled energy and the jump quotient of [F2]. Hence the exact local, coarse and dual systems named in the Statement are well-defined.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Discrete harmonic extension minimizes energy

Statement

For every admissible local trace gi, Higi from Discrete harmonic extension and interface Schur complement is the unique finite-element function with trace gi minimizing ai(v,v). The minimum is giTSigi.

Facts & Assumptions

Given: The local block matrix Ki, positive definite interior block KII(i), trace gi, harmonic lift Higi, and Schur matrix Si.

[F1]

Discrete harmonic extension and interface Schur complement: Higi=(−KII−1KIΓgi,gi)T and Si=KΓΓ−KΓIKII−1KIΓ.

[F2]

Floating local kernels and positive interior blocks: KII(i) is positive definite, so its quadratic form is nonnegative and vanishes only at zero.

Proof

1.1givenF1algebra

Any local vector with trace gi has the form v=Higi+(z,0)T. By [F1], the interior block row of KiHigi is KII(−KII−1KIΓgi)+KIΓgi=0. Hence the energy cross term between Higi and (z,0) vanishes, and vTKiv=(Higi)TKi(Higi)+zTKIIz.

2.1givenF1F2step 1.1algebra∎

By [F2], the last term is nonnegative and is zero only for z=0. Thus Higi is the unique minimizer. Multiplying the block expression in [F1] gives (Higi)TKi(Higi)=giT(KΓΓ−KΓIKII−1KIΓ)gi=giTSigi.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Static condensation is the exact interface problem

Statement

Let fi=(fI(i),fΓ(i))T 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

uI(i)=(KII(i))−1(fI(i)−KIΓ(i)uΓ(i)).

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.

[F1]

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.

[F2]

Discrete harmonic extension and interface Schur complement: each local block has invertible KII(i), Schur complement Si, and harmonic extension Hi.

[F3]

An invertible leading block yields block LU through its Schur complement: for an invertible leading block A11, block elimination factors the matrix through S=A22−A21A11−1A12 and the same equations are solved by first eliminating the leading variables and then solving the Schur system.

[F4]

Floating local kernels and positive interior blocks: the global Dirichlet stiffness matrix is positive definite and every local interior block is invertible.

Proof

1.1givenF1F2F3algebra

Let fi=(fI(i),fΓ(i))T 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 uI(i)=(KII(i))−1(fI(i)−KIΓ(i)uΓ(i)). The local interface residual contribution is KΓI(i)uI(i)+KΓΓ(i)uΓ(i)−fΓ(i). Substituting the interior formula makes it SiuΓ(i)−(fΓ(i)−KΓI(i)(KII(i))−1fI(i)), precisely the local Schur contribution in [F3]. The global interface rows are the assembled sum of these contributions, not separate local interface equations.

2.1givenF1step 1.1

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.

3.1F2F4step 1.1step 2.1∎

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 KII(i) is invertible. Its trace-dependent homogeneous part is HiuΓ(i) from [F2]. Therefore static condensation is exact in both directions.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Coefficient-scaled averaging and BDDC

Definition

Use the spaces and partial Schur operator of Primal interface spaces and jump convention and Discrete harmonic extension and interface Schur complement. Let E0:W~→W^ average every remaining interface degree of freedom and preserve every already-shared primal value. It is a scaled average if the weights for all copies of each such degree of freedom sum to one. Put Eˉ:=RE0:W~→W~. Then E0R=IW^ and Eˉ is a projection onto W^.

In the PE26 two-dimensional corner-constraint branch, each non-primal node is interior to one interface edge shared by exactly two subdomains i,j. Set

(E0w)(x)=ρiρi+ρjwi(x)+ρjρi+ρjwj(x).

At primal nodes the copies already agree, so the average is the common value. For any finite-dimensional positive definite partial Schur operator S~, the BDDC preconditioner is

MBDDC−1:=E0S~−1E0T:W^′→W^,

for the assembled interface system with operator S^=RTS~R. Its constrained partial-energy interpretation is established in BDDC is the constrained partial-energy minimizer ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Discrete Schur energy and the fractional trace norm

Statement

Let Ωi be one of the shape-regular polygonal subdomains in Scalar finite-element substructuring model, with a matching quasiuniform P1 mesh. For any continuous piecewise-linear boundary trace g, let Sifl be the Schur complement of the floating local stiffness matrix, before outer Dirichlet values are fixed, formed by the same interior elimination as in Discrete harmonic extension and interface Schur complement. Define

∣g∣1/2,∂Ωi2:=∫∂Ωi∫∂Ωi∣g(s)−g(t)∣2∣s−t∣2 ds dt.

This seminorm is taken modulo constants. The floating local Schur energy satisfies

cρi∣g∣1/2,∂Ωi2≤gTSiflg≤Cρi∣g∣1/2,∂Ωi2,

where c,C>0 depend only on the fixed scaled polygon-shape parameters (including boundary-chart and mean-zero Poincaré bounds), mesh shape-regularity and quasiuniformity. The upper bound is realized by a boundary-preserving finite-element lifting; the minimum-energy lifting is the floating discrete harmonic extension. For an admissible trace g, whose outer Dirichlet values are zero, gTSiflg=gTSig for the Dirichlet-restricted Schur matrix of Discrete harmonic extension and interface Schur complement, so the same inequalities hold for that matrix on its domain.

Facts & Assumptions

Given: A fixed polygonal subdomain, a shape-regular quasiuniform matching affine triangulation, an arbitrary P1 boundary trace g, and the floating local stiffness matrix.

[F1]

Scalar finite-element substructuring model: the local energy is ρi∫Ωi∣∇vh∣2, and all geometric constants are uniform over the specified family.

[F2]

Discrete harmonic extension and interface Schur complement: the Schur complement is formed by eliminating the invertible interior block; on admissible traces its harmonic lift has energy gTSig.

[F3]

Discrete harmonic extension minimizes energy: for an admissible trace g, its harmonic extension minimizes energy among all local finite-element lifts of g.

Proof

1.1givenF1constructalgebra

On the upper half-plane, Fourier transformation in the tangential variable gives, for a smooth lift V with trace g, ∣ξ∣∣g^(ξ)∣2≤∫0∞(∣∂tV^(ξ,t)∣2+∣ξ∣2∣V^(ξ,t)∣2) dt. Indeed, integrate −∂t∣V^∣2 and apply 2ab≤a2+b2. Integration in ξ proves the trace seminorm bound. Conversely, V^(ξ,t)=e−t∣ξ∣g^(ξ) has gradient energy ∫∣ξ∣∣g^(ξ)∣2 dξ. In a bounded chart, multiply the half-plane extension by a fixed cutoff in the inward coordinate; the added gradient term is controlled by the localized L2 boundary norm, hence by the full H1/2 norm after constants are removed. A finite collection of Lipschitz graph charts covers the polygon boundary, including its corners. Flattening each chart is bi-Lipschitz, so it changes the H1 gradient and boundary Gagliardo seminorm by bounded factors. Applying a partition of unity and the half-plane trace inequality to arbitrary chart-localized lifts gives ∣g∣1/2,∂Ωi≤C∥V∥H1(Ωi). Subtract the domain mean of V and use scaled Poincar'e to replace the full H1 norm by ∥∇V∥L2. In the other direction, apply a partition of unity to boundary data, use the half-plane extensions, and sum to obtain a right inverse of the trace. First subtract a boundary constant; the fractional Poincaré bound on the whole boundary controls the localized full norms: for the boundary mean c, ∥g−c∥L2(∂Ωi)2≤Hi2∣g∣1/2,∂Ωi2/(2∣∂Ωi∣), by integrating ∣s−t∣≤Hi. Add that constant back as a constant lift, which has zero gradient. The chart count, scaled radii, Lipschitz constants and mean-zero Poincaré bounds are precisely the fixed shape parameters in [F1]; a pointwise interior-cone condition alone would not justify this uniformity.

1.2givenF1constructalgebra

Construct an interpolant Ih:H1(Ωi)→Vh as follows. For each interior mesh vertex choose one incident triangle and set its coefficient to the average of V on that triangle. For each boundary vertex choose one incident boundary edge and set its coefficient to the integral of the trace of V against the L2-dual function to the endpoint nodal basis on that edge. These dual functionals reproduce every affine edge trace, so the trace of IhV is exactly g whenever the trace of V is g. All coefficients reproduce constants. For a triangle K, the chosen elements and edges for its vertices lie in a connected patch ωK of diameter at most Ch containing a uniformly bounded number of triangles; these patches have bounded overlap. Let cK be the mean of V on ωK. Scaled Poincaré gives ∥V−cK∥L2(ωK)≤Ch∥∇V∥L2(ωK), and the scaled trace inequality gives ∥V−cK∥L2(e)≤Ch1/2∥∇V∥L2(ωK) on a selected boundary edge e. Thus each interior average coefficient of V−cK is bounded by C∥∇V∥L2(ωK). A boundary dual function has L2(e) norm at most Ch−1/2, so its coefficient has the same bound. Since IhcK=cK and the affine basis functions have uniformly bounded L2(K) gradient norms in two dimensions, ∥∇IhV∥L2(K)≤C∥∇V∥L2(ωK). Summing and using bounded overlap proves ∥∇IhV∥L2(Ωi)≤C∥∇V∥L2(Ωi).

2.1F1F2F3step 1.1step 1.2algebra∎

For any finite-element lift vh of g, step 1.1 gives ∣g∣1/2,∂Ωi2≤C∥∇vh∥L2(Ωi)2. For the floating matrix, put Hflg=(−KII−1KIΓg,g)T. Symmetry of the local Poisson form and its zero interior row give ai(Hflg+(z,0),Hflg+(z,0))=gTSiflg+zTKIIz. The positive interior block from [F2] therefore makes gTSiflg the unique fixed-trace minimum, by the same identity as [F3]. Taking that minimum gives the lower Schur bound. For the upper bound, step 1.1 supplies a continuous lift V with gradient energy at most C∣g∣1/2,∂Ωi2, and step 1.2 gives a boundary-preserving finite-element lift IhV with the same bound up to a uniform factor. The just-proved floating minimality bounds its energy by this lift. Multiplication by ρi proves both inequalities. If g is admissible, the fixed-trace feasible lifts already vanish on the outer Dirichlet portion; [F2]–[F3] identify the same minimum with gTSig.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

BDDC is the constrained partial-energy minimizer

Statement

For every assembled residual f∈W^′, the unique minimizer over w∈W~ of

Jf(w)=12⟨S~w,w⟩−⟨f,E0w⟩

is w∗=S~−1E0Tf. The conforming correction returned by BDDC is E0w∗=E0S~−1E0Tf.

Facts & Assumptions

Given: The positive definite partial Schur operator S~, the averaging map E0, and an assembled residual f.

[F1]

Coefficient-scaled averaging and BDDC: E0:W~→W^ is linear and MBDDC−1=E0S~−1E0T.

[F2]

Primal constraints remove local floating kernels: under the stated primal anchoring, S~ is positive definite.

Proof

1.1givenF1algebra

Differentiating the finite-dimensional quadratic in a direction z∈W~ gives Jf′(w)[z]=⟨S~w,z⟩−⟨f,E0z⟩. Thus its critical point solves S~w=E0Tf, whose unique solution is w∗=S~−1E0Tf.

2.1givenF1F2step 1.1algebra∎

For any z∈W~, expansion about the critical point yields Jf(w∗+z)=Jf(w∗)+12⟨S~z,z⟩. By [F2] the added term is positive unless z=0, so w∗ is the unique global minimizer. Applying E0 gives the displayed BDDC correction by [F1].

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

FETI-DP dual system and preconditioner

Definition

Use W~, W^, E0, R, B and Λ=range⁡B as defined in Primal interface spaces and jump convention and Coefficient-scaled averaging and BDDC. Assume that S~:W~→W~′ is symmetric positive definite. In the PE26 corner branch this follows from Primal constraints remove local floating kernels when all subdomain vertices are primal and the global Dirichlet boundary is nonempty; for other primal choices it is a separate admissibility requirement. Use the inherited Euclidean inner product to identify Λ with Λ′ in the transpose and coordinate formulas below. Regard Eˉ=RE0 as a projection on W~. Since ker⁡B=range⁡Eˉ=W^, each class of traces with the same jump has a unique representative in ker⁡Eˉ. Define BDT:Λ→W~ by assigning to λ∈Λ that unique representative w with Bw=λ and Eˉw=0. This is the scaled right inverse; it obeys BBDT=IΛ and BDTB=IW~−Eˉ. The latter identity makes the primal and dual projections complementary. In the two-subdomain edge case, its two entries are the coefficient-scaled jump weights complementary to those in E0.

The FETI-DP dual operator and its preconditioner are

F:=BS~−1BT:Λ→Λ′,MFETI−DP−1:=BDS~BDT:Λ′→Λ.

The multiplier convention removes dependent row coordinates: λ is in range⁡B, so no arbitrary multiplier component in ker⁡BT is retained. Elimination of the partially assembled displacement and the resulting exact dual system are proved in FETI-DP is the exact dual Schur system ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Two-dimensional logarithmic edge cutoff estimates

Statement

Let E be a side of a shape-regular polygon of diameter H with a matching quasiuniform P1 boundary mesh of size h. Let θE be the piecewise-linear boundary function equal to 1 at the interior nodes of E and 0 at the endpoints and all other boundary nodes. For

∥q∥00,E2:=∫E∫E∣q(s)−q(t)∣2∣s−t∣2 ds dt+∫E∣q(s)∣2dist⁡(s,∂E) ds,

one has ∥θE∥00,E2≤C(1+log⁡(H/h)). Also every continuous piecewise-affine uh on Ωi satisfies

∥uh−u‾Ωi∥L∞(Ωi)2≤C(1+log⁡(Hi/hi))∥∇uh∥L2(Ωi)2.

Consequently, for the edge mean u‾E,

∥Ih(θE(uh−u‾E))∥00,E2≤C(1+log⁡(Hi/hi))2∥∇uh∥L2(Ωi)2,

where Ih is nodal piecewise-linear interpolation on E.

Facts & Assumptions

Given: A bounded-shape polygon, a shape-regular quasiuniform P1 mesh, one side E, and the seminorm/lifting equivalence of Discrete Schur energy and the fractional trace norm.

[F1]

Scalar finite-element substructuring model: Hi/hi is the subdomain-to-mesh ratio, and shape regularity, polygon angles, the interior-cone parameter, scaled boundary-chart bounds and scaled mean-zero Poincare constants are uniform.

[F2]

Discrete Schur energy and the fractional trace norm: the floating local Schur energy gTSiflg is the minimum over finite-element lifts of arbitrary boundary traces, is equivalent to the boundary Gagliardo seminorm modulo constants, and boundary P1 data admit a stable finite-element lift.

Proof

1.1givenF1algebra

If E has no interior boundary node, then θE=0. If ∣E∣/h≤4, scaling E to unit length gives a uniform bound on both terms of ∥θE∥00,E2. Otherwise the first and last mesh intervals have length comparable to h, θE is linear from 0 to 1 and from 1 to 0 there, and it equals 1 between them. The weighted integral on either endpoint interval is bounded by ∫0h(s/h)2 ds/s≤C; the plateau contributes at most C+log⁡(∣E∣/h)≤C+log⁡(H/h). In the double integral, pairs in the plateau contribute zero. Pairs within one endpoint interval have integrand at most Ch−2 and hence contribute at most a constant. For one point s in an endpoint interval and one outside it, integrating (1−s/h)2/(t−s)2 in the outside variable and then in s gives a constant; the two endpoint intervals are treated in the same way. Therefore ∥θE∥00,E2≤C(1+log⁡(H/h)).

1.2givenF1constructalgebra

Put vh=uh−u‾Ωi, H=Hi, h=hi and G=∥∇vh∥L2(Ωi). Choose a triangle K containing a point where ∣vh∣ is maximal, and let x0 be its centroid. Affine scaling gives ∥vh∥∞≤∣vh(x0)∣+CG. The uniform interior-cone condition in [F1] supplies at x0 a cone of radius R=cH and angular interval J of fixed positive length, contained in Ωi. Quasiuniformity and affine scaling give the global inverse bound ∥∇vh∥∞≤Ch−1G. If H/h is bounded, the inverse bound ∥vh∥∞≤Ch−1∥vh∥L2 and mean-zero scaled Poincaré prove the claim directly. Otherwise choose ε=c′h<R/2. Along each cone ray, the integral of ∣∇vh∣ from 0 to ε is at most CG, while weighted Cauchy–Schwarz gives ∣∫εr∂svh(x0+seθ) ds∣2≤log⁡(R/ε)∫εR∣∇vh(x0+seθ)∣2s ds. Express vh(x0) by its value at x0+reθ minus these two radial integrals, square, and average with measure r dr dθ over R/2<r<R, θ∈J. The annulus has area comparable to H2; the ray-energy term is independent of r and integrates in θ to at most G2. Hence ∣vh(x0)∣2≤CH−2∥vh∥L22+C(1+log⁡(H/h))G2. Mean-zero scaled Poincaré bounds the first term by CG2, and the centroid comparison proves the asserted L∞ estimate. This is the radial argument underlying Widlund's estimate (5), with the centroid-to-maximum comparison included explicitly.

2.1givenF1F2step 1.1step 1.2algebra∎

Put z=uh−u‾E. In the first Gagliardo term use θ(s)z(s)−θ(t)z(t)=θ(s)(z(s)−z(t))+z(t)(θ(s)−θ(t)). The weighted term is bounded by ∥z∥∞2∫EθE2/dist⁡(s,∂E) ds. Together these give ∥θEz∥00,E2≤C(∣z∣H1/2(E)2+(1+log⁡(H/h))∥z∥∞2). On the two endpoint mesh intervals, Ih(θEz)−θEz is a quadratic interpolation error vanishing at both endpoints; scaling the interval to unit length bounds its 00,E norm by C∥z∥∞2. The same estimate therefore holds for Ih(θEz). The floating local Schur energy of the trace of uh is at most ρi∥∇uh∥L2(Ωi)2 because it is the minimum over finite-element lifts; the lower trace-Schur bound in [F2] therefore gives ∣z∣H1/2(E)2≤C∥∇uh∥L2(Ωi)2. Also ∣u‾E−u‾Ωi∣≤∥uh−u‾Ωi∥L∞(Ωi), so ∥z∥∞≤2∥uh−u‾Ωi∥L∞(Ωi). Combining this with steps 1.1 and 1.2 proves the claimed squared-logarithmic multiplier estimate.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

FETI-DP is the exact dual Schur system

Statement

Let f∈W^′ and set f~=E0Tf. The constrained minimization problem

min⁡w∈W~, Bw=0(12⟨S~w,w⟩−⟨f~,w⟩)

has the saddle equations S~w+BTλ=f~, Bw=0. Eliminating w gives the FETI-DP dual system

BS~−1BTλ=BS~−1E0Tf.

On Λ=range⁡B its matrix is positive definite, and the exact multiplier solution reconstructs the unique assembled interface solution w∈W^.

Facts & Assumptions

Given: S~ is positive definite on W~, B:W~→Λ is onto with ker⁡B=W^, and E0 is the projection used by BDDC.

[F1]

FETI-DP dual system and preconditioner: F=BS~−1BT and the multiplier space is Λ=range⁡B.

[F2]

Primal interface spaces and jump convention: ker⁡B=W^ and redundant multiplier rows are represented by their range.

[F3]

Primal constraints remove local floating kernels: all subdomain vertices primal and a nonempty global Dirichlet boundary suffice for positive definiteness of S~. Here positive definiteness is an explicit hypothesis, also for other primal choices.

Proof

1.1givenF1F2algebra

The Lagrangian is L(w,λ)=12⟨S~w,w⟩−⟨E0Tf,w⟩+⟨λ,Bw⟩. Its derivative in arbitrary z∈W~ is ⟨S~w+BTλ−E0Tf,z⟩, and its multiplier derivative is Bw. Setting both derivatives to zero gives the displayed saddle equations.

2.1givenstep 1.1algebra

By the assumed positive definiteness of S~, the first equation has the unique solution w=S~−1(E0Tf−BTλ). Substitution into Bw=0 gives the displayed dual system.

3.1F1F2F3step 2.1algebra∎

If λ∈Λ and BTλ=0, write λ=Bv using [F2]. Then ⟨λ,λ⟩=⟨Bv,λ⟩=⟨v,BTλ⟩=0, hence λ=0. Thus BT is injective on Λ, and ⟨Fλ,λ⟩=⟨S~−1BTλ,BTλ⟩>0 for every nonzero λ. The exact solution satisfies Bw=0, so by [F2] it lies in W^ and solves the assembled variational problem.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Complementary primal and dual projections share nonunit spectrum

Statement

Let V,U1,U2 be finite-dimensional real vector spaces, let A:V→V′ be symmetric positive definite, and let Li:V→Ui, Ti:Ui→V satisfy LiTi=IUi for i=1,2 and T1L1+T2L2=IV. Then the operators

G1=(L1A−1L1T)(T1TAT1),G2=(T2TAT2)(L2A−1L2T)

have the same eigenvalues, with the same multiplicities, except possibly at the eigenvalue 1.

Facts & Assumptions

Given: Finite-dimensional spaces, A symmetric positive definite, and the four displayed left-inverse and complementary-projection identities.

Proof

1.1givenalgebra

The products G1 and G2 act on U1 and U2′, respectively. Set X=L1A−1L2T:U2′→U1 and Y=T2TAT1:U1→U2′. By the given hypotheses, L1T1=I, L2T2=I, and T1L1+T2L2=I. Expanding the products gives G1−I=−XY and G2−I=−YX. In detail, G1−I=L1A−1((T1L1)T−I)AT1=−L1A−1L2TT2TAT1; also YX=T2TA(I−T2L2)A−1L2T=I−G2.

2.1givenstep 1.1algebra

If u∈U1 satisfies G1u=λu with λ≠1, then XYu=(1−λ)u, so Yu≠0. The identity G2−I=−YX gives (G2−I)Yu=−YXYu=(λ−1)Yu, hence G2(Yu)=λYu. For v∈U2′, the reverse map is v↦−Xv/(λ−1); the same identities show it is the inverse on the λ-eigenspaces. Thus these eigenspaces are isomorphic.

3.1givenstep 2.1algebra∎

Choose bases of the finite-dimensional spaces and their dual bases. Both operators are diagonalizable: T1TAT1 and L1A−1L1T are positive definite, so, writing D1=T1TAT1, G1 is similar to the symmetric positive definite product D11/2(L1A−1L1T)D11/2; likewise G2 is similar to D21/2(L2A−1L2T)D21/2, where D2=T2TAT2. The left-inverse identities make Ti injective and Li surjective, proving each factor is positive definite. Therefore equal eigenspace dimensions from step 2.1 give equal algebraic multiplicities for every λ≠1.

Remarks

Coefficient-scaled averaging and BDDC: for BDDC, L1=E0, T1=R, and E0R=IW^.

FETI-DP dual system and preconditioner: for FETI-DP, L2=B, T2=BDT, BBDT=IΛ, and BDTB+RE0=IW~.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Two-dimensional scaled averaging energy bound

Statement

Assume the model of Scalar finite-element substructuring model, all subdomain vertices primal, and the coefficient-scaled average of Coefficient-scaled averaging and BDDC. Let P:=I−RE0 be the complementary jump projection on W~, and let ∥⋅∥S~ be the energy norm induced by the partially assembled Schur operator. Then

∥Pw∥S~2≤C(1+log⁡(H/h))2∥w∥S~2(w∈W~),

where C depends only on the polygon/mesh shape bounds and bounded side count. It is independent of coefficient jumps, mesh size, subdomain diameter, and subdomain count.

Facts & Assumptions

Given: Positive coefficients ρi constant on each subdomain; matching quasiuniform P1 meshes; all polygon vertices primal; and the partial Schur energy.

[F1]

Coefficient-scaled averaging and BDDC: on an edge Eij, the average weights are αi=ρi/(ρi+ρj) and αj=ρj/(ρi+ρj).

[F2]

Primal interface spaces and jump convention: every open 2D interface side has two incident subdomains, and P vanishes at primal vertices.

[F3]

Discrete Schur energy and the fractional trace norm: local Schur energy is equivalent to the squared H1/2 trace seminorm modulo constants.

[F4]

Two-dimensional logarithmic edge cutoff estimates: the edge cutoff has squared H001/2 norm O(1+log⁡(H/h)), and its product with a mean-zero trace costs at most C(1+log⁡(H/h))2 times the local energy.

Proof

1.1givenF1F2F3algebra

Fix an open edge Eij and let Ui=Hiwi, Uj=Hjwj be the local discrete harmonic extensions. Write ei=wiTSiwi=ρi∥∇Ui∥L2(Ωi)2 and similarly for ej, by harmonic minimality and the definition of Si. The i-copy of Pw has nodal values αj(wi−wj) at interior edge nodes and zero at its primal endpoints, so it is Ih(θEαj(wi−wj)); the j-copy has the complementary coefficient αi. The 00,E norm controls the full boundary seminorm of an edge trace extended by zero off E: the cross-edge integrals are bounded by the endpoint weight in that norm, with constants controlled by the model's scaled Lipschitz boundary-chart bounds, polygon angles and side count. Thus the trace-Schur upper bound [F3] applies to these supported traces.

1.2givenF2F3F4algebra

Set mi=w‾i,E, mj=w‾j,E, and dE=mi−mj. At a primal endpoint v, wi(v)=wj(v), so ∣dE∣≤∣mi−wi(v)∣+∣wj(v)−mj∣. Applying the discrete Sobolev estimate [F4] to Ui and Uj, and noting that a boundary mean differs from the domain mean by at most the same L∞ deviation, gives ∣dE∣2≤C(1+log⁡(H/h))(eiρi+ejρj). The factors 1/ρi and 1/ρj appear because [F4] is unweighted while Si includes ρi.

2.1givenF1F3F4step 1.1step 1.2algebra

Write zi=wi−mi and zj=wj−mj on E, and set L=1+log⁡(H/h). The multiplier estimate [F4] bounds the squared 00,E norm of each Ih(θEzk) by CL2ek/ρk. Also [F4] bounds ∥θE∥00,E2 by CL. For the i-copy use wi−wj=zi−zj+dE and the triangle inequality in the squared norm. After multiplication by its Schur coefficient ρiαj2, the mean-zero terms are bounded by CL2(αj2ei+ρiαj2ρjej), and the constant term has the same bound by step 1.2. Since ρiαj2ρj=ρiρj(ρi+ρj)2≤14,αj2≤1, the i-side contribution is at most CL2(ei+ej). Interchanging i,j gives the same estimate for the j-side contribution, using ρjαi2/ρi≤1/4.

3.1givenF1F2step 2.1algebra∎

Sum over all interface sides. Each polygon has uniformly bounded side count, so each local energy occurs a bounded number of times. On each subdomain the complementary trace is the sum of these edge-supported traces; the squared norm of that sum is bounded by the side count times the sum of the squared norms. The resulting bound is CL2∑iei=CL2∥w∥S~2, with no coefficient-contrast or subdomain-count factor.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

Conditioning and solver work are separate claims

Remarks

The condition-number theorem concerns the ideal exact local and coarse solves and the spectrum of the preconditioned interface operators. It does not bound elapsed time, communication, memory, or total arithmetic work. For example, under a dense direct-solver model with coarse dimension nc, a coarse factorization uses O(nc3) arithmetic and O(nc2) storage, while a dense local factorization for subdomain dimensions ni uses O(∑ini3) arithmetic before parallel scheduling. Therefore a growing primal space can make the coarse solve dominate even while the condition number remains polylogarithmic. An inexact local or coarse solve requires its own spectral-equivalence and cost hypotheses.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

BDDC and FETI-DP have matching nontrivial spectra

Statement

For BDDC and FETI-DP built from the same positive definite partially assembled Schur operator, primal constraints, and scaled averaging, all eigenvalues of the two preconditioned operators other than 1 agree with multiplicity. With the multiplier space fixed as Λ=range⁡B, neither operator has a zero eigenvalue; retaining all redundant row coordinates instead would add only multiplier null modes that are removed by this convention. The multiplicity of 1 is not asserted to agree.

Facts & Assumptions

Given: A positive definite partial Schur operator, a conforming trace subspace, a primal projection, and a jump map with multiplier space range⁡B.

[F1]

Coefficient-scaled averaging and BDDC: E0R=IW^ and RE0 is the BDDC projection.

[F2]

FETI-DP dual system and preconditioner: BBDT=IΛ and BDTB+RE0=IW~.

[F3]

Complementary primal and dual projections share nonunit spectrum: if LiTi=I and T1L1+T2L2=I, the associated abstract products have matching nonunit eigenvalues with multiplicity.

Proof

1.1givenF1F2F3algebra

Take V=W~, U1=W^, U2=Λ, A=S~, L1=E0, T1=R, L2=B, and T2=BDT. By [F1] and [F2], LiTi=I and T1L1+T2L2=I. The first abstract product in [F3] is (E0S~−1E0T)(RTS~R), exactly the BDDC preconditioned operator by [F1]; the second is (BDS~BDT)(BS~−1BT), exactly the FETI-DP product by [F2].

2.1givenF1F2F3step 1.1algebra∎

Apply [F3] to conclude equal eigenvalues and multiplicities for every eigenvalue other than 1. The identities E0R=I and BBDT=I make R and BDT injective and E0 and B surjective onto their ranges; since S~ is positive definite, the four Gram operators in the two products are positive definite on their respective spaces. Thus both preconditioned products have positive eigenvalues. Taking Λ=range⁡B removes redundant multiplier null modes. No step determines the multiplicity of eigenvalue 1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The two-dimensional BDDC and FETI-DP polylogarithmic bound

Statement

Assume the scalar model of Scalar finite-element substructuring model, matching shape-regular quasiuniform P1 meshes on bounded-shape polygonal subdomains in two dimensions, all subdomain vertices primal, coefficient scaling ρi/(ρi+ρj) on each open interface edge, and nonzero assembled and multiplier spaces. Then both preconditioned interface operators satisfy

κ(MBDDC−1S^)≤C(1+log⁡(H/h))2,κ(MFETI−DP−1F)≤C(1+log⁡(H/h))2.

The constant is independent of h, H, the number of subdomains, and arbitrary positive jumps in the coefficient values ρi. 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 ∥Q∥S~ for the operator norm induced by the partially assembled Schur energy.

[F1]

Two-dimensional scaled averaging energy bound: ∥P∥S~≤C0(1+log⁡(H/h)) for P=I−RE0.

[F2]

Eigenvalue bounds from a left-inverse preconditioner: for LT=I, preconditioned eigenvalues lie between 1 and ∥TL∥A2.

[F3]

Coefficient-scaled averaging and BDDC: BDDC has TL=RE0=I−P.

[F4]

FETI-DP dual system and preconditioner: FETI-DP has TL=BDTB=P, BBDT=IΛ, and Λ=range⁡B; the latter convention makes BT injective on Λ.

[F5]

BDDC and FETI-DP have matching nontrivial spectra: the two positive preconditioned spectra agree except possibly at 1.

Proof

1.1givenF1F2F3algebra

Apply [F2] with L=E0 and T=R. The BDDC eigenvalues are at least one and at most ∥RE0∥S~2=∥I−P∥S~2. By the triangle inequality for the induced operator norm, ∥I−P∥S~≤1+∥P∥S~≤1+C0(1+log⁡(H/h)). Since 1+log⁡(H/h)≥1, squaring yields the BDDC bound with a geometry-only constant.

1.2givenF1F2F4algebra

Apply [F2] with L=B and T=BDT. This bounds the eigenvalues of FMFETI−DP−1 below by one and above by ∥BDTB∥S~2=∥P∥S~2≤C02(1+log⁡(H/h))2 by [F1] and [F4]. The Gram factors F=BS~−1BT and MFETI−DP−1=BDS~BDT are positive definite: BT is injective on Λ by [F4], BDT is injective by BBDT=IΛ, and S~ is positive definite. Thus both maps are isomorphisms, and the stated product MFETI−DP−1F has the same spectrum because F(MFETI−DP−1F)F−1=FMFETI−DP−1.

2.1F5step 1.1step 1.2∎

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.

5 · Examples, counterexamples and false statements

None yet.

Sources