Keywords
- Sparse Linear System
- Triangular Decomposition
- Augmented Matrix
- Paging Strategy
- Familiar Process
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your 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
Gentleman, W. M., “Least Squares Computations by Givens Transformations Without Square Roots”, JIMA, 12 (1973), pp. 329–336.
Gentleman, W. M., “Error Analysis of QR Decomposition by Givens Transformations”, Linear Algebra and its Applications, to appear.
Hammarling, S., “A Note on Modifications to the Givens Plane Rotation”, JIMA 13, (1974), No.2, pp. 215–218.
Lawson, C. L. and Hanson, R. J., “Solving Least Squares Problems”, Prentice-Hall, 1974.
Modern Computing Methods, Notes on Applied Science, No. 16, National Physical Laboratory, London 1961.
Rogers, L. D., “Optimal Paging Strategies and Stability Considerations for Solving Large Linear Systems”, Ph.D. Thesis, University of Waterloo, 1973.
Wilkinson, J. H., “The Algebraic Eigenvalue Problem,” London, Oxford University Press, 1965.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Gentleman, W.M. (1976). Row elimination for solving sparse linear systems and least squares problems. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080119
Download citation
DOI: https://doi.org/10.1007/BFb0080119
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07610-0
Online ISBN: 978-3-540-38129-7
eBook Packages: Springer Book Archive
