Name
Abstract | ||
|---|---|---|
The increasing gap between processor performance and memory access time warrants the re-examination of data movement in iterative linear solver algorithms. For this reason, we explore and establish the feasibility of modifying a standard iterative linear solver algorithm in a manner that reduces the movement of data through memory. In particular, we present an alternative to the restarted GMRES algorithm for solving a single right-hand side linear system $Ax=b$ based on solving the block linear system $AX=B$. Algorithm performance, i.e., time to solution, is improved by using the matrix $A$ in operations on groups of vectors. Experimental results demonstrate the importance of implementation choices on data movement as well as the effectiveness of the new method on a variety of problems from different application areas. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1137/040608088 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
gmres,iterative linear solver algorithm,krylov subspace,memory access time warrant,iterative methods,processor performance,algorithm performance,memory access costs,standard iterative linear solver,different application area,data movement,block linear system,block variant,linear system,gmres algorithm,improving linear solver performance,block gmres,iteration method | Krylov subspace,Linear system,Access time,Generalized minimal residual method,Matrix (mathematics),Iterative method,Algorithm,Numerical analysis,Mathematics,Numerical linear algebra | Journal |
Volume | Issue | ISSN |
27 | 5 | 1064-8275 |
Citations | PageRank | References |
26 | 1.03 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Allison H. Baker | 1 | 222 | 15.49 |
| J. M. Dennis | 2 | 41 | 2.75 |
| E. R. Jessup | 3 | 100 | 11.48 |