Breakdowns in the implementation of the Lánczos method for solving linear systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1163761
- A breakdown-free Lanczos type algorithm for solving linear systems
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
- A new implementation of the Lanczos method in linear problems
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- Methods for overcoming breakdown problems in the Unsymmetric Lanczos Reduction method
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- scientific article; zbMATH DE number 437442
Cites work
- scientific article; zbMATH DE number 3120437 (Why is no real title available?)
- scientific article; zbMATH DE number 3900044 (Why is no real title available?)
- scientific article; zbMATH DE number 17943 (Why is no real title available?)
- scientific article; zbMATH DE number 51614 (Why is no real title available?)
- scientific article; zbMATH DE number 52854 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 592768 (Why is no real title available?)
- scientific article; zbMATH DE number 671989 (Why is no real title available?)
- scientific article; zbMATH DE number 834454 (Why is no real title available?)
- 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
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- A breakdown-free Lanczos type algorithm for solving linear systems
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A new presentation of orthogonal polynomials with applications to their computation
- Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Algebraic Computations of Scaled Padé Fractions
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An analysis of the composite step biconjugate gradient method
- Augmentability in optimization theory
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Avoiding breakdown in the CGS algorithm
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Hybrid procedures for solving linear systems
- Lanczos maximal algorithm for unsymmetric eigenvalue problems
- Lanczos-type algorithms for solving systems of linear equations
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- Methods of conjugate gradients for solving linear systems
- Modified Lanczos method for solving large sparse linear systems
- New implementations of Lanczos method
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Numerical methods for large eigenvalue problems
- On Some Recent Developments in the Theory and Application of Continued Fractions
- Padé-type approximation and general orthogonal polynomials
- Parallel iterative methods for sparse linear systems
- Polynômes orthogonaux formels - applications
- Residual Smoothing Techniques for Iterative Methods
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- Some Perspectives on the Eigenvalue Problem
- Some vector sequence transformations with applications to systems of equations
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Treatment of near-breakdown in the CGS algorithm
Cited in
(8)- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- Treatment of near-breakdown in the CGS algorithm
- A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- A review of formal orthogonality in Lanczos-based methods
- A breakdown-free Lanczos type algorithm for solving linear systems
- The methods of Vorobyev and Lanczos
- The matrix and polynomial approaches to Lanczos-type algorithms
This page was built for publication: Breakdowns in the implementation of the Lánczos method for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678424)
