Direct methods for sparse matrices
Direct methods for sparse matrices
An extended set of FORTRAN basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Algorithm 695: software for a new modified Cholesky factorization
ACM Transactions on Mathematical Software (TOMS)
Preconditioners for indefinite systems arising in optimization
SIAM Journal on Matrix Analysis and Applications
CUTE: constrained and unconstrained testing environment
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
An Interior Point Algorithm for Large-Scale Nonlinear Programming
SIAM Journal on Optimization
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Computational Optimization and Applications
Experiences of sparse direct symmetric solvers
ACM Transactions on Mathematical Software (TOMS)
How good are projection methods for convex feasibility problems?
Computational Optimization and Applications
An out-of-core sparse Cholesky solver
ACM Transactions on Mathematical Software (TOMS)
The design and use of a sparse direct solver for skew symmetric matrices
Journal of Computational and Applied Mathematics
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
Scaling and pivoting in an out-of-core sparse direct solver
ACM Transactions on Mathematical Software (TOMS)
The design of a new out-of-core multifrontal solver
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
A tearing-based hybrid parallel sparse linear system solver
Journal of Computational and Applied Mathematics
ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
Sparse non-linear least squares optimization for geometric vision
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Finite-Element Preconditioning of G-NI Spectral Methods
SIAM Journal on Scientific Computing
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
ACM Transactions on Mathematical Software (TOMS)
Partial factorization of a dense symmetric indefinite matrix
ACM Transactions on Mathematical Software (TOMS)
Design of a Multicore Sparse Cholesky Factorization Using DAGs
SIAM Journal on Scientific Computing
Finite Elements in Analysis and Design
Maximum-weighted matching strategies and the application to symmetric indefinite systems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Preconditioning for Allen-Cahn variational inequalities with non-local constraints
Journal of Computational Physics
An efficient overloaded method for computing derivatives of mathematical functions in MATLAB
ACM Transactions on Mathematical Software (TOMS)
Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB
ACM Transactions on Mathematical Software (TOMS)
Pivoting strategies for tough sparse indefinite systems
ACM Transactions on Mathematical Software (TOMS)
Applying microprocessor analysis methods to river network modelling
Environmental Modelling & Software
Hi-index | 0.01 |
We introduce a new code for the direct solution of sparse symmetric linear equations that solves indefinite systems with 2 × 2 pivoting for stability. This code, called MA57, is in HSL 2002 and supersedes the well used HSL code MA27. We describe some of the implementation details and emphasize the novel features of MA57. These include restart facilities, matrix modification, partial solution for matrix factors, solution of multiple right-hand sides, and iterative refinement and error analysis. The code is written in Fortran 77, but there are additional facilities within a Fortran 90 implementation that include the ability to identify and change pivots. Several of these facilities have been developed particularly to support optimization applications, and we illustrate the performance of the code on problems arising therefrom.