Abstract
We discuss ways in which code for Gaussian elimination on full systems can be used in crucial parts of the code for the solution of sparse linear equations. We indicate the benefits of using full matrix techniques in the later stages of Gaussian elimination and describe frontal and multi-frontal schemes where such benefits are obtained automatically. We also illustrate the advantages of such approaches when running sparse codes on vector machines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cliffe, K.A., Jackson, C.P., Rae, J. and Winters, K.H. (1978). Finite element flow modelling using velocity and pressure variables. Harwell Report, AERE R. 9202.
Du Croz, J.J., Nugent, S.M., Reid, J.K. and Taylor, D.B. (1978). Solving large full sets of linear equations in a paged virtual store. Harwell Report, CSS 68. To appear in TOMS.
Duff, I.S. (1977). MA28—a set of Fortran subroutines for sparse unsymmetric linear equations. Harwell Report, AERE R. 8730. HMSO, London.
Duff, I.S. (1981a). MA32—a package for solving sparse unsymmetric systems using the frontal method. Harwell Report, AERE R. 10079 HMSO, London.
Duff, I.S. (1981b). The design and use of a frontal scheme for solving sparse unsymmetric equations. To appear in Proceedings of 3rd Workshop on Numerical Analysis. Cocoyoc, Mexico. Lecture Notes in Mathematics, Sprigner.
Duff, I.S. (1981c). A sparse future. pp. 1–29 in Sparse Matrices and their Uses. I.S. Duff (Ed.). Academic Press.
Duff, I.S. and Reid, J.K. (1979). Performance evaluation of codes for sparse matrix problems. pp. 121–135. in Performance Evaluation of Numerical Software. L. Fosdick (Ed.). North Holland.
Duff, I.S. and Reid, J.K. (1981a). MA27—a set of Fortran subroutines for the solution of sparse symmetric linear equations. To appear as an AERE R report.
Duff, I.S. and Reid, J.K. (1981b). Experience of sparse matrix codes on the CRAY-1. Invited paper at Conference on Vector and Parallel Processors in Computational Science. Chester. August 1981.
Eisenstat, S.C., Gursky, M.C., Schultz, M.H. and Sherman, A.H. (1977). Yale sparse matrix package. I. The Symmetric Codes. Dept. Computer Science, Yale University Report #112.
George, A., Liu, J.W.H. and Ng, E. (1980). User Guide for SPARSPAK: Waterloo Sparse Linear Equations Package. Comput. Sci. Report CS-78-30, Waterloo, Canada.
George, A. and Liu, J.W.H. (1981). Computer solution of large sparse positive definite systems. Prentice-Hall.
Hood, P. (1976). Frontal solution program for unsymmetric matrices. Int. J. Numer. Meth. Engng. 10, pp. 379–399.
IBM (1976). IBM System/360 and System/370 IBM 1130 and IBM 1800 Subroutine Library—Mathematics. User's Guide. Program Product 5736-XM7. IBM catalogue #SH12-5300-1.
Irons, B.M. (1970). A frontal solution program for finite element analysis. Int. J. Numer. Meth. Engn. 2, pp. 5–32.
Munksgaard, N. (1980). Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. TOMS 6, pp. 206–219.
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Duff, I.S. (1982). Full matrix techniques in sparse Gaussian elimination. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093150
Download citation
DOI: https://doi.org/10.1007/BFb0093150
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11199-3
Online ISBN: 978-3-540-39009-1
eBook Packages: Springer Book Archive