Avoiding breakdown and near-breakdown in Lanczos type algorithms
From MaRDI portal
Publication:1187056
DOI10.1007/BF02142326zbMath0748.65033MaRDI QIDQ1187056
Claude Brezinski, Hassane Sadok, Michela Redivo-Zaglia
Publication date: 28 June 1992
Published in: Numerical Algorithms (Search for Journal in Brave)
orthogonal polynomialsLanczos methodprojectionmethods of momentsbiconjugate gradientmethod of recursive zoom
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization, A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems, A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems, Treatment of near-breakdown in the CGS algorithm, Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems, A new taxonomy of conjugate gradient methods, The methods of Vorobyev and Lanczos, Avoiding breakdown in variants of the BI-CGSTAB algorithm, An engineering approach to generalized conjugate gradient methods and beyond, A theoretical overview of Krylov subspace methods, Extrapolation algorithms and Padé approximations: A historical survey, An adaptive block Lanczos algorithm, A linear system solver based on a modified Krylov subspace method for breakdown recovery, A Lanczos-type procedure for tensors, Unnamed Item, A breakdown of the block CG method, Avoiding breakdown in the CGS algorithm, Breakdowns in the implementation of the Lánczos method for solving linear systems, Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms, A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms, A new implementation of the CMRH method for solving dense linear systems, Lanczos-type algorithms for solving systems of linear equations, On quasi-orthogonal polynomials of orderr, na1, Unnamed Item, Unnamed Item, On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems, Generalized block anti-Gauss quadrature rules, Unnamed Item, Iterative solution of linear systems in the 20th century, The matrix and polynomial approaches to Lanczos-type algorithms, A review of formal orthogonality in Lanczos-based methods, A breakdown-free Lanczos type algorithm for solving linear systems
Uses Software
Cites Work
- Padé-type approximation and general orthogonal polynomials
- Avoiding breakdown in the CGS algorithm
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Lanczos-type algorithms for solving systems of linear equations
- Polynômes orthogonaux formels - applications
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
