Least Squares Computations with Two Algorithms for the Two-Multiply, Two-Add Givens Rotation,

Abstract

Two numerically stable algorithms for implementation of the two-multiply, two-add Givens transformation are discussed. An application of the use of these algorithms is given for the problem of accumulating and deleting rows of data from a least squares problem in a stable manner. The construction of the transformation requires essentially the same amount of work. The first method (which is not due to the author) requires no square roots but may require rescaling to avoid underflow and overflow. The second method requires one square root per transformation but will need rescaling less than half as often as the first method. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1974
Accession Number
AD0787854

Entities

People

  • Richard J. Hanson

Organizations

  • Washington State University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Construction
  • Mathematical Analysis
  • Mathematics
  • Rotation
  • Square Roots

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Traumatic Brain Injury (TBI) and Cognitive Aging in the Guam and Border Populations Affected by Alzheimer's Disease and Tau-Associated Dementias.
  • Wave Propagation and Nonlinear Chaotic Dynamics.