Partial total least squares algorithm
The paper contains a detailed description of a subroutine, PTLS (partial total least squares), for the total least squares (TLS) solution of the overdetermined system of linear equations \(AX=B\) by using a partial singular value decomposition. It is claimed that the computational efficiency is improved by a factor of about two over the classical TLS algorithm. The computational improvement of PTLS is based on the observation that the TLS solution can be computed from any orthogonal basis of the right singular subspace corresponding to the smallest singular values of the augmented matrix [A;B]. The routine PTLS can accommodate more than one vector in B. It can also be used to solve determined and underdetermined sets of equations by computing the minimum norm solution.
- The partial total least squares algorithm
- scientific article; zbMATH DE number 1058086
- The extended classical total least squares algorithm
- scientific article; zbMATH DE number 51511
- Analysis and Properties of the Generalized Total Least Squares Problem $AX \approx B$ When Some or All Columns in A are Subject to Error
- An Analysis of the Total Least Squares Problem
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- An Improved Algorithm for Computing the Singular Value Decomposition
- Analysis and Solution of the Nongeneric Total Least Squares Problem
- Basic Linear Algebra Subprograms for Fortran Usage
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- The partial total least squares algorithm
This page was built for publication: Partial total least squares algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751180)