# FETI‐DP: a dual–primal unified FETI method—part I: A faster alternative to the two‐level FETI method

@article{Farhat2001FETIDPAD, title={FETI‐DP: a dual–primal unified FETI method—part I: A faster alternative to the two‐level FETI method}, author={Charbel Farhat and Michel Lesoinne and P. Letallec and Kendall H. Pierson and Daniel Jean Rixen}, journal={International Journal for Numerical Methods in Engineering}, year={2001}, volume={50} }

The FETI method and its two‐level extension (FETI‐2) are two numerically scalable domain decomposition methods with Lagrange multipliers for the iterative solution of second‐order solid mechanics and fourth‐order beam, plate and shell structural problems, respectively.The FETI‐2 method distinguishes itself from the basic or one‐level FETI method by a second set of Lagrange multipliers that are introduced at the subdomain cross‐points to enforce at each iteration the exact continuity of a subset…

## Figures and Tables from this paper

## 614 Citations

FETI-DP: An Efficient, Scalable and Unified Dual-Primal FETI Method

- Computer Science
- 2000

An alternative formulation of the two level coarse problem is introduced that leads to a sparse system better suited for a direct method and extensions to the alternate formulation that allow optional admissible constraints to be added to improve convergence are shown.

A hybrid approach to 3‐level FETI

- Computer Science
- 2008

A hybrid FETI/FETI–DP method is considered and some numerical results are presented, essentially representing two different levels within the algorithm.

The multipliers‐free domain decomposition methods

- Computer Science
- 2010

This article concludes the development and summarizes a new approach to dual‐primal domain decomposition methods (DDM), generally referred to as “the multipliers‐free dual‐ Primal method,” which is shown that some well‐known difficulties that occur when primal nodes are introduced are efficiently handled by the multipliers-free dual-primal method.

A FETI‐DP method for the parallel iterative solution of indefinite and complex‐valued solid and shell vibration problems

- Computer Science
- 2005

For a practically large σ range, FETI‐DPH is shown numerically to be scalable with respect to all of the problem size, substructure size, and number of substructures.

A dual‐primal FETI method for solving a class of fluid–structure interaction problems in the frequency domain

- Mathematics
- 2012

The dual‐primal finite element tearing and interconnecting method (FETI‐DP) is extended to systems of linear equations arising from a finite element discretization for a class of fluid–structure…

A multilevel FETI‐DP method and its performance for problems with billions of degrees of freedom

- Computer ScienceInternational Journal for Numerical Methods in Engineering
- 2018

A multilevel generalization of the dual‐primal finite element tearing and interconnecting (FETI‐DP) domain decomposition method is proposed for very large‐scale discrete problems to address the…

A two‐level nonoverlapping Schwarz algorithm for the Stokes problem without primal pressure unknowns

- Computer Science
- 2011

A two‐level nonoverlapping Schwarz algorithm is developed for the Stokes problem that allows to use a smaller set of primal velocity unknowns than other BDDC preconditioners without much concern on certain flux conditions on the subdomain boundaries and the inf–sup stability of the coarse problem.

A Vector Dual-Primal Finite Element Tearing and Interconnecting Method for Solving 3-D Large-Scale Electromagnetic Problems

- Computer Science
- 2006

The FETI-DPEM method is applied to the electromagnetic simulation of array-type structures where the geometrical redundancy is fully exploited to speedup the simulation and reduce the memory requirement.

A Vector Dual-Primal Finite Element Tearing and Interconnecting Method for Solving 3-D Large-Scale Electromagnetic Problems

- Computer ScienceIEEE Transactions on Antennas and Propagation
- 2006

The FETI-DPEM method is applied to the electromagnetic simulation of array-type structures where the geometrical redundancy is fully exploited to speedup the simulation and reduce the memory requirement.

Multipliers‐free dual‐primal domain decomposition methods for nonsymmetric matrices and their numerical testing

- Computer Science
- 2011

The extension of the unifying matrix formulas to nonsymmetric matrices is the subject matter of the present article and a conspicuous result is that in numerical experiments in 2D and 3D, the MF‐DP algorithms for nonsymmetrical matrices exhibit an efficiency of the same order as state‐of‐the‐art algorithms for symmetric matrics.

## References

SHOWING 1-10 OF 43 REFERENCES

The two-level FETI method for static and dynamic plate problems Part I: An optimal iterative solver for biharmonic systems

- Computer Science
- 1998

A scalable Lagrange multiplier based domain decomposition method for time‐dependent problems

- Computer Science
- 1995

It is proved that in the limit for large time steps, the new method converges toward the FETI algorithm for time-independent problems, and it is shown that this new domain decomposition method outperforms the popular direct skyline solver.

DOMAIN DECOMPOSITION METHODS FOR PARALLEL SOLUTION OF SHAPE SENSITIVITY ANALYSIS PROBLEMS

- Computer Science
- 1999

A two-level iterative method is proposed particularly tailored to solve re-analysis type of problems, where the dual domain decomposition method is incorporated in the preconditioning step of a subdomain global PCG implementation.

Scalable Substructuring by Lagrange Multipliers in Theory and Practice

- Computer Science
- 1998

A formulation of the FETI substructuring method as a matrix preconditioning algorithm is presented and it is proved mathematically that solving this coarse problem accomplishes a global exchange of information between the subdomains and results in a method which, for elasticity problems, has a condition number that grows only polylogarithmically.

Analysis Of Lagrange Multiplier Based Domain Decomposition

- Computer Science
- 1998

The convergence of a substructuring iterative method with Lagrange multipliers known as Finite Element Tearing and Interconnecting (FETI) method is analyzed in this thesis, showing optimal properties hold for numerous plate bending elements that are used in practice including the HCT, DKT, and a class of non-locking elements for the Reissner-Mindlin plate models.

A Scalable Substructuring Method By Lagrange Multipliers For Plate Bending Problems

- Computer Science
- 1996

A new Lagrange multiplier-based domain decomposition method for solving iteratively systems of equations arising from the finite element discretization of plate bending problems to enforce continuity of the transversal displacement field at the subdomain crosspoints throughout the preconditioned conjugate gradient iterations.

A two-level domain decomposition method for the iterative solution of high frequency exterior Helmholtz problems

- MathematicsNumerische Mathematik
- 2000

Summary. We present a Lagrange multiplier based two-level domain decomposition method for solving iteratively large-scale systems of equations arising from the finite element discretization of…

A scalable dual-primal domain decomposition method

- Mathematics, Computer Science
- 2000

We blend dual and primal domain decomposition approaches to construct a fast iterative method for the solution of large-scale systems of equations arising from the finite element discretization of…