A New Implementation of Sparse Gaussian Elimination

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A New Implementation of Sparse Gaussian Elimination

Full text

Pdf (1.05 MB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 8 , Issue 3 (September 1982) table of contents

Pages: 256 - 276

Year of Publication: 1982

ISSN:0098-3500

Author

Robert Schreiber

Department of Computer Science, Stanford University, Stanford, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 63, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/356004.356006 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BIRKHOFF, G, AND GEORGE, J.A Elimination by nested d,ssectlon In Complexity of Sequentml and Parallel Numertcal Algortthms, J. F. Traub (Ed), Academic, New York, 1973.
	2	DUFF, I.S. Full matmx techniques in sparse Gaussian ehminatmn. In Proc. Dundee Conf. on Numermal Analysis, Sprmger-Verlag, New York, 1981.
	3	EISENSTAT, S.C., GURSKY, M.C., SCHULTZ, M H., AND SHERMAN, A.H. Yale sparse matrix package I. The symmetric codes. Res. Rep. 112, Yale Computer Science Dep. Yale Univ., New Haven, Conn.
	4	EISENSTAT, S.C., SCHULTZ, M.H., AND SHERMAN, A.H. Software for sparse Gausslan elimination with limited core storage. In Sparse Matrix Proceedmgs, Iain S. Duff and G.W Stewart (Eds.), SIAM, 1978.
	5	GEORGE, A. Nested dmsechon of a regular finite element mesh. SIAM J. Numer Anal 10 (1973), 345-363
	6	GEORGE, A Numerical expemments using dissection methods to solve n by n grid problems. SIAM J Numer Anal. 14 (1977) 161-179.
	7	GEORGE, A, POOLE, W.G., AND VOIGT, R G. Analysis of dissection algorithms for vector computers Math Dep. Tech. Rep. 13, College of William and Mary, Williamsburg, Va, 1976.
	8	GEORGE, A., POOLE, W G, AND VOIGT, R G. Incomplete nested dissection for solving n by n grid problems. SIAM J. Numer Anal. 15 (1978), 662-673.
	9	GEORGE, A., AND Liu, J W H An automatic nested dissection algorithm for irregular fimte element problems. SIAM J Numer Anal 15 (1978), 1053-1069.
	10	GEORGE, A., AND LIU, J.W H. An optimal algorithm for symbohc factomzation of symmetrm matrices. Res Rep. CS-78-11, Faculty of Mathematics, Univ. Waterloo, Waterloo, Ont, Canada
	11	Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981
	12	GUSTAVSON, F.G. Some basic techmques for solving sparse systems of linear equations. In Sparse Matrices and Their Applwat~ons, D.j. Rose and R.A. Willoughby (Eds), Plenum, New York, 1972.
	13	LIPTON, R J, ROSE, D.J., AND TARJAN, R.E. Generahzed nested dissection. SIAM J Numer Anal. 16 (1979), 346-358.
	14	PETERS, F.J. Sparse Matrwes and Substructures" A Novel Implementation of F~n~te Element Algorithms. Mathematical Center Tracts MC 119, The Mathematical Center, 49, 2e Boerhaaverstratt, Amsterdam
	15	RosE, D J., TARJAN, R.E., AND LUEKER, G.S. Algorithm aspects of vertex ehminatmn on graphs SIAM J Comput 5 (1975), 266-283.
	16	Andrew Harry Sherman, On the efficient solution of sparse systems of linear and nonlinear equations., 1975

CITED BY 11

	Wen-Yang Lin, Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms, Applied Intelligence, v.23 n.3, p.257-265, December 2005
	Pontus Matstoms, Sparse QR factorization in MATLAB, ACM Transactions on Mathematical Software (TOMS), v.20 n.1, p.136-159, March 1994
	Wen-Yang Lin, Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization, The Journal of Supercomputing, v.24 n.3, p.259-277, March 2003
	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
	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
	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
	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
	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
	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
	Timothy A. Davis , William W. Hager, Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves, ACM Transactions on Mathematical Software (TOMS), v.35 n.4, p.1-23, February 2009
	Joseph W. H. Liu, A graph partitioning algorithm by node separators, ACM Transactions on Mathematical Software (TOMS), v.15 n.3, p.198-219, Sept. 1989