A program for total (orthogonal) least squares in compact storage mode
Richard Branham
Abstract
Richard Branham
Abstract
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.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Total least squares, Least-squares function approximation, Fortran, Singular value decomposition, Matrix (chemical analysis), Mathematics, Non-linear least squares, Linear least squares