A restarted version of a generalized preconditioned conjugate gradient method

DOI10.1002/cnm.1630040409zbMath0648.65024OpenAlexW2056978740MaRDI QIDQ3793612

Owe Axelsson

Publication date: 1988

Published in: Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1630040409

zbMATH Keywords

convergenceclusters of eigenvaluesorthogonalizationpreconditioned conjugate gradient methodcomputational costmatrix vector multiplicationpreconditioning matrixsubstructuring methodsORTHOMIN

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (10)

On SOR-like iteration methods for solving weakly nonlinear systems ⋮ Block preconditioning and domain decomposition methods. II ⋮ Preconditioned implicit solution of linear hyperbolic equations with adaptivity ⋮ Generalized SOR-like iteration method for solving weakly nonlinear systems ⋮ A survey of multilevel preconditioned iterative methods ⋮ Chebyshev polynomials are not always optimal ⋮ Preconditioned CG-type methods for solving the coupled system of fundamental semiconductor equations ⋮ On HSS-based iteration methods for weakly nonlinear systems ⋮ Incomplete block-matrix factorization iterative methods for convection- diffusion problems ⋮ An efficient implementation of certain iterative refinement preconditioners

Cites Work

• Accelerating the Jacobi Method for Solving Simultaneous Equations by Chebyshev Extrapolation When the Eigenvalues of the Iteration Matrix are Complex
• Unnamed Item

This page was built for publication: A restarted version of a generalized preconditioned conjugate gradient method