Recursive approach in sparse matrix LU factorization

  • Authors:

  • Jack Dongarra;Victor Eijkhout;Piotr Ł/uszczek

  • Affiliations:

  • University of Tennessee, Department of Computer Science, Knoxville, TN 37996-3450, USA. Tel.: +865 974 8295/ Fax: +865 974 8296;University of Tennessee, Department of Computer Science, Knoxville, TN 37996-3450, USA. Tel.: +865 974 8295/ Fax: +865 974 8296;University of Tennessee, Department of Computer Science, Knoxville, TN 37996-3450, USA. Tel.: +865 974 8295/ Fax: +865 974 8296 (Tel.: +865 974 8295/ Fax: +865 974 8296/ E-mail: luszczek@cs.utk.ed ...

  • Venue:
  • Scientific Programming
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.