Abstract
The general discussion of the orthogonalization methods (see Chapter 12) indicated that the Givens plane rotations are the most suitable method for handling large and sparse linear least squares problems. Two implementations of the Givens plane rotations for large and sparse linear least squares problems were discussed in the previous chapter. In the present chapter some pivotal strategies that can successfully be used with the second implementation will be described and compared. The same rule is used in the selection of pivotal columns in these pivotal strategies. The differences arise because the row interchanges are not the same.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zlatev, Z. (1991). Pivotal Strategies for Givens Plane Rotations. In: Computational Methods for General Sparse Matrices. Mathematics and Its Applications, vol 65. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1116-6_14
Download citation
DOI: https://doi.org/10.1007/978-94-017-1116-6_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4086-2
Online ISBN: 978-94-017-1116-6
eBook Packages: Springer Book Archive