The block Lanczos method for linear systems with multiple right-hand sides
type: Item
instance of: scholarly article
title: The block Lanczos method for linear systems with multiple right-hand sides
zbMATH Open document ID: 1059.65026
author: A. El Guennouni
author: Khalide Jbilou
author: Hassane Sadok
published in: Applied Numerical Mathematics
publication date: 2004-11-18T00:00:00Z
review text: The block Lanczos method for solving linear systems with multiple right-hand sides is considered. The authors consider the simultaneous solution as more efficient than the application to each linear systen. In the last years, block solvers such as Bl-BCG, Bl-GMRES, Bl-QMR and Bl-BiCGSTAB have been constructed. Here matrix-valued orthogonal polynomials are used to derive block Lanczos-type methods such as block Orthodir and block BIODIR. The matrix polynomials are obtained from Schur complements of matrices that are almost Hankel matrices.
reviewed by: D. Braess
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 2116193
zbMATH Keywords: block Lanczos method
zbMATH Keywords: matrix-valued orthogonal polynomials
zbMATH Keywords: Orthodir
zbMATH Keywords: BIODIR
zbMATH Keywords: Hankel matrices
zbMATH Keywords: matrix polynomials
zbMATH Keywords: multiple right-hand sides
zbMATH Keywords: block Krylov subspace method
zbMATH Keywords: Schur complement
describes a project that uses: ABLE
MaRDI profile type: Publication
full work available at URL: j.apnum.2004.04.001
OpenAlex ID: W2012583010
cites work: ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
cites work: Padé-type approximation and general orthogonal polynomials
cites work: Lanczos-type algorithms for solving systems of linear equations
cites work: The block Lanczos and Vorobyev methods
cites work: A breakdown-free Lanczos type algorithm for solving linear systems
cites work: Comparisons Between Vector and Matrix Padé Approximants
cites work: Linear algebra, rational approximation and orthogonal polynomials
cites work: Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
cites work: Orthogonal matrix polynomials and higher-order recurrence relations
cites work: A block version of BiCGSTAB for linear systems with multiple right-hand sides
cites work: A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
cites work: Computation of matrix-valued formally orthogonal polynomials and applications
cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
cites work: Q4194451
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
cites work: Matrix recursive interpolation algorithm for block linear systems: Direct methods
cites work: Global FOM and GMRES algorithms for matrix equations
cites work: Generalized block Lanczos methods for large unsymmetric eigenproblems
cites work: The block conjugate gradient algorithm and related methods
cites work: On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
cites work: Convergence properties of block GMRES and matrix polynomials
cites work: An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
cites work: Orthogonal matrix polynomials and applications
cites work: An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
DOI: 10.1016/J.APNUM.2004.04.001
description: scientific article; zbMATH DE number 2116193