1

BuNcH, J.R., AND PARLETT, B.N. Direct methods for solving symmetrm indefimte systems of hnear equations SIAM J. Numer. Anal. 8 (1971), 639-655.

2

BUNCH, J.R., AND ROSE, D.J. (Eds) Sparse Matrix Computatmns. Academic Press, New York, 1976.

3

DUFF, I.S. MA28--A set of Fortran subroutines for sparse unsymmetnc linear equations HarweU Rep. AERE R. 8730, HMSO, London, 1977.

4

DUFF, I.S Design features of a code for solving sparse unsymmetric hnear systems out-of-core. SIAM J. Sc~ Stat Comput. 4 (1983).

5

DUFF, I.S., MA32-A package for solving sparse unsymmetnc systems using the frontal method. Harwell Rep AERE R. 10079, HMSO, London, 1981.

6

I. S. Duff , J. K. Reid, Some Design Features of a Sparse Matrix Code, ACM Transactions on Mathematical Software (TOMS), v.5 n.1, p.18-35, March 1979  [doi>10.1145/355815.355817]

7

DUFF, I.S., REID, J.K., MUNKSGAARD, N., AND NIELSEN, H.B. Direct solution of sets of linear equations whose matrix is sparse, symmetric and indefinite. J. Inst. Maths. Appl. 23 (1979), 235-250

8

DUFF, I.S., AND STEWART, G.W. (Eds.) Sparse Matrix Proceedings 1978. SIAM Press, Philadelphia, Pa., 1979.

9

EISENSTAT, S.C., GURSKY, M C., SCHULTZ, M H., AND SHERMAN, A H. The Yale sparse matrix package, I The symmetric codes, and, II The non-symmetric codes. Reps. 112 and 114, Dept. Computer Science, Yale Univ., New Haven, Corm, 1977.

10

EISENSTAT, S.C., GURSKY, M C., SCHULTZ, M.H, AND SHERMAN, A.H. Yale sparse matrix package I The symmetric codes. Int. J. Numer. Meth. Eng 18 (1982), 1145-1151.

11

EISENSTAT, S.C., SCHULTZ, M.H., AND SHERMAN, A H. Applications of an element model for Gaussian elimination. In Sparse Matrix Computations, J. R. Bunch and D. J. Rose (Eds.), Academic Press, New York, 1976, pp. 85-96.

12

EISENSTAT, S.C., SCHULTZ, M.H., AND SHERMAN, A.H. Software for sparse Gaussian elimination with ILmited core storage. In Sparse Matrix Proceedings 1978, I.S. Duff and G.W. Stewart (Eds.), SIAM Press, Philadelphia, Pa., 1979.

13

EISENSTAT, S C., SCHULTZ, M.H., AND SHERMAN, A.H. Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sc~. Star Comput. 2 (1981), 225-237.

14

EVERSTINE, G.C. A comparmon of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J Numer. Meth. Eng. 14 (1979), 837-853.

15

GEORGE, J.A., AND LIU, J.W.H. An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal. 15 (1978), 1053-1069.

16

GEORGE, J.A., AND LIU, J W.H. A minimal storage implementation of the minimum degree algorithm. SIAM J Numer. Anal. 17 (1980), 282-299

17

Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981

18

GEORGE, A., LIU, J.W., AND NG, E. User grade for SPARSPAK: Waterloo sparse linear equations package. Res. Rep. CS-78-30 (Rev. Jan. 1980), Dept. Computer Science, Univ. of Waterloo, Waterloo, Ont., Canada, 1980.

19

HOOD, P. Frontal solution program for unsymmetric matrices. Int. J. Numcr Meth. Eng. 10 (1976), 379-400.

20

IRONS, B.M. A frontal solution program for finite element analysis. Int. J. Numer. Meth Eng. 2 (1970), 5-32

21

PETERS, F.J. Sparse matrices and substructures Mathematical Centre Tracts 119, Mathematisch Centrum, Amsterdam, The Netherlands, 1980.

22

REIn, J.K. Two Fortran subroutmes for direct solutmn of linear equations whose matrix is sparse, symmetric and posltwe definite. Harwell Rep AERE R. 7119, HMSO, London, 1972,

23

SHERMAN, A.H On the efficient solutmn of sparse systems of linear and nonlinear equatmns. Res Rep. 46, Dept. Computer Science, Yale Univ., New Haven, Conn, 1975.

24

