Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TOMS
2008

favoriteEmaildiscussreport

80views more TOMS 2008»

Updating an LU Factorization with Pivoting

13 years 3 months ago

Updating an LU Factorization with Pivoting

Download www.cs.utexas.edu

We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivoting, a strategy we call incremental pivoting. An implementation using the Formal Linear Algebra Methods Environment (FLAME) Application Programming Interface (API) is described. Experimental results demonstrate practical numerical stability and high performance on an Intel Itanium2 processor based server.

Enrique S. Quintana-Ortí, Robert A. van de

Real-time Traffic

Formal Linear Algebra | LU Factorization | Pivoting | TOMS 2008 |

claim paper

Related Content

» Managing the complexity of lookahead for LU factorization with pivoting

» A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting

» Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architecture...

» Parallel sparse LU factorization on secondclass message passing platforms

» NestedDissection Orderings for Sparse LU with Partial Pivoting

» HypergraphBased Unsymmetric Nested Dissection Ordering for Sparse LU Factorization

» Elimination Forest Guided 2D Sparse LU Factorization

» Factorizing complex symmetric matrices with positive definite real and imaginary parts

» Towards an accurate performance modeling of parallel sparse factorization

Post Info
More Details (n/a)

Added	29 Dec 2010
Updated	29 Dec 2010
Type	Journal
Year	2008
Where	TOMS
Authors	Enrique S. Quintana-Ortí, Robert A. van de Geijn

Comments (0)