Robust and efficient FETI domain decomposition algorithms for edge element approximations
From MaRDI portal
Publication:5708656
DOI10.1108/03321640510586033zbMath1135.78338OpenAlexW2089560119MaRDI QIDQ5708656
Andrea Toselli, Xavier Vasseur
Publication date: 21 November 2005
Published in: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03321640510586033
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10)
Related Items
Balancing Domain Decomposition by Constraints Algorithms for Curl-Conforming Spaces of Arbitrary Order, A BDDC algorithm with deluxe scaling for $H(curl)$ in two dimensions with irregular subdomains
Uses Software
Cites Work
- Mixed finite elements in \(\mathbb{R}^3\)
- FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method
- hp FEM for Reaction-Diffusion Equations I: Robust Exponential Convergence
- Domain decomposition preconditioners of Neumann-Neumann type for hp-approximations on boundary layer meshes in three dimensions
- Balancing domain decomposition for problems with large jumps in coefficients
- Dual-Primal FETI Algorithms for Edge Element Approximations: Two-Dimensional H And P Finite Elements on Shape-Regular Meshes
