A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation

DOI10.1016/S0377-0427(98)00195-2zbMath0954.65024OpenAlexW2039672193MaRDI QIDQ1300798

C. Musschoot

Publication date: 25 January 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-0427(98)00195-2

zbMATH Keywords

convergenceorthogonal polynomialsLanczos methodHankel matrixKrylov subspacesmultiple right-hand sidesnonsymmetric linear systemsBiCGSTABbi-conjugate gradients methodOrthodirOrthomin

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Uses Software

• CGS
• testmatrix

Cites Work

• Unnamed Item
• Unnamed Item
• An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
• Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
• Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
• A new presentation of orthogonal polynomials with applications to their computation
• Polynômes orthogonaux formels - applications
• The stable computation of formal orthogonal polynomials
• A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
• Matrix polynomial and epsilon-type extrapolation methods with applications
• 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 Stabilized QMR Version of Block BiCG
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides

This page was built for publication: A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation