© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Algorithm 830: Another Visit With Standard and Modified Givens Transformations and A Remark on Algorithm 539
Richard J. Hanson and Tim Hopkins
ACM Transactions on Mathematical Software, 30(1):182-196, March 2004.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.
[Note: DOI: http://doi.acm.org/10.1145/974781.974786]
Download publication 266 kbytes (PDF)
Bibtex Record
@article{1867, author = {Richard J. Hanson and Tim Hopkins}, title = {{Algorithm 830: Another Visit With Standard and Modified Givens Transformations and A Remark on Algorithm 539}}, month = {March}, year = {2004}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/2004/1867}, publication_type = {article}, submission_id = {24289_1081256130}, ISSN = {0098-3500}, journal = {ACM Transactions on Mathematical Software}, volume = {30}, number = {1}, publisher = {Association for Computing Machinery}, }