Total (orthogonal) least squares considers the least‐squares problem when data errors occur in both the vector of the right‐hand side and in the matrix of the equations of condition. A total least‐squares solution may be calculated by use of the singular value decomposition (SVD), but this is computationally much more demanding than use of the normal equations and requires more memory, particularly when there are many more equations than unknowns. A FORTRAN program is given to calculate a total least‐squares solution from normal equations stored in compact mode; only the upper triangular part of the matrix is stored. If the total least‐squares solution does not exist, the program calculates an ordinary least‐squares solution. Two examples illustrating use of the program are presented.
Skip Nav Destination
Article navigation
Research Article|
May 01 1989
A program for total (orthogonal) least squares in compact storage mode
Richard L. Branham, Jr.
Richard L. Branham, Jr.
Centro Regional de Investigaciones Cientif ícas y Tecnológicas, Casilla de Correo 131, 5500 Mendoza, Argentina
Search for other works by this author on:
Comput. Phys. 3, 42–46 (1989)
Article history
Received:
July 21 1988
Accepted:
December 12 1988
Citation
Richard L. Branham; A program for total (orthogonal) least squares in compact storage mode. Comput. Phys. 1 May 1989; 3 (3): 42–46. https://doi.org/10.1063/1.168322
Download citation file: