作者: Youcef Saad
DOI: 10.1090/S0025-5718-1987-0878697-3
关键词:
摘要: This paper analyzes a few methods based on the Lanczos algorithm for solving large sparse symmetric linear systems with several right-hand sides. The examined are suitable situation when right sides not too different from one another, as is often case in time-dependent or parameter-dependent problems. We propose theoretical error bound approximation obtained projection process onto Krylov subspace generated processing previous side.