A parallel preconditioned conjugate gradient method using domain decomposition and inexact solvers on each subdomain
DOI10.1007/BF02250634zbMath0718.65019OpenAlexW345088445MaRDI QIDQ2639591
Publication date: 1990
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02250634
domain decompositionfinite elementspectral condition numbermultiprocessor system with message passing architecturepreconditioned conjugate gradient solution strategy
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) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (9)
Cites Work
- A finite element - capacitance method for elliptic problems on regions partitioned into subregions
- The Neumann-Dirichlet domain decomposition method with inexact solvers on the subdomains
- Complexity of Parallel Implementation of Domain Decomposition Techniques for Elliptic Partial Differential Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- A generalized SSOR method
This page was built for publication: A parallel preconditioned conjugate gradient method using domain decomposition and inexact solvers on each subdomain