Breakdowns in the implementation of the Lánczos method for solving linear systems
From MaRDI portal
Publication:678424
DOI10.1016/S0898-1221(96)00217-9zbMath0871.65025OpenAlexW1964473888MaRDI QIDQ678424
Michela Redivo-Zaglia, Claude Brezinski, Hassane Sadok
Publication date: 26 August 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(96)00217-9
Related Items (6)
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 ⋮ Look-ahead in Bi-CGSTAB and other product methods for linear systems ⋮ The methods of Vorobyev and Lanczos ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ A review of formal orthogonality in Lanczos-based methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some vector sequence transformations with applications to systems of equations
- Lanczos maximal algorithm for unsymmetric eigenvalue problems
- Padé-type approximation and general orthogonal polynomials
- A breakdown-free Lanczos type algorithm for solving linear systems
- Augmentability in optimization theory
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Avoiding breakdown in the CGS algorithm
- A new presentation of orthogonal polynomials with applications to their computation
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Hybrid procedures for solving linear systems
- An analysis of the composite step biconjugate gradient method
- 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
- Lanczos-type algorithms for solving systems of linear equations
- Polynômes orthogonaux formels - applications
- New implementations of Lanczos method
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Modified Lanczos method for solving large sparse linear systems
- Some Perspectives on the Eigenvalue Problem
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Algebraic Computations of Scaled Padé Fractions
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- 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
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- Residual Smoothing Techniques for Iterative Methods
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- On Some Recent Developments in the Theory and Application of Continued Fractions
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Breakdowns in the implementation of the Lánczos method for solving linear systems