SPEELPENNING, B. The generalized element method. Private communication, 1973; also, issued as Rep. UIUCDCS-R-78-946, Dept. Computer Science, Umv. of Ilhnois at Urbana-Champmgn, 1978.

Timothy A. Davis , Iain S. Duff, A combined unifrontal/multifrontal method for unsymmetric sparse matrices, ACM Transactions on Mathematical Software (TOMS), v.25 n.1, p.1-20, March 1999

Joseph W. H. Liu, A partial pivoting strategy for sparse symmetric matrix decomposition, ACM Transactions on Mathematical Software (TOMS), v.13 n.2, p.173-182, June 1987

George Karypis , Anshul Gupta , Vipin Kumar, A parallel formulation of interior point algorithms, Proceedings of the 1994 ACM/IEEE conference on Supercomputing, November 14-18, 1994, Washington, D.C.

Joseph W. H. Liu, The multifrontal method and paging in sparse Cholesky factorization, ACM Transactions on Mathematical Software (TOMS), v.15 n.4, p.310-325, Dec. 1989

Iain S. Duff, MA57---a code for the solution of sparse symmetric definite and indefinite systems, ACM Transactions on Mathematical Software (TOMS), v.30 n.2, p.118-144, June 2004

P. Sadayappan , S. K. Rao, Communication reduction for distributed sparse matrix factorization on a processor mesh, Proceedings of the 1989 ACM/IEEE conference on Supercomputing, p.371-379, November 12-17, 1989, Reno, Nevada, United States

Iain S. Duff, Parallel algorithm research at CERFACS, Proceedings of the 1990 conference on Supercomputing, p.536-542, October 1990, New York, New York, United States

Iain S. Duff , Michael A. Heroux , Roldan Pozo, An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum, ACM Transactions on Mathematical Software (TOMS), v.28 n.2, p.239-267, June 2002

Joseph W. H. Liu, On threshold pivoting in the multifrontal method for sparse indefinite systems, ACM Transactions on Mathematical Software (TOMS), v.13 n.3, p.250-261, Sept. 1987

Joseph W. Liu, A compact row storage scheme for Cholesky factors using elimination trees, ACM Transactions on Mathematical Software (TOMS), v.12 n.2, p.127-148, June 1986

Nicholas I. M. Gould , Philippe L. Toint, An iterative working-set method for large-scale nonconvex quadratic programming, Applied Numerical Mathematics, v.43 n.1-2, p.109-128, October 2002

Joseph W. H. Liu, A generalized envelope method for sparse factorization by rows, ACM Transactions on Mathematical Software (TOMS), v.17 n.1, p.112-129, March 1991

Anshul Gupta , Vipin Kumar, A scalable parallel algorithm for sparse Cholesky factorization, Proceedings of the 1994 conference on Supercomputing, p.793-802, December 1994, Washington, D.C., United States

George Karypis , Anshul Gupta , Vipin Kumar, A parallel formulation of interior point algorithms, Proceedings of the 1994 conference on Supercomputing, p.204-213, December 1994, Washington, D.C., United States

Edward Rothberg , Anoop Gupta, Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations, Proceedings of the 1990 conference on Supercomputing, p.232-241, October 1990, New York, New York, United States

K. A. Gallivan , B. A. Marsolf , H. A. G. Wijshoff, The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization, Proceedings of the 8th international conference on Supercomputing, p.419-430, July 11-15, 1994, Manchester, England

Joseph W. H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Transactions on Mathematical Software (TOMS), v.11 n.2, p.141-153, June 1985

Edward Rothberg , Anoop Gupta, Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy, ACM Transactions on Mathematical Software (TOMS), v.17 n.3, p.313-334, Sept. 1991

Joseph W. H. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software (TOMS), v.12 n.3, p.249-264, Sept. 1986

P. Hénon , P. Ramet , J. Roman, PASTIX: a high-performance parallel direct solver for sparse symmetric positive definite systems, Parallel Computing, v.28 n.2, p.301-321, February 2002

Dror Irony , Gil Shklarski , Sivan Toledo, Parallel and fully recursive multifrontal sparse Cholesky, Future Generation Computer Systems, v.20 n.3, p.425-440, April 2004

Jean R. S. Blair , Barry W. Peyton, On finding minimum-diameter clique trees, Nordic Journal of Computing, v.1 n.2, p.173-201, Summer 1994

