A general finite element preconditioning for the conjugate gradient method
From MaRDI portal
Publication:582001
DOI10.1007/BF01932748zbMath0689.65015MaRDI QIDQ582001
Publication date: 1989
Published in: BIT (Search for Journal in Brave)
convergence; numerical experiments; preconditioning; finite element; conjugate gradient method; Neumann problem; incomplete Cholesky decomposition; reverse Cuthill-McKee algorithm
65F50: Computational methods for sparse matrices
35J25: Boundary value problems for second-order elliptic equations
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings, Conjugate gradient type methods and preconditioning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rate of convergence of the preconditioned conjugate gradient method
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- A preconditioning technique based on element matrix factorizations
- The rate of convergence of conjugate gradients
- A practical termination criterion for the conjugate gradient method
- Preconditioned conjugate gradients for solving singular systems
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- On recurring theorems on diagonal dominance
- Block Preconditioning for the Conjugate Gradient Method
- Element Preconditioning Using Splitting Techniques
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Methods of conjugate gradients for solving linear systems
