Algorithm 830: Another visit with standard and modified givens transformations and a remark on algorithm 539

Authors:
Richard J. Hanson;Tim Hopkins
Affiliations:
Rice University, Houston, TX;University of Kent, Canterbury, Kent, UK
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2004

Citing 6
Cited 0

Fast Plane Rotations with Dynamic Scaling

SIAM Journal on Matrix Analysis and Applications
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Restructuring the BLAS level 1 routine for computing the modified givens transformation

ACM SIGNUM Newsletter
On Hyperbolic Triangularization: Stability and Pivoting

SIAM Journal on Matrix Analysis and Applications
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

First we report on a correction and improvement to the Level 1 BLAS routine srotmg for computing the Modified Givens Transformation (MG). We then, in the light of the performance of the code on modern compiler/hardware combinations, reconsider the strategy of supplying separate routines to compute and apply the transformation. Finally, we show that the apparent savings in multiplies obtained by using MG rather than the Standard Givens Transformation (SG) do not always translate into reductions in execution time.