Recursive Approach in Sparse Matrix LU Factorization

This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results gi...

Full description

Saved in:
Bibliographic Details
Published in:Scientific programming 2001-01, Vol.9 (1), p.51-60
Main Authors: Dongarra, Jack, Eijkhout, Victor, Łuszczek, Piotr
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for sparse matrix factorization in terms of execution time, memory usage, and error estimates of the solution.
ISSN:1058-9244
1875-919X
DOI:10.1155/2001/569670