Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Amestoy, I. Duff, J. L’Excellent, J. Koster (2001)
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic SchedulingSIAM J. Matrix Anal. Appl., 23
M. Heath, E. Ng, B. Peyton (1991)
Parallel Algorithms for Sparse Linear SystemsSIAM Rev., 33
J. Bunch, L. Kaufman, B. Parlett (1976)
Decomposition of a symmetric matrixNumerische Mathematik, 27
Anshul Gupta, G. Karypis, Vipin Kumar (1997)
Highly Scalable Parallel Algorithms for Sparse Matrix FactorizationIEEE Trans. Parallel Distributed Syst., 8
O. Schenk, K. Gärtner, W. Fichtner (2000)
Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory MultiprocessorsBIT Numerical Mathematics, 40
I. Duff, J. Scott (2005)
Towards an automatic ordering for a symmetric sparse direct solverRutherford Appleton Laboratory Technical Reports
J. Dongarra, J. Croz, S. Hammarling, I. Duff (1990)
A set of level 3 basic linear algebra subprogramsACM Trans. Math. Softw., 16
C. Ashcraft, Joseph Liu (1998)
Robust Ordering of Sparse Matrices using MultisectionSIAM J. Matrix Anal. Appl., 19
I. Duff, A. Erisman, J. Reid (1987)
Direct Methods for Sparse Matrices
P. Amestoy, I. Duff, J. L’Excellent (2000)
Multifrontal parallel distributed symmetric and unsymmetric solversComputer Methods in Applied Mechanics and Engineering, 184
W. Tinney, John Walker (1967)
Direct solutions of sparse network equations by optimally ordered triangular factorization, 55
T. Davis, W. Hager (1999)
Modifying a Sparse Cholesky FactorizationSIAM J. Matrix Anal. Appl., 20
J. Pasciak, A. George, Joseph Liu (1982)
Computer solution of large sparse positive definite systemsMathematics of Computation, 39
(1997)
Recent progress in parallel multifrontal solvers for unsymmetric sparse matrices
T. Davis, W. Hager (2000)
Multiple-Rank Modifications of a Sparse Cholesky FactorizationSIAM J. Matrix Anal. Appl., 22
T. Davis, I. Duff (1997)
An Unsymmetric-Pattern Multifrontal Method for Sparse LU FactorizationSIAM J. Matrix Anal. Appl., 18
Our thanks also to those who supplied test problems, including Mario Arioli
T. Davis, W. Hager (2005)
Row Modifications of a Sparse Cholesky FactorizationSIAM J. Matrix Anal. Appl., 26
I. Maros, C. Mészáros (1999)
A repository of convex quadratic programming problemsOptimization Methods & Software, 11
T. Davis, J. Gilbert, Stefan Larimore, E. Ng (2000)
A column approximate minimum degree ordering algorithmACM Trans. Math. Softw., 30
N. Gould, J. Scott (2004)
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equationsACM Trans. Math. Softw., 30
Elizabeth Dolan, Jorge Moré (2001)
Benchmarking optimization software with performance profilesMathematical Programming, 91
T. Davis, I. Du (1993)
An Unsymmetric-pattern Multifrontal Method for Sparse Lu Factorization
J. Dongarra, Lain Duff, D. Sorensen, H. Vorst (1998)
Numerical Linear Algebra for High-Performance Computers
J. Bunch, L. Kaufman (1977)
Some stable methods for calculating inertia and solving symmetric linear systemsMathematics of Computation, 31
Jürgen Schulze (2001)
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering MethodsBIT Numerical Mathematics, 41
I. Duff, R. Grimes, J. Lewis (1997)
The Rutherford-Boeing sparse matrix collectionRutherford Appleton Laboratory Technical Reports
G. Karypis, Vipin Kumar (1998)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM J. Sci. Comput., 20
R. Vanderbei (1995)
Symmetric Quasidefinite MatricesSIAM J. Optim., 5
I. Duff (2004)
MA57---a code for the solution of sparse symmetric definite and indefinite systemsACM Trans. Math. Softw., 30
O. Schenk, K. Gärtner (2006)
ON FAST FACTORIZATION PIVOTING METHODS FOR SPARSE SYMMETRI C INDEFINITE SYSTEMS
(2007)
ACM Transactions on Mathematical Software
Joseph Liu (1985)
Modification of the minimum-degree algorithm by multiple eliminationACM Trans. Math. Softw., 11
T. Davis (2004)
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal methodACM Trans. Math. Softw., 30
N. Gould, P. Toint (2002)
An iterative working-set method for large-scale nonconvex quadratic programmingApplied Numerical Mathematics, 43
J. Gilbert, E. Ng, B. Peyton (1994)
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky FactorizationSIAM J. Matrix Anal. Appl., 15
G. Kumfert, A. Pothen (1997)
Two improved algorithms for envelope and wavefront reductionBIT Numerical Mathematics, 37
Article 10, Publication date
(1998)
METIS: A software package for partitioning unstructured graphs, partitioning meshes and computing fill-reducing orderings of sparse matrices -version 4.0
T. Davis, J. Gilbert, Stefan Larimore, E. Ng (2004)
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithmACM Trans. Math. Softw., 30
I. Duff, R. Grimes, J. Lewis (1982)
Sparse matrix test problemsACM Trans. Math. Softw., 15
I. Duff, J. Koster (1999)
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse MatricesSIAM J. Matrix Anal. Appl., 20
Florin Dobrian, G. Kumfert (1994)
The Design of Sparse Direct Solvers Using Object-oriented Techniques
V. Rotkin, Sivan Toledo (2004)
The design and implementation of a new out-of-core sparse cholesky factorization methodACM Trans. Math. Softw., 30
N. Gould, D. Orban, P. Toint (2003)
CUTEr and SifDec: A constrained and unconstrained testing environment, revisitedACM Trans. Math. Softw., 29
O. Schenk, K. Gärtner (2002)
Solving unsymmetric sparse systems of linear equations with PARDISOFuture Gener. Comput. Syst., 20
I. Duff, J. Reid (1983)
The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Trans. Math. Softw., 9
A. George (1973)
Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 10
I. Duff, S. Pralet (2005)
Towards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systemsRutherford Appleton Laboratory Technical Reports
Joseph Liu (1992)
The Multifrontal Method for Sparse Matrix Solution: Theory and PracticeSIAM Rev., 34
C. Ashcraft, R. Grimes, J. Lewis (1999)
Accurate Symmetric Indefinite Linear Equation SolversSIAM J. Matrix Anal. Appl., 20
P. Amestoy, Enseeiht-Irit, T. Davis, I. Duff (2004)
Algorithm 837: AMD, an approximate minimum degree ordering algorithmACM Trans. Math. Softw., 30
(2000)
The design of sparse direct solvers using objectoriented techniquesAdvances in Software Tools in Scientific Computing A numerical evaluation of sparse solvers for symmetric systems
I. Duff, S. Pralet (2005)
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite ProblemsSIAM J. Matrix Anal. Appl., 27
(2001)
WSMP: A high-performance serial and parallel sparse linear solver
P. Amestoy, T. Davis, I. Duff (1996)
An Approximate Minimum Degree Ordering AlgorithmSIAM J. Matrix Anal. Appl., 17
(1994)
Sparse matrices in optimization Presented at Sparse Days at St Girons, International meeting on Sparse Matrix Methods
T. Davis (2004)
A column pre-ordering strategy for the unsymmetric-pattern multifrontal methodACM Trans. Math. Softw., 30
Ingrid Bongartz, A. Conn, N. Gould, P. Toint (1995)
CUTE: constrained and unconstrained testing environmentACM Trans. Math. Softw., 21
A. George, Joseph Liu (1981)
Computer Solution of Large Sparse Positive Definite
2E-11 2.3E-15 3.9E-15 6.1E-15 2.3E-14 1.5E-17 6
(2004)
A collection of Fortran codes for large-scale scientific computation
E. Ng, B. Peyton (1991)
Block Sparse Cholesky Algorithms on Advanced Uniprocessor ComputersSIAM J. Sci. Comput., 14
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.
ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery
Published: Jun 1, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.