A breakdown-free Lanczos type algorithm for solving linear systems
From MaRDI portal
Publication:811626
DOI10.1007/BF01385846zbMath0739.65027MaRDI QIDQ811626
Claude Brezinski, Hassane Sadok, Michela Redivo-Zaglia
Publication date: 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133667
orthogonal polynomialsLanczos methodmethod of momentsblock bordering methodrecurrence formulaebiconjugate gradient
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items (31)
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization ⋮ Matrix recursive projection and interpolation algorithms ⋮ The block Lanczos method for linear systems with multiple right-hand sides ⋮ 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 ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ 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 ⋮ A Lanczos-type procedure for tensors ⋮ On quasi-minimal residual approach of iterative algorithms for solving nonsymmetric linear systems ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A breakdown of the block CG method ⋮ A new iterative method for solving complex symmetric linear systems ⋮ An extended nonsymmetric block Lanczos method for model reduction in large scale dynamical systems ⋮ Breakdowns in the implementation of the Lánczos method for solving linear systems ⋮ The Lanczos algorithm and complex Gauss quadrature ⋮ Lanczos-type algorithms for solving systems of linear equations ⋮ Least-squares orthogonal polynomials ⋮ On quasi-orthogonal polynomials of orderr ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems ⋮ Vector sequence transformations: Methodology and applications to linear systems ⋮ 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
- Orthogonal polynomials: Variable-signed weight functions
- A breakdown-free Lanczos type algorithm for solving linear systems
- Other manifestations of the Schur complement
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Moment methods in Padé approximation
- Avoiding breakdown in the CGS algorithm
- A new presentation of orthogonal polynomials with applications to their computation
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Treatment of near-breakdown in the CGS algorithm
- Polynômes orthogonaux formels - applications
- The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A breakdown-free Lanczos type algorithm for solving linear systems