John K. Reid , Jennifer A. Scott, Implementing Hager's exchange methods for matrix profile reduction, ACM Transactions on Mathematical Software (TOMS), v.28 n.4, p.377-391, December 2002

Anshul Gupta , Vipin Kumar, A scalable parallel algorithm for sparse Cholesky factorization, Proceedings of the 1994 ACM/IEEE conference on Supercomputing, November 14-18, 1994, Washington, D.C.

Jack Dongarra , Ian Foster , Geoffrey Fox , William Gropp , Ken Kennedy , Linda Torczon , Andy White, References, Sourcebook of parallel computing, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2003

Olivier Cozette , Abdou Guermouche , Gil Utard, Adaptive paging for a multifrontal solver, Proceedings of the 18th annual international conference on Supercomputing, June 26-July 01, 2004, Malo, France

Cleve Ashcraft , Roger Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Transactions on Mathematical Software (TOMS), v.15 n.4, p.291-309, Dec. 1989

Pontus Matstoms, Sparse QR factorization in MATLAB, ACM Transactions on Mathematical Software (TOMS), v.20 n.1, p.136-159, March 1994

I. S. Duff , J. K. Reid, Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems, ACM Transactions on Mathematical Software (TOMS), v.22 n.2, p.227-257, June 1996

Patrick R. Amestoy , Iain S. Duff , Stéphane Pralet , Christof Vömel, Adapting a parallel sparse direct solver to architectures with clusters of SMPs, Parallel Computing, v.29 n.11-12, p.1645-1668, November/December 2003

Nicholas I. M. Gould , Jennifer A. Scott, A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations, ACM Transactions on Mathematical Software (TOMS), v.30 n.3, p.300-325, September 2004

Abdou Guermouche , Jean-Yves L'Excellent , Gil Utard, Impact of reordering on the memory of a multifrontal solver, Parallel Computing, v.29 n.9, p.1191-1218, September 2003

Timothy A. Davis , John R. Gilbert , Stefan I. Larimore , Esmond G. Ng, A column approximate minimum degree ordering algorithm, ACM Transactions on Mathematical Software (TOMS), v.30 n.3, p.353-376, September 2004

Cong Fu , Xiangmin Jiao , Tao Yang, Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures, IEEE Transactions on Parallel and Distributed Systems, v.9 n.2, p.109-125, February 1998

Timothy A. Davis, A column pre-ordering strategy for the unsymmetric-pattern multifrontal method, ACM Transactions on Mathematical Software (TOMS), v.30 n.2, p.165-195, June 2004

Pu Chen , Dong Zheng , Shuli Sun , Mingwu Yuan, High performance sparse static solver in finite element analyses with loop-unrolling, Advances in Engineering Software, v.34 n.4, p.203-215, 26 February 2003

Vladimir Rotkin , Sivan Toledo, The design and implementation of a new out-of-core sparse cholesky factorization method, ACM Transactions on Mathematical Software (TOMS), v.30 n.1, p.19-46, March 2004

Pontus Matstoms, Sparse Linear Least Squares Problems in Optimization, Computational Optimization and Applications, v.7 n.1, p.89-110, Jan. 1997

Anders Forsgren, Inertia-controlling factorizations for optimization algorithms, Applied Numerical Mathematics, v.43 n.1-2, p.91-107, October 2002

Patrick R. Amestoy , Abdou Guermouche , Jean-Yves L'Excellent , Stéphane Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, v.32 n.2, p.136-156, February 2006

I. S. Duff , J. A. Scott, The design of a new frontal code for solving sparse, unsymmetric systems, ACM Transactions on Mathematical Software (TOMS), v.22 n.1, p.30-45, March 1996

Anshul Gupta , George Karypis , Vipin Kumar, Highly Scalable Parallel Algorithms for Sparse Matrix Factorization, IEEE Transactions on Parallel and Distributed Systems, v.8 n.5, p.502-520, May 1997

Nicholas I. Gould, How good are projection methods for convex feasibility problems?, Computational Optimization and Applications, v.40 n.1, p.1-12, May 2008

Jack Dongarra , Victor Eijkhout , Piotr Łuszczek, Recursive approach in sparse matrix LU factorization, Scientific Programming, v.9 n.1, p.51-60, January 2001

Abdou Guermouche , Jean-Yves L'excellent, Constructing memory-minimizing schedules for multifrontal methods, ACM Transactions on Mathematical Software (TOMS), v.32 n.1, p.17-32, March 2006

Omer Meshar , Dror Irony , Sivan Toledo, An out-of-core sparse symmetric-indefinite factorization method, ACM Transactions on Mathematical Software (TOMS), v.32 n.3, p.445-471, September 2006

A. N. F. Klimowicz , M. D. Mihajlović , M. Heil, Deployment of parallel direct sparse linear solvers within a parallel finite element code, Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks, p.310-315, February 14-16, 2006, Innsbruck, Austria

Omer Meshar , Dror Irony , Sivan Toledo, An out-of-core sparse symmetric-indefinite factorization method, ACM Transactions on Mathematical Software (TOMS), v.32 n.3, p.445-471, September 2006

Marc C. Steinbach, On PDE solution in transient optimization of gas networks, Journal of Computational and Applied Mathematics, v.203 n.2, p.345-361, June, 2007

Olaf Schenk , Andreas Wächter , Michael Hagemann, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Computational Optimization and Applications, v.36 n.2-3, p.321-341, April 2007

S. Cafieri , M. D'Apuzzo , V. Simone , D. Serafino, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study, Computational Optimization and Applications, v.36 n.2-3, p.165-193, April 2007

Nicholas I. M. Gould , Jennifer A. Scott , Yifan Hu, A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations, ACM Transactions on Mathematical Software (TOMS), v.33 n.2, p.10-es, June 2007

Emmanuel Agullo , Abdou Guermouche , Jean-Yves L'Excellent, A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory, Parallel Computing, v.34 n.6-8, p.296-317, July, 2008

Alfredo Buttari , Jack Dongarra , Jakub Kurzak , Piotr Luszczek , Stanimir Tomov, Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy, ACM Transactions on Mathematical Software (TOMS), v.34 n.4, p.1-22, July 2008

I. Duff , S. Gratton , X. Pinel , X. Vasseur, Multigrid based preconditioners for the numerical solution of two-dimensional heterogeneous problems in geophysics, International Journal of Computer Mathematics, v.84 n.8, p.1167-1181, August 2007

Chung-Hsien Hsu , Sheng-Lung Peng , Chong-Hui Shi, Constructing a minimum height elimination tree of a tree in linear time, Information Sciences: an International Journal, v.177 n.12, p.2473-2479, June, 2007

Seung Jo Kim , Chang Sung Lee , Jeong Ho Kim , Minsu Joh , Sangsan Lee, IPSAP: A High-performance Parallel Finite Element Code for Large-scale Structural Analysis Based on Domain-wise Multifrontal Technique, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, p.32, November 15-21, 2003

S. Cafieri , M. D'Apuzzo , V. Simone , D. Serafino, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Computational Optimization and Applications, v.38 n.1, p.27-45, September 2007

L. Giraud , A. Haidar , L. T. Watson, Parallel scalability study of hybrid preconditioners in three dimensions, Parallel Computing, v.34 n.6-8, p.363-379, July, 2008

Jennifer A. Scott , Yifan Hu, Experiences of sparse direct symmetric solvers, ACM Transactions on Mathematical Software (TOMS), v.33 n.3, p.18-es, August 2007

Haim Avron , Gil Shklarski , Sivan Toledo, Parallel unsymmetric-pattern multifrontal sparse LU with column preordering, ACM Transactions on Mathematical Software (TOMS), v.34 n.2, p.1-31, March 2008

José R. Herrero , Juan J. Navarro, Hypermatrix oriented supernode amalgamation, The Journal of Supercomputing, v.46 n.1, p.84-104, October 2008

Florent Sourbier , Stéphane Operto , Jean Virieux , Patrick Amestoy , Jean-Yves L'Excellent, FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data-Part 1, Computers & Geosciences, v.35 n.3, p.487-495, March, 2009

John K. Reid , Jennifer A. Scott, An out-of-core sparse Cholesky solver, ACM Transactions on Mathematical Software (TOMS), v.36 n.2, p.1-33, March 2009

Anshul Gupta , Seid Koric , Thomas George, Sparse matrix factorization on massively parallel computers, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, November 14-20, 2009, Portland, Oregon

Maciej Paszyński, On the Parallelization of Self-Adaptive hp-Finite Element Methods Part II. Partitioning Communication Agglomeration Mapping (PCAM) Analysis, Fundamenta Informaticae, v.93 n.4, p.435-457, December 2009

I. S. Duff: colleagues

J. K. Reid: colleagues