Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
From MaRDI portal
Publication:1127054
DOI10.1023/A:1011637511962zbMath0907.65030OpenAlexW1626832004MaRDI QIDQ1127054
Tony F. Chan, Lisette de Pillis, Henk A. van der Vorst
Publication date: 4 March 1999
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011637511962
nonsymmetric linear systemsquasi-minimal residual methodbi-conjugate gradient algorithmtranspose-free Lanczos algorithm
Related Items (6)
IDR: a new generation of Krylov subspace methods? ⋮ Linearly convergent adjoint free solution of least squares problems by random descent ⋮ An extended nonsymmetric block Lanczos method for model reduction in large scale dynamical systems ⋮ Adaptive solution of infinite linear systems by Krylov subspace methods ⋮ Transpose-free multiple Lanczos and its application in Padé approximation ⋮ A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
Uses Software
This page was built for publication: Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
