A domain decomposition algorithm for elliptic problems in three dimensions
DOI10.1007/BF01385722zbMath0724.65110OpenAlexW2107119443MaRDI QIDQ758166
Publication date: 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133592
finite elementscondition numberthree dimensionsiterative substructuring algorithmpreconditioned conjugate gradientdomain decomposition algorithms
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10)
Related Items (15)
Cites Work
- Iterative solvers by substructuring for the \(p\)-version finite element method
- A second order finite difference analog of the first biharmonic boundary value problem
- Two-level domain decomposition preconditioning for thep-version finite element method in three dimensions
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Unnamed Item
- Unnamed Item
This page was built for publication: A domain decomposition algorithm for elliptic problems in three dimensions