Sciweavers

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

28

TPDS
1998

favoriteEmaildiscussreport

60views more TPDS 1998»

Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures

13 years 10 months ago

Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures

Download www.ams.sunysb.edu

Cong Fu, Xiangmin Jiao, Tao Yang

Real-time Traffic

TPDS 1998 |

claim paper

Related Content

» NestedDissection Orderings for Sparse LU with Partial Pivoting

» Managing the complexity of lookahead for LU factorization with pivoting

» A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting

» Elimination Forest Guided 2D Sparse LU Factorization

» Parallel sparse LU factorization on secondclass message passing platforms

» A Supernodal OutofCore Sparse GaussianElimination Method

» Towards an accurate performance modeling of parallel sparse factorization

» A parallel preconditioning strategy for efficient transistorlevel circuit simulation

» Efficient RunTime Support for Irregular Task Computations with Mixed Granularities

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TPDS
Authors	Cong Fu, Xiangmin Jiao, Tao Yang

Comments (0)