Minimizing Communication in Numerical Linear Algebra

In 1981 Hong and Kung proved a lower bound on the amount of communication (amount of data moved between a small, fast memory and large, slow memory) needed to perform dense, n-by-n matrix multiplication using the conventional O(n3) algorithm, where the input matrices were too large to fit in the sma...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on matrix analysis and applications Vol. 32; no. 3; pp. 866 - 901
Main Authors:	Ballard, Grey, Demmel, James, Holtz, Olga, Schwartz, Oded
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.07.2011
Subjects:	Algebra Algorithms Applied mathematics Bandwidths Bottlenecks Combinatorics Combinatorics. Ordered structures Communication Computer science Costs Eigenvalues Exact sciences and technology Graph theory Linear algebra Linear and multilinear algebra, matrix theory Mathematics Nonlinear algebraic and transcendental equations Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Composition algebra 68Q25 Costs Multiplication 68W40 Processor Memory Singular value G8W10 Bandwith selection latency Eigenvalue communication-avoiding Parallel 65Y10 Computing Direct method linear algebra algorithms Input G5F30 Cholesky method Bandwidth Communication Dense matrix Lower bound Parallel algorithm LU factorization Optimal algorithm Numerical linear algebra 65Y20 68W15 65Y05 Numerical analysis Graph Experimental design Linear algebra QR factorization Arithmetic operation Variety Power
ISSN:	0895-4798, 1095-7162
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!