# Accession Number:

## AD0787854

# Title:

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

# Descriptive Note:

# Corporate Author:

## WASHINGTON STATE UNIV PULLMAN DEPT OF COMPUTER SCIENCE

# Personal Author(s):

# Report Date:

## 1974-01-01

# Pagination or Media Count:

## 32.0

# 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

# Descriptors:

# Subject Categories:

- Statistics and Probability
- Computer Programming and Software