Domain decomposition preconditioners for the conjugate gradient method
From MaRDI portal
Publication:1122935
DOI10.1007/BF02575749zbMath0676.65019MaRDI QIDQ1122935
Publication date: 1988
Published in: Calcolo (Search for Journal in Brave)
domain decompositionparallel computationconjugate gradient methodpreconditionerscomplexity analysisincomplete factorizations
Boundary value problems for second-order elliptic equations (35J25) 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 (2)
Comparison theorems for splittings of M-matrices in (block) Hessenberg form ⋮ The eigenvalue spectrum of domain decomposed preconditioners
Cites Work
- Unnamed Item
- Unnamed Item
- Multitasking the conjugate gradient method on the CRAY X-MP/48
- The block preconditioned conjugate gradient method on vector computers
- On computing INV block preconditionings for the conjugate gradient method
- Block Preconditioning for the Conjugate Gradient Method
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Approximate Schur Complement Preconditioners on Serial and Parallel Computers
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
This page was built for publication: Domain decomposition preconditioners for the conjugate gradient method