On the Lanczos method for solving symmetric linear systems with several right-hand sides
Journal Article
·
· Math. Comput.; (United States)
This paper analyzes a few methods based on the Lanczos algorithm for solving large sparse symmetric linear systems with several right-hand sides. The methods examined are suitable for the situation when the right sides are not too different from one another, as is often the case in time-dependent or parameter-dependent problems. We propose a theoretical error bound for the approximation obtained from a projection process onto a Krylov subspace generated from processing a previous right-hand side.
- Research Organization:
- The Institute of Optical Research, S-100 44 Stockholm, Sweden
- OSTI ID:
- 6895560
- Journal Information:
- Math. Comput.; (United States), Journal Name: Math. Comput.; (United States) Vol. 48:178; ISSN MCMPA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
The BL-QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides
Journal Article
·
Fri Aug 01 00:00:00 EDT 2014
· Numerical Linear Algebra with Applications
·
OSTI ID:1156889
The BL-QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:440718
Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides
Conference
·
Sun Nov 01 00:00:00 EDT 2009
·
OSTI ID:1023440