Comparison of splittings used with the conjugate gradient algorithm

DOI10.1007/BF01399553MaRDI QIDQ1252700zbMATH OpenOpenAlexFDO

Authors Anne Greenbaum

Publication date 1979

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/132636

zbMATH Keywords

Bounds for the ErrorComparison TestConjugate Gradient AlgorithmSplittings

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites work

• scientific article; zbMATH DE number 3537182 (Why is no real title available?)
• scientific article; zbMATH DE number 3551784 (Why is no real title available?)
• scientific article; zbMATH DE number 3429996 (Why is no real title available?)
• scientific article; zbMATH DE number 3366440 (Why is no real title available?)
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• 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

Cited in

(21)

• Spectral optimization of explicit iterative methods. I
• Regular incomplete factorizations of real positive definite matrices
• Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
• Milestones in the development of iterative solution methods
• Error Bounds for Lanczos-Based Matrix Function Approximation
• Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Convergence and instability in PCG methods for bordered systems
• On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
• The block conjugate gradient algorithm and related methods
• On the real convergence rate of the conjugate gradient method
• A short survey on preconditioners and Korovkin-type theorems
• Construction and efficient implementation of implicit preconditioning methods. I
• Convergence analysis of Krylov subspace methods
• Reaching the superlinear convergence phase of the CG method
• On investigating GMRES convergence using unitary matrices
• On Meinardus' examples for the conjugate gradient method
• Block splittings for the conjugate gradient method
• Towards understanding CG and GMRES through examples
• On the cost of iterative computations
• Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems

This page was built for publication: Comparison of splittings used with the conjugate gradient algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252700)