Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems (Q1127054)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
scientific article

    Statements

    Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems (English)
    0 references
    0 references
    0 references
    0 references
    4 March 1999
    0 references
    A transpose-free version of the nonsymmetric scaled Lanczos procedure is presented. It generates the same tridiagonal matrix as the classical algorithm, using two matrix-vector products per iteration without accessing the transpose of the matrix. This algorithm is applied to obtain a transpose-free version of the quasi-minimal residual method (without look-ahead), which requires three matrix-vector products per iteration. A related transpose-free version of the bi-conjugate gradient algorithm is also presented.
    0 references
    nonsymmetric linear systems
    0 references
    transpose-free Lanczos algorithm
    0 references
    quasi-minimal residual method
    0 references
    bi-conjugate gradient algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers