A review of formal orthogonality in Lanczos-based methods

DOI10.1016/S0377-0427(01)00412-5zbMath0996.65031MaRDI QIDQ1602767

Hassane Sadok, Claude Brezinski, Michela Redivo-Zaglia

Publication date: 24 June 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

orthogonal polynomials; Lanczos method; preconditioning; iterative methods; Krylov subspace methods

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

Abstract perturbed Krylov methods

Uses Software

• CGS
• na5
• na1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breakdowns in the implementation of the Lánczos method for solving linear systems
• Padé-type approximation and general orthogonal polynomials
• Generating conjugate directions for arbitrary matrices by matrix equations. I
• A breakdown-free Lanczos type algorithm for solving linear systems
• Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
• The block conjugate gradient algorithm and related methods
• 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
• Avoiding breakdown and near-breakdown in Lanczos type algorithms
• Addendum to ``Avoiding breakdown and near-breakdown in Lanczos type algorithms
• 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
• A ``look-around Lanczos algorithm for solving a system of linear equations
• The matrix and polynomial approaches to Lanczos-type algorithms
• Lanczos-type algorithms for solving systems of linear equations
• New look-ahead Lanczos-type algorithms for linear systems
• Krylov subspace methods, biorthogonal polynomials and Padé-type approximants
• Avoiding breakdown in Van der Vorst's method
• Polynômes orthogonaux formels - applications
• The block Lanczos method for linear systems with multiple right-hand sides
• New implementations of Lanczos method
• Look-ahead in Bi-CGSTAB and other product methods for linear systems
• Formal orthogonal polynomials revisited. Applications
• An adaptive block Lanczos algorithm
• A linear system solver based on a modified Krylov subspace method for breakdown recovery
• Duality in conjugate gradient methods
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear 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 Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• A breakdown of the block CG method
• The block Lanczos and Vorobyev methods
• Avoiding look-ahead in the Lanczos method and Padé approximation
• A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• Methods of conjugate gradients for solving linear systems
• Block projection methods for linear systems
• Vector-orthogonality and Lanczos-type methods