Direct methods for sparse matrices
Direct methods for sparse matrices
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Parallel algorithms for sparse linear systems
SIAM Review
Block sparse Cholesky algorithms on advanced uniprocessor computers
SIAM Journal on Scientific Computing
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
IEEE Transactions on Parallel and Distributed Systems
Robust Ordering of Sparse Matrices using Multisection
SIAM Journal on Matrix Analysis and Applications
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Accurate Symmetric Indefinite Linear Equation Solvers
SIAM Journal on Matrix Analysis and Applications
Modifying a Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Numerical Linear Algebra for High Performance Computers
Numerical Linear Algebra for High Performance Computers
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Multiple-Rank Modifications of a Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
SIAM Journal on Matrix Analysis and Applications
An iterative working-set method for large-scale nonconvex quadratic programming
Applied Numerical Mathematics
The design and implementation of a new out-of-core sparse cholesky factorization method
ACM Transactions on Mathematical Software (TOMS)
MA57---a code for the solution of sparse symmetric definite and indefinite systems
ACM Transactions on Mathematical Software (TOMS)
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
Solving unsymmetric sparse systems of linear equations with PARDISO
Future Generation Computer Systems - Special issue: Selected numerical algorithms
ACM Transactions on Mathematical Software (TOMS)
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Algorithm 837: AMD, an approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Row Modifications of a Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
SIAM Journal on Matrix Analysis and Applications
Experiences of sparse direct symmetric solvers
ACM Transactions on Mathematical Software (TOMS)
On the design of interfaces to sparse direct solvers
ACM Transactions on Mathematical Software (TOMS)
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
ACM Transactions on Mathematical Software (TOMS)
Hypermatrix oriented supernode amalgamation
The Journal of Supercomputing
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
An out-of-core sparse Cholesky solver
ACM Transactions on Mathematical Software (TOMS)
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs
Parallel Computing
Sparse non-linear least squares optimization for geometric vision
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Direct sparse factorization of blocked saddle point matrices
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Updated sparse cholesky factors for corotational elastodynamics
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
In recent years a number of solvers for the direct solution of large sparse symmetric linear systems of equations have been developed. These include solvers that are designed for the solution of positive definite systems as well as those that are principally intended for solving indefinite problems. In this study, we use performance profiles as a tool for evaluating and comparing the performance of serial sparse direct solvers on an extensive set of symmetric test problems taken from a range of practical applications.