Full matrix techniques in sparse Gaussian elimination

  • Iain S. Duff
Conference paper

DOI: 10.1007/BFb0093150

Part of the Lecture Notes in Mathematics book series (LNM, volume 912)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Iain S. Duff

There are no affiliations available

Personalised recommendations