Abstract
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods [3]. We consider improved algorithms to reduce this communication overhead, and we analyze the performance by experiments on a 400-processor parallel computer and with a simple performance model.
Cite
CITATION STYLE
de Sturler, E., & van der Vorst, H. A. (1994). Communication cost reduction for Krylov methods on parallel computers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 797 LNCS, pp. 190–195). Springer Verlag. https://doi.org/10.1007/3-540-57981-8_115
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
