Transpose-free Lanczos-type algorithms for nonsymmetric linear systems (Q1127055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1185565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transpose-free Lanczos-type algorithms for nonsymmetric linear systems |
scientific article; zbMATH DE number 1185565 |
Statements
Transpose-free Lanczos-type algorithms for nonsymmetric linear systems (English)
0 references
4 March 1999
0 references
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.
0 references
transpose-free Lanczos-type algorithms
0 references
non-symmetric linear systems
0 references
formal orthogonal polynomials
0 references
Lanczos-type product method
0 references
0.9247795939445496
0 references
0.9205289483070374
0 references
