Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations

Full text

Pdf (1.37 MB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 1 (January 1970) table of contents

Pages: 87 - 109

Year of Publication: 1970

ISSN:0004-5411

Authors

F. G. Gustavson	IBM Thomas J. Watson Research Center, Yorktown Heights, New York
W. Liniger	IBM Thomas J. Watson Research Center, Yorktown Heights, New York
R. Willoughby	IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 44, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/321556.321565 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	JENNINGS, A. A compact storage scheme for the solution of symmetric linear simultaneous equations. Comput. J. 9 (1966), 281-285.
	2	TEWARSON, R. P. The product form of inverses of sparse matrices and graph theory. SIAM Rev. 9(1967), 91-99.
	3	SATO, N., AND TINNEY, W.F. Techniques for exploiting the sparsity of the network admittance matrix. IEEE Trans. on Power Apparatus and Systems 82(1963), 944 950.
	4	MARKOWITZ, H.M. The elimination form of the inverse and its application to linear programming. Manage. Sci. 3(1957), 255-239.
	5	FORD, L. R., AND FULKERSON, D.R. Flows in Networks. Princeton U. Press, Princeton, N. J., 1962.
	6	DICKSON, J. C. Finding permutation operations to produce a large triangular submatrix. Presented at the 28th Nat. Meeting of the Operations Research Society of America, Houston, Texas, 1965.
	7	ALWAY, G. G., AND MARTIN, D.W. An algorithm for reducing the band-width of a symmetrical configuration. Comput. J. 8(1965), 264-272.
	8	HERSHDORFER, A. M., RAAB, A. R., AND STURMAN, G.M. On the efficient inversion of large structured matrices. Proc. Engineering Mechanics Division Specialty Conf., ASCE, Washington, D.C., Oct. 1966, pp. 651-666.
	9	BOWDLER, H. J., MARTIN, R. S., PETERS, G., AND WILKINSON, J .H . Solution of real and complex systems of linear equations. Num. Math. 8(1966), 217-234.
	10	VARGA, R. S. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N. J., 1962.
	11	HAIBT, L. H. Private communication.

CITED BY 2

	Jeremiah Willcock , Andrew Lumsdaine, Accelerating sparse matrix computations via data compression, Proceedings of the 20th annual international conference on Supercomputing, June 28-July 01, 2006, Cairns, Queensland, Australia
	Hironori Kasahara , Hiroki Honda , Seinosuke Narita, Parallel processing of near fine grain tasks using static scheduling on OSCAR (Optimally Scheduled Advanced Multiprocessor), Proceedings of the 1990 ACM/IEEE conference on Supercomputing, p.856-864, November 12-16, 1990, New York, New York