Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions

DOI10.1137/S089547989833245XzbMath0995.65033MaRDI QIDQ4943658

Teri L. Barth, Thomas A. Manteuffel

Publication date: 19 March 2000

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

conjugate gradient methodsystem of linear equationsnonnormal matricesshort recurrence

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (8)

SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix ⋮ A unitary similarity transform of a normal matrix to complex symmetric form ⋮ A condensed representation of almost normal matrices ⋮ On generating Sobolev orthogonal polynomials ⋮ A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices ⋮ On an Economic Arnoldi Method for $BML$-Matrices ⋮ A numerical approach for the Poisson equation in a planar domain with a small inclusion ⋮ Revisiting \((k,\ell)\)-step methods

This page was built for publication: Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions