
UMFPACK
 Referenced in 421 articles
[sw00989]
 routines are provided for ordering and analyzing a sparse matrix, computing the numerical factorization, solving...

ARPACK
 Referenced in 848 articles
[sw04218]
 large sparse or structured matrices A where structured means that a matrixvector product ... requires order n rather than the usual order n2 floating point operations. This software...

symrcm
 Referenced in 390 articles
[sw08566]
 ordering works for both symmetric and nonsymmetric S. For a real, symmetric sparse matrix...

MFEM
 Referenced in 62 articles
[sw09043]
 order to facilitate this, MFEM uses compressed sparse row (CSR) sparse matrix storage and includes...

COLAMD
 Referenced in 33 articles
[sw00145]
 preserving column preordering prior to numerical factorization, and (2) sparse Cholesky factorization, which requires ... matrix being factorized. These orderings are computed by COLAMD and SYMAMD, respectively. The ordering from ... COLAMD is also suitable for sparse QR factorization, and the factorization of matrices...

irbleigs
 Referenced in 19 articles
[sw00451]
 associated eigenvectors of a sparse Hermitian matrix of large order n. The matrix is accessed...

TAUCS
 Referenced in 32 articles
[sw04014]
 supernodal solvers when it factors a matrix completely, but it can drop small elements from ... Sparse LU with Partial Pivoting Factor and Solve. Can solve huge unsymmetric linear systems. Ordering ... Existing Ordering Codes. The library includes a unified interface to several ordering codes, mostly existing ... symmetric orderings. Matrix Operations. Matrixvector multiplication, triangular solvers, matrix reordering. Matrix Input/Output. Routines...

Aztec
 Referenced in 84 articles
[sw12817]
 algorithms for the iterative solution of large sparse linear systems arising in scientific and engineering ... matrixvector multiplication routines. Users are not required to provide their own matrixvector multiplication ... routines or preconditioners in order to solve a linear system. The Aztec library is written ... will perform the necessary transformations for the matrixvector multiplication and preconditioning. After the transformations...

SuiteSparseQR
 Referenced in 45 articles
[sw07348]
 sparse QR factorization package based on the multifrontal method. Within each frontal matrix, LAPACK ... Building Blocks library. The symbolic analysis and ordering phase preeliminates singletons by permuting ... rankdetection is performed within each frontal matrix using Heath’s method. While Heath ... fillreducing ordering. For sufficiently large problems, the resulting sparse QR factorization obtains a substantial...

ILUM
 Referenced in 64 articles
[sw07244]
 multielimination ILU preconditioner for general sparse matrices Standard preconditioning techniques based on incomplete ... applying the usual ILU factorization to a matrix obtained from a multicolor ordering.par We present ... independent set orderings and multicoloring. We note that in order to improve robustness ... methods that deal specifically with general unstructured sparse matrices such as those arising from finite...

PMORSy
 Referenced in 1 article
[sw20559]
 PMORSy: parallel sparse matrix ordering software for fillin minimization. In this paper we present ... parallel software package for symmetric sparse matrix ordering on shared memory systems. The NPcomplete ... based approach widely used for parallel sparse matrix ordering. Experimental results on symmetric matrices from ... University of Florida Sparse Matrix Collection and matrices from finiteelement analysis of threedimensional...

LIPSOL
 Referenced in 84 articles
[sw04712]
 large problems. It utilizes Matlab’s sparsematrix datastructure and Application Program Interface facility ... existing, efficient Fortran codes for solving large, sparse, symmetric positive deﬁnite linear systems. Specifically, LIPSOL ... ﬁles from two Fortran packages: a sparse Cholesky factorization package developed by Esmond ... ORNL and a multiple minimumdegree ordering package by Joseph Liu at University of Waterloo...

LPABO
 Referenced in 2 articles
[sw00526]
 Barrier method using the sparse matrix Ordering) is a linear programming program developed to demonstrate...

FEAST
 Referenced in 92 articles
[sw04025]
 algorithm takes its inspiration from the densitymatrix representation and contour integration technique in quantum ... hand sides and one reduced eigenvalue problem orders of magnitude smaller than the original ... predefined interfaces for dense, banded and sparse systems. It includes double and single precision arithmetic...

DSJM
 Referenced in 6 articles
[sw12532]
 partitioning algorithm after the sparse matrix has been preprocessed with ordering heuristics for efficiency ... Models and their efficient implementation for sparse Jacobian matrix determination, Disc. Appl. Math...

ExaDune
 Referenced in 13 articles
[sw32962]
 exhibiting a heterogeneous massively parallel architecture. In order to cope with the increased probability ... based sparse approximate inverses, matrixfree sumfactorisation for highorder discontinuous Galerkin discretisations...

libPTScotch
 Referenced in 3 articles
[sw12562]
 parallel static mappings and parallel sparse matrix block orderings of distributed graphs. It gives brief...

MORSy
 Referenced in 1 article
[sw20719]
 MORSy – sparse Matrix ORdering Software for fillin minimization. MORSy is an open source library ... computing fillreducing ordering of sparse matrix. It is based on the multilevel nested dissection...

QUIC
 Referenced in 34 articles
[sw11795]
 statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure ... methods that largely use first order gradient information, our algorithm is based on Newton ... modifications that leverage the structure of the sparse Gaussian MLE problem. We show that...

WGPP
 Referenced in 1 article
[sw33236]
 WGPP: Watson Graph Partitioning (and Sparse Matrix Ordering) Package...