| Some Design Features of a Sparse Matrix Code |
| Full text |
Pdf
(1.21 MB)
|
| Source
|
ACM Transactions on Mathematical Software (TOMS)
archive
Volume 5 , Issue 1 (March 1979)
table of contents
Pages: 18 - 35
Year of Publication: 1979
ISSN:0098-3500
|
|
Authors
|
|
I. S. Duff
|
Computer Science and Systems Division, Building 8.9, AERE Harewell, Oxfordshire, OX11 ORA, England
|
|
J. K. Reid
|
Computer Science and Systems Division, Building 8.9, AERE Harewell, Oxfordshire, OX11 ORA, England
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 43, Citation Count: 9
|
|
|
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
|
CURTIS, A.R., AND REID, J.K. Fortran subroutines for the solution of sparse sets of linear equations AERE Rep. R.6844, HMSO, London, 1971
|
| |
2
|
CURTXS, A.R., AND REID, J.K. The solution of large sparse unsymmetric systems of linear equations J Inst. Math. Appl. 8 (1971), 118-124
|
| |
3
|
DUFF, I.S. MA28. A set of Fortran subroutines for sparse unsymmetrlc hnear equations. AERE Rep. R.8730, HMSO, London, 1977.
|
| |
4
|
DUFF, I.S. On algorithms for obtaining a maximum transversal. AERE Rep. CSS 49, 1978
|
| |
5
|
DUFF, I.S, AND REID, J.K. A comparmon of sparslty orderings for obtaining a pivotal sequence m Gaussian elnmnatlon. J. Inst. Math. Appl 14 (1974), 281-291.
|
 |
6
|
|
| |
7
|
ERISMAN, A.M. Decomposition methods using sparse matrix techniques with apphcation to certain electrial network problems. In Decomposttton of Large-Scale Problems, D.M. Himmelblau, Ed., North-Holland, Amsterdam, 1973.
|
| |
8
|
ERISMAN, A.M., AND REID, J.K Monitoring the stability of the tmangular factorizahon of a sparse matrLx. Numer. Math. 22 (1974), 183-186.
|
| |
9
|
HALL, M. An algorithm for distract representatives. Amer Math. Monthly 63 (1956), 716-717.
|
| |
10
|
|
| |
11
|
MARKOWIT2, H M The ehmmatlon form of the inverse and its application to linear programming. Management Sct 3 (1957), 255-269
|
| |
12
|
PETERS, G, AND WILKINSON, J.H. The least squares problem and pseudo-inverses. Comput J 13 {1970), 309-316.
|
| |
13
|
RYDER, B G The PFORT verifier. Software Practtce and Expertence 4 (1974), 359-377
|
| |
14
|
TARJAN, R. Depth first search and linear graph algorithms SIAM J. Comput. 1 (1972), 146-160.
|
| |
15
|
ZLATEV, Z., AND BARKER, V A Logical procedure SSLEST" An Algol W procedure for solving sparse systems of hnear equations. Rep. NI-76-13, Inst for Numerical Analysis, Technical U. of Denmark, 1976
|
| |
16
|
ZLATEV, Z, AND THOMSEN, P G. ST A Fortran IV subroutine for the solution of large systems of hnear algebram equaUons w~th real coefficients by use of sparse techniques. Rep. NI-76-05, Inst. for Numermal Analysis, Techmcal U. of Denmark, 1976
|
|