Skip to main content
Log in

Pivot selection and row ordering in givens reduction on sparse matrices

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Several strategies for pivot selection in Givens reduction to upper triangular form and for row ordering within major steps of the reduction are compared on the grounds of how well they preserve sparsity. Recommendations are made based principally on the results of runs on test problems. The use of Givens similarity transformations in reducing a sparse matrix to Hessenberg form is similarly examined and finally some conclusions are drawn as to the advisability of using Givens reduction methods on sparse systems.

Zusammenfassung

Es werden verschiedene Strategien für die Pivotwahl der Givens Reduktion zu einer oberen Dreiecksform und für die Reihenfolge der Zeilen innerhalb größerer Hauptschritte der Reduktion verglichen, um zu erfahren, wie weit sie die Schwachbesetztheit bewahren. Die Empfehlungen stützen sich hauptsächlich auf die Ergebnisse von Testbeispielen. Zum Schluß wurde auch ein Vergleich mit der Householder Methode durchgeführt, und einige Schlußfolgerungen daraus gezogen.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Curtis, A. R., Reid, J. K.: The solution of large sparse unsymmetric systems of linear equations. J. IMA8, 344–353 (1971).

    Google Scholar 

  2. Duff, I. S., Reid, J. K.: A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination. (To appear in J. IMA, 1974a.)

  3. Duff, I. S., Reid, J. K.: A comparison of some methods for the solution of sparse overdetermined systems of linear equations. (To appear in J. IMA. 1974b.)

  4. Duff, I. S., Reid, J. K.: On the reduction of sparse matrices to condensed forms by similarity transformations. (To appear in J. IMA, 1974c.)

  5. Gentleman, W. M.: Least squares computations by Givens transformations without square roots. J. IMA12, 329–336 (1973).

    Google Scholar 

  6. Golub, G. H.: Numerical methods for solving linear least squares problems. Num. Math.7, 206–216 (1965).

    Article  Google Scholar 

  7. Markowitz, H. M.: The elimination form of the inverse and its application to linear programming. Management Science3, 255–269 (1957).

    Google Scholar 

  8. Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Oxford University Press. 1965.

  9. Willoughby, R. A.: Sparse matrix algorithms and their relation to problem classes and computer architecture. In: Large Sparse Sets of Linear Equations (Reid, J. K., ed.). Academic Press 1971.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Duff, I.S. Pivot selection and row ordering in givens reduction on sparse matrices. Computing 13, 239–248 (1974). https://doi.org/10.1007/BF02241717

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02241717

Keywords

Navigation