Year: 2001
Type: article
Abstract: 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.
Source: Scientific Programming
DOI: 10.1155/2001/569670
Authors: Jack Dongarra, Victor Eijkhout, Piotr Łuszczek
Institution: University of Tennessee at Knoxville
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,000
OpenAlex ID: W1997196200
