Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
type: Item
instance of: scholarly article
title: Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
zbMATH Open document ID: 0907.65031
DOI: 10.1023/A:1012085428800
author: Claude Brezinski
author: Michela Redivo-Zaglia
published in: Numerical Algorithms
publication date: 1999-03-04T00:00:00Z
review text: The Lanczos method for solving systems of linear equations is implemented by using recurrence relationships between formal orthogonal polynomials. A new procedure for computing the coefficients of the recurrence relationships is proposed which avoids the use of the transpose of the matrix of the system. The procedure is based on the recursive computation of the products of polynomials appearing in their expressions. This approach allows to implement simultaneously and at a low price a Lanczos-type product method such as CGS or the BiCGSTAB.
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1185565
zbMATH Keywords: transpose-free Lanczos-type algorithms
zbMATH Keywords: non-symmetric linear systems
zbMATH Keywords: formal orthogonal polynomials
zbMATH Keywords: Lanczos-type product method
reviewed by: Petko Hr. Petkov
describes a project that uses: na5
describes a project that uses: na1
describes a project that uses: testmatrix
MaRDI profile type: Publication
full work available at URL: a:1012085428800
OpenAlex ID: W2125272340
description: scientific article; zbMATH DE number 1185565