On computing INV block preconditionings for the conjugate gradient method
From MaRDI portal
Publication:1088378
DOI10.1007/BF01935055zbMath0612.65019OpenAlexW1594585037MaRDI QIDQ1088378
Paul Concus, Gérard A. Meurant
Publication date: 1986
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01935055
conjugate gradient methoditerative methodsincomplete factorizationill-conditionedGreen's matrixpreconditionings
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Practical use of the conjugate gradient method on parallel supercomputers, Approximate inverses of multidiagonal matrices and application to the block PCG method, A full parallel preconditioner for a class of M-matrices, Stability and spectral properties of incomplete factorization, Block ILU preconditioners for block-tridiagonal systems, On computing of block ILU preconditioner for block tridiagonal systems, Domain decomposition preconditioners for the conjugate gradient method, On the decay of the inverse of matrices that are sum of Kronecker products, Stability and spectral properties of some incomplete block factorizations, Block incomplete factorization preconditioners for a symmetric block-tridiagonal \(M\)-matrix
Cites Work
- Unnamed Item
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Inverses of banded matrices
- Block Preconditioning for the Conjugate Gradient Method
- Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$.
- Finite Boundary Value Problems Solved by Green's Matrix.