Locality Of Reference In Lu Decomposition With Partial Pivoting

Locality Of Reference In Lu Decomposition With Partial Pivoting (1997)

Cached

Download Links

[www.math.tau.ac.il]

by Sivan Toledo

Venue:	SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
Citations:	84 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by jfernandez

Datum	Value	Source
TITLE	Locality Of Reference In Lu Decomposition With Partial Pivoting	user correction - Legacy Corrections
AUTHOR NAME	Sivan Toledo	user correction
ABSTRACT	This paper presents a new partitioned algorithm for LU decomposition with partial pivoting. The new algorithm, called the recursively partitioned algorithm, is based on a recursive partitioning of the matrix. The paper analyzes the locality of reference in the new algorithm and the locality of reference in a known and widely used partitioned algorithm for LU decomposition called the right-looking algorithm. The analysis reveals that the new algorithm performs a factor of $\Theta(\sqrt{M/n})$ fewer I/O operations (or cache misses) than the right-looking algorithm, where $n$ is the order of the matrix and $M$ is the size of primary memory. The analysis also determines the optimal block size for the right-looking algorithm. Experimental comparisons between the new algorithm and the right-looking algorithm show that an implementation of the new algorithm outperforms a similarly coded right-looking algorithm on six different RISC architectures, that the new algorithm performs fewer cache misses than any other algorithm tested, and that it benefits more from Strassen's matrix-multiplication algorithm.	user correction
YEAR	1997	user correction - Legacy Corrections
VENUE	SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS	user correction
VENUE TYPE	JOURNAL	user correction
PAGES	1065--1081	user correction
VOLUME	18	user correction
NUMBER	4	user correction
CITATIONS	15 found	ParsCit 1.0