On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases

DOI10.1137/060662149zbMath1148.65023OpenAlexW2067465827MaRDI QIDQ3522877

Zdeněk Strakoš, Jörg Liesen

Publication date: 4 September 2008

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de//handle/11303/7287

zbMATH Keywords

orthogonal basesKrylov subspace methodsconjugate gradient-like methodsshort recurrences

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Related Items (11)

Fitting large-scale structured additive regression models using Krylov subspace methods ⋮ Reliability Investigation of BiCGStab and IDR Solvers for the Advection-Diffusion-Reaction Equation ⋮ Complex wedge-shaped matrices: a generalization of Jacobi matrices ⋮ On investigating GMRES convergence using unitary matrices ⋮ On the Smith normal form of walk matrices ⋮ A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues ⋮ Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices ⋮ On orthogonal reduction to Hessenberg form with small bandwidth ⋮ An improved condition for a graph to be determined by its generalized spectrum ⋮ Revisiting \((k,\ell)\)-step methods ⋮ Conjugate gradients for symmetric positive semidefinite least-squares problems

This page was built for publication: On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases