New look-ahead Lanczos-type algorithms for linear systems
From MaRDI portal
Publication:1805873
DOI10.1007/s002110050439zbMath0932.65040OpenAlexW2082742949MaRDI QIDQ1805873
Hassane Sadok, Claude Brezinski, Michela Redivo-Zaglia
Publication date: 15 March 2000
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050439
algorithmsnumerical examplesrecurrence relationscomparisonsbreakdownlook-ahead Lanczos-type algorithmsnumerical stability of algorithms
Related Items (13)
Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ Internality of generalized averaged Gauss quadrature rules and truncated variants for modified Chebyshev measures of the third and fourth kinds ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ The structure of iterative methods for symmetric linear discrete ill-posed problems ⋮ A new iterative method for solving complex symmetric linear systems ⋮ Comparison of Krylov subspace methods on the PageRank problem ⋮ Comparison of quasi minimal residual and bi‐conjugate gradient iterative methods to solve complex symmetric systems arising from time‐harmonic magnetic simulations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
This page was built for publication: New look-ahead Lanczos-type algorithms for linear systems
