Routines for solving unsymmetric sparse linear systems
- 'SuiteSparse' is a suite of sparse matrix algorithms, including: 'UMFPACK'
UMFPACK is a set of routines for solving unsymmetric sparse linear systems, Ax=b, using the Unsymmetric MultiFrontal method. It uses dynamic memory allocation, and has a symbolic preordering and analysis phase that also reports the upper bounds on the nonzeros in L and U, flop count, and memory usage in the numeric phase. It can be used for real and complex matrices, rectangular and square, and both non-singular and singular.
DocumentationUser guide included and available in PDF format from http://www.cise.ufl.edu/research/sparse/umfpack/v4.3/UMFPACKv4.3/UMFPACK/Doc/UserGuide.pdf; User quickstart available in PDF format from http://www.cise.ufl.edu/research/sparse/umfpack/v4.3/UMFPACKv4.3/UMFPACK/Doc/QuickStart.pdf
released on 8 December 2016
|License||Verified by||Verified on||Notes|
|License:BSD 2Clause||Janet Casey||30 January 2003|
Leaders and contributors
Resources and communication
|Weak prerequisite||BLAS package (program runs considerably slower without this)|
This entry (in part or in whole) was last reviewed on 8 January 2017.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.