Skip to content

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
v1 · 2026-08-30 · History
Domain-specific #
1830
Origin domain
numerical analysis
Subdomain
iterative substructuring methods
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.

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

Local relationship map for FETI-DPParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.FETI-DPDOMAINPrime abstraction: Decomposition — is a kind ofDecompositionPRIME

Current abstraction FETI-DP Domain-specific

Parents (1) — more general patterns this builds on

  • 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

Neighborhood in Abstraction Space

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

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08