Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method

Timothy A. Davis

Code and Data Abstract

An ANSI C code for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The pre-ordering and symbolic analysis phase computes an upper bound on fill-in, work, and memory usage during the subsequent numerical factorization. User-callable routines are provided for ordering and analyzing a sparse matrix, computing the numerical factorization, solving a system with the LU factors, transposing and permuting a sparse matrix, and converting between sparse matrix representations. The simple user interface shields the user from the details of the complex sparse factorization data structures by returning simple handles to opaque objects. Additional user-callable routines are provided for printing and extracting the contents of these opaque objects. An even simpler way to use the package is through its MATLAB interface. UMFPACK is incorporated as a built-in operator in MATLAB 6.5 as x = A\b when A is sparse and unsymmetric.

Article

Timothy A. Davis. "Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method." ACM Transactions on Mathematical Software.     doi:10.1145/992200.992206. Retrieved 10/23/2018 from researchcompendia.org/compendia/2013.375/

Compendium Type: Published Papers
Primary Research Field: Computer and Information Sciences
Secondary Research Field: Mathematics
Content License: Public Domain Mark
Code License: MIT License

Page Owner

jenn.seiler@gmail.com

created 12/23/2013

modified 01/16/2014

blog comments powered by Disqus