Title
Toward memory-efficient linear solvers
Abstract
We describe a new technique for solvinga sparse linear system Ax = b as a block system AX = B, where multiple starting vectors and right-hand sides are chosen so as to accelerate convergence. Efficiency is gained by reusing the matrix A in block operations with X and B. Techniques for reducingthe cost of the extra matrix-vector operations are presented.
Year
DOI
Venue
2002
10.1007/3-540-36569-9_20
VECPAR
Field
DocType
Volume
Krylov subspace,Convergence (routing),Memory hierarchy,Linear system,Computer science,Reuse,Matrix (mathematics),Parallel computing,Linear solver
Conference
2565
ISSN
ISBN
Citations 
0302-9743
3-540-00852-7
3
PageRank 
References 
Authors
0.55
15
3
Name
Order
Citations
PageRank
Allison H. Baker122215.49
John M. Dennis224139.70
Elizabeth R. Jessup337049.02