Scientific Programming

Scientific Programming / 2001 / Article

Open Access

Volume 9 |Article ID 569670 | https://doi.org/10.1155/2001/569670

Jack Dongarra, Victor Eijkhout, Piotr Łuszczek, "Recursive Approach in Sparse Matrix LU Factorization", Scientific Programming, vol. 9, Article ID 569670, 10 pages, 2001. https://doi.org/10.1155/2001/569670

Recursive Approach in Sparse Matrix LU Factorization

Received20 Sep 2001
Accepted20 Sep 2001

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.

Copyright © 2001 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views157
Downloads458
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.