I. S. Duff
- 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.Google Scholar
- 2 BUNCH, J.R., AND ROSE, D.J. (Eds) Sparse Matrix Computatmns. Academic Press, New York, 1976.Google Scholar
- 3 DUFF, I.S. MA28--A set of Fortran subroutines for sparse unsymmetnc linear equations HarweU Rep. AERE R. 8730, HMSO, London, 1977.Google Scholar
- 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).Google Scholar
- 5 DUFF, I.S., MA32-A package for solving sparse unsymmetnc systems using the frontal method. Harwell Rep AERE R. 10079, HMSO, London, 1981.Google Scholar
- 6 DUFF, I.S., AND REID, J.K. Some design features of a sparse matrix code. ACM Trans. Math. Softw. 5, 1 (Mar. 1979), 18-35. Google Scholar
- 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-250Google Scholar
- 8 DUFF, I.S., AND STEWART, G.W. (Eds.) Sparse Matrix Proceedings 1978. SIAM Press, Philadelphia, Pa., 1979.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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-299Google Scholar
- 17 GEORGE, A., AND LIU, J.W. Computer Solution of Large Sparse Posztwe Definite Systems. Prentme-Hall, Englewood Cliffs, N. J., 1981. Google Scholar
- 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.Google Scholar
- 19 HOOD, P. Frontal solution program for unsymmetric matrices. Int. J. Numcr Meth. Eng. 10 (1976), 379-400.Google Scholar
- 20 IRONS, B.M. A frontal solution program for finite element analysis. Int. J. Numer. Meth Eng. 2 (1970), 5-32Google Scholar
- 21 PETERS, F.J. Sparse matrices and substructures Mathematical Centre Tracts 119, Mathematisch Centrum, Amsterdam, The Netherlands, 1980.Google Scholar
- 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,Google Scholar
- 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.Google Scholar
- 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.Google Scholar
Index Terms
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
Recommendations
Accurate Symmetric Indefinite Linear Equation Solvers
The Bunch-Kaufman factorization is widely accepted as the algorithm of choice for the direct solution of symmetric indefinite linear equations; it is the algorithm employed in both LINPACK and LAPACK. It has also been adapted to sparse symmetric ...
Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
We describe the design of a new code for the solution of sparse indefinite symmetric linear systems of equations. The principal difference between this new code and earlier work lies in the exploitation of the additional sparsity available when the ...
Constraint Preconditioners for Symmetric Indefinite Matrices
We study the eigenvalue bounds of block two-by-two nonsingular and symmetric indefinite matrices whose $(1,1)$ block is symmetric positive definite and Schur complement with respect to its $(2,2)$ block is symmetric indefinite. A constraint ...
Comments