A domain decomposition algorithm for elliptic problems in three dimensions
DOI10.1007/BF01385722zbMATH Open0724.65110OpenAlexW2107119443MaRDI QIDQ758166FDOQ758166
Publication date: 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133592
Recommendations
- scientific article
- The decomposition method for solving elliptic problems in a three-dimensional domain
- Publication:3485833
- Domain decomposition methods for large linearly elliptic three-dimensional problems
- scientific article; zbMATH DE number 218279
- Dimension splitting algorithm for a three-dimensional elliptic equation
- An efficient domain decomposition method for three-dimensional parabolic problems
- Fast domain decomposition algorithm discretizations of 3-d elliptic equations by spectral elements
- scientific article
condition numberfinite elementsthree dimensionspreconditioned conjugate gradientdomain decomposition algorithmsiterative substructuring algorithm
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Title not available (Why is that?)
- Iterative solvers by substructuring for the \(p\)-version finite element method
- Title not available (Why is that?)
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- Two-level domain decomposition preconditioning for thep-version finite element method in three dimensions
- A second order finite difference analog of the first biharmonic boundary value problem
Cited In (24)
- Dimension splitting algorithm for a three-dimensional elliptic equation
- Parallel adaptive subspace correction schemes with applications to elasticity
- A Domain Decomposition Algorithm Using a Hierarchical Basis
- Title not available (Why is that?)
- A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems
- Balancing domain decomposition for problems with large jumps in coefficients
- BDDC and FETI-DP for the virtual element method
- Massively parallel methods for semiconductor device modelling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms
- Preconditioners for domain decomposition methods
- Substructuring preconditioners for saddle-point problems arising from Maxwell’s equations in three dimensions
- An iterative solver for \(p\)-version finite elements in three dimensions
- Iterative methods for \(p\)-version finite elements: Preconditioning thin solids
- Title not available (Why is that?)
- Iterative substructuring methods for spectral elements: Problems in three dimensions based on numerical quadrature
- Domain decomposition solvers for nonlinear multiharmonic finite element equations
- Title not available (Why is that?)
- FETI-DP for the Three Dimensional Virtual Element Method
- Spectral discretizations of 3-D elliptic problems and fast domain decomposition methods
- Domain decomposition methods for large linearly elliptic three-dimensional problems
- Fast domain decomposition algorithm discretizations of 3-d elliptic equations by spectral elements
- UNIFORM CONVERGENT MULTIGRID METHODS FOR ELLIPTIC PROBLEMS WITH STRONGLY DISCONTINUOUS COEFFICIENTS
This page was built for publication: A domain decomposition algorithm for elliptic problems in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758166)
