FETI-DP

A dual–primal nonoverlapping domain-decomposition solver that assembles selected interface degrees of freedom globally while enforcing continuity of the remaining duplicated interface variables with Lagrange multipliers.

Version

v2 · 2026-09-19 · History

Domain-specific #

1830

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Numerical Analysis, Iterative Substructuring Methods → Mathematics

Aliases

Finite Element Tearing and Interconnecting Dual Primal, Dual Primal Feti

Core Idea

FETI-DP—Finite Element Tearing and Interconnecting, Dual–Primal—is a nonoverlapping domain-decomposition method for solving large linear systems produced by finite-element and related discretizations. It divides a mesh into subdomains, solves most subdomain work locally, and coordinates those solutions through a smaller interface problem. Its defining choice is to treat selected interface degrees of freedom as primal, assembled and continuous from the outset, while treating the remaining interface degrees of freedom as dual, duplicated by subdomain and made continuous with Lagrange multipliers.

How would you explain it like I'm…

Team Puzzle Gluing

Imagine a giant puzzle that is too big for one person, so friends each take a piece of it. A few special edge spots are glued together right away so everyone shares them. For the other edge spots, each friend keeps their own copy, and they pass notes until the copies match.

Split, Solve, and Match

FETI-DP is a way computers solve really huge math problems, like how a bridge bends under weight. The problem is split into many chunks, and each chunk is solved mostly on its own, often at the same time. Where chunks touch, a few important points are shared from the start and are always the same for everyone. The rest of the touching points are copied in each chunk, and extra 'agreement' numbers push those copies to match. A small team-wide problem then coordinates all the chunks so the whole answer fits together.

Dual-Primal Subdomain Solver

FETI-DP is a domain-decomposition method for the huge systems of equations that come from finite-element models. The mesh is cut into non-overlapping subdomains, and the unknowns inside each subdomain are handled locally. Unknowns on the shared interfaces are split into two kinds: primal ones, which are shared and continuous from the start, and dual ones, which are duplicated in each subdomain and forced to agree using Lagrange multipliers. The primal unknowns make a small global problem that passes information across the whole mesh, while the dual interface problem is solved iteratively with a preconditioner. Compared with purely dual FETI, where every interface match uses multipliers, the primal choice keeps each subdomain's local problem from being unsolvable on its own.

 

FETI-DP (Finite Element Tearing and Interconnecting, Dual–Primal) is a nonoverlapping domain-decomposition solver for linear systems arising from discretized boundary-value problems. The mesh is partitioned into subdomains, and interior unknowns are condensed out, leaving Schur-complement-type interface problems. The key move is splitting the interface degrees of freedom: primal ones, such as selected corner values, are assembled globally and continuous from the outset, while dual ones are duplicated per subdomain and glued with Lagrange multipliers. The primal variables induce a coarse global problem that transmits information across all subdomains and removes the local singularities, or nullspaces, that purely dual FETI must handle explicitly. The resulting dual interface system for the multipliers is solved with a preconditioned iterative method such as conjugate gradients, with each iteration requiring parallel local subdomain solves. Afterward, the full global solution is recovered from the multipliers and primal values. Its quality is analyzed through condition-number bounds, and the framework supports a family of variants and coarse-space enrichments.

Scope of Application

FETI-DP originated in structural mechanics and applies broadly to large discretized elliptic and elasticity problems. The literature extends it to plates and shells, heterogeneous and nearly incompressible materials, electromagnetic problems, virtual elements, Stokes-type systems, and nonlinear or multilevel formulations when the corresponding operator and interface treatment support the method.

The method is particularly attractive on distributed-memory machines because subdomain factorizations and backsolves are local and parallel. Communication concentrates at interfaces and in the coarse problem. That architecture has enabled very large simulations, while later multilevel work addresses the point at which a single global coarse solve itself becomes a scaling bottleneck.

Clarity

“Primal” and “dual” identify how interface continuity is represented, not two different physical solutions. Primal degrees of freedom are single-valued through assembly. Dual degrees remain duplicated until Lagrange multipliers drive their jumps to zero. Both contribute to one reconstructed solution.

Corners are the classical minimal example of primal variables, not a universal invariant. Three-dimensional scalability often requires edge or face averages, and heterogeneous problems may require adaptive spectral constraints.

Manages Complexity

The method compresses one enormous coupled solve into many reusable local solves plus an interface coordination problem. Interior variables disappear from global iteration through condensation. The primal set carries indispensable global modes, while multipliers reconcile the many remaining local interface copies. This preserves parallel locality without accepting discontinuous subdomain solutions.

Abstract Reasoning

1. If a subdomain interface variable is primal, neighboring subdomains share one assembled value and need no multiplier for its continuity.
2. If it is dual, independent local copies require a jump constraint enforced by a multiplier.
3. If the chosen primal set fails to remove relevant local null modes, local solves or the reduced operator can be singular or ill-conditioned.
4. If only local solves are accelerated while the coarse solve dominates, adding processors will not restore parallel scalability.

Knowledge Transfer

Exact transfer occurs across PDEs, discretizations, and machines where nonoverlapping substructures, interface variables, primal constraints, dual continuity, local solves, and a coarse problem remain literal. Virtual-element and electromagnetic variants can therefore instantiate the family even though their local operators differ.

The portable residue is Decomposition + Parallelism + Interface + Constraint + Coordination. Those primes explain why the method is intelligible outside numerical analysis, but an organizational system with local teams and global coordinators is only an analogy. Without Schur-complement interface algebra and primal/dual continuity treatment, it is not FETI-DP.

Relationships to Other Abstractions

Current abstraction FETI-DP Domain-specific

Parents (1) — outgoing typed relations

• FETI-DP is a kind of Decomposition Prime

  the global operator is split into nonoverlapping local subproblems and recombined.

Hierarchy path (1) — routes to 1 parentless root

• FETI-DP → is a kind of Decomposition

Neighborhood in Abstraction Space

FETI-DP sits in a sparse region of the domain-specific corpus (94^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Spectral Element Method — 0.80
• Frontal Solver — 0.80
• Fictitious domain method — 0.78
• Balancing domain decomposition method — 0.77
• Exponential Integrator — 0.77

Computed from structural-signature embeddings · 2026-10-25