Conjugate gradient type methods and preconditioning
From MaRDI portal
Publication:1112555
DOI10.1016/0377-0427(88)90344-5zbMath0659.65033OpenAlexW2171132194MaRDI QIDQ1112555
Kees Dekker, Henk A. van der Vorst
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90344-5
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Performance of certain Krylov subspace methods for solving convection-diffusion equations, Iterative solvers for BEM algebraic systems of equations, Iterative simulation of 3D heat diffusion in a medium with multiple cracks, Conjugate gradient methods for continuation problems, Accelerating the solution of linear systems appearing in two-phase reservoir simulation by the use of POD-based deflation methods, Dirichlet degrees of freedom need not be eliminated, Lower eigenvalue bounds for singular pencils of matrices, An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method, Iterative techniques for 3-D boundary element method systems of equations, Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization, Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids, Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general finite element preconditioning for the conjugate gradient method
- On the eigenvalue distribution of a class of preconditioning methods
- On the rate of convergence of the preconditioned conjugate gradient method
- The rate of convergence of conjugate gradients
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- The convergence behavior of Ritz values in the presence of close eigenvalues
- Preconditioned conjugate gradients for solving singular systems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- On local relaxation methods and their application to convection-diffusion equations
- The Tchebychev iteration for nonsymmetric linear systems
- Condition numbers and equilibration of matrices
- Block Preconditioning for the Conjugate Gradient Method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
- A class of first order factorization methods
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- On Best Conditioned Matrices
