Comparison of splittings used with the conjugate gradient algorithm
From MaRDI portal
Publication:1252700
DOI10.1007/BF01399553zbMath0394.65011OpenAlexW2047151498MaRDI QIDQ1252700
Publication date: 1979
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132636
Related Items
Spectral optimization of explicit iterative methods. I, An Incomplete Factorization Technique for Positive Definite Linear Systems, Convergence and instability in PCG methods for bordered systems, Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences, Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems, Block splittings for the conjugate gradient method, The block conjugate gradient algorithm and related methods, On investigating GMRES convergence using unitary matrices, Regular incomplete factorizations of real positive definite matrices, On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic, Milestones in the development of iterative solution methods, On Meinardus' examples for the conjugate gradient method, Convergence analysis of Krylov subspace methods, Reaching the superlinear convergence phase of the CG method, A short survey on preconditioners and Korovkin-type theorems, On the cost of iterative computations, Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices, Error Bounds for Lanczos-Based Matrix Function Approximation, On the real convergence rate of the conjugate gradient method, Construction and efficient implementation of implicit preconditioning methods. I
Cites Work
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Estimates for Some Computational Techniques in Linear Algebra
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
