Fred G. Gustavson
- 1 AHO, A V., HOPCROFT, J.E., AND ULLMAN, J D. The Destgn and Analysis of Computer Algortthms. Addison-Wesley, Reading, Mass., 1974, chap. 6. Google Scholar
- 2 CURTIS, A., AND REID, J The solution of large sparse unsymmetric systems of linear equations J. Inst. Math Appl 8 (1971), 344-353.Google Scholar
- 3 GEORGE, J.A. On block ehmmatlon for sparse linear systems. SIAM J. Numer. Anal. 11 (1974), 585-6O3.Google Scholar
- 4 GUSTAVSON, F G. Finding the block lower triangular form of a sparse matrix. In Sparse Matrix Computattons, J Bunch and D. Rose, Eds., Academic Press, New York, 1976, pp. 275-289Google Scholar
- 5 GUSTAVSON, F G Some basic techmques for solving sparse systems of linear equations. In Sparse Matrtces and Thew Apphcattons, D. Rose and R. Wdloughby, Eds., Plenum Press, New York, Jan 1973, pp. 67-76.Google Scholar
- 6 GUSTAVSON, F.G. Permuting matrices stored m sparse format. Disclosure No. 8-72-001, IBM Tech. D~sclosure Bull. 16, 1 (June 1973), 357-359Google Scholar
- 7 GUSTAVSON, F.G., AND YUN, D.Y Y. Arithmetic complexity of unordered sparse polynomials. Proc 1976 ACM Syrup on Symbohc and Algebraic Computation, R. Jenks, Ed., Yorktown Heights, N Y, Aug 1976, pp 149-153. Google Scholar
- 8 GUSTAVSON, F G. Some algorithms for sparse Gaussian elimination. To appear.Google Scholar
- 9 KNUTH, D.E. The Art of Computer Programmzng, Vol. 3. Sorting and Searching. Addison- Wesley, Reading, Mass., 1973, p. 78 Google Scholar
- 10 LORIN, H Sorting and Sort Systems. Addison-Wesley, Reading, Mass., 1975, p. 152.Google Scholar
- 11 MCNAMEE, J M Algorithm 408 A sparse matrix package. Comm ACM 14, 4 (April 1971), 265-273. Google Scholar
- 12 REID, J. Sparse matrices. Proc. IMA Conf on State-of-the-Art m Numer. Anal., York, April 1976, p6.Google Scholar
- 13 ROSE, D., AND TARJAN, R. Algorithmic aspects of vertex elimination on directed graphs. To appear in SIAM J. Computng.Google Scholar
- 14 SHERMAN, A. On the efficient solution of sparse systems of linear and nonlinear equations. Th., Yale U., New Haven, Conn., Dec. 1975. Google Scholar
- 15 STRASSEN, V. Gausslan ehmlnatlon is not optimal. Numer Math. 13 (1964), 354-356.Google Scholar
- 16 TINNEY, W., AND WALKER, J. Dtrect solutions of sparse network equations optimally ordered triangular factonzation Proc. IEEE 55, 11 (Nov. 1967), 1801-1809Google Scholar
- 17 WILLOUGHBY, R.A. Sparse matrix algorithms and their relation to problem classes and computer architecture. In Large Sparse Sets of L~near Equations, J. Reid, Ed., Academic Press, London and New York, pp. 255-277.Google Scholar
Index Terms
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
Recommendations
Fast sparse matrix multiplication
Let A and B two n×n matrices over a ring R (e.g., the reals or the integers) each containing at most m nonzero elements. We present a new algorithm that multiplies A and B using O(m0.7n1.2+n2+o(1)) algebraic operations (i.e., multiplications, additions ...
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
A two-phase preconditioning strategy based on a factored sparse approximate inverse is proposed for solving sparse indefinite matrices. In each phase, the strategy first makes the original matrix diagonally dominant to enhance the stability by a ...
Comments