1989Computers in PhysicsRequires access

A program for total (orthogonal) least squares in compact storage mode

Richard Branham

Open publisher page 7 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Total least squares, Least-squares function approximation, Fortran, Singular value decomposition, Matrix (chemical analysis), Mathematics, Non-linear least squares, Linear least squares

Related papers

Back to paper searchBrowse research topicsOriginal source
A program for total (orthogonal) least squares in compact storage mode — Research Paper | ScholarLens