Title: Partial total least-squares algorithm (Algorithm 33)
Authors: Van Huffel, Sabine # ×
Issue Date: 1990
Publisher: Elsevier science bv
Series Title: Journal of computational and applied mathematics vol:33 issue:1 pages:113-121
Abstract: The Partial Total Least Squares (PTLS) subroutine solves the Total Least Squares (TLS) problem AX almost-equal-to B by using a Partial Singular Value Decomposition (PSVD), hereby improving the computational efficiency of the classical TLS algorithm (a factor 2 approximately). 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 dimension of this subspace may be determined by the rank of the TLS approximation of [A;B] or depend on a given upper bound (e.g. a perturbation level) for those smallest singular values. The routine PTLS allows more than one vector in B. It is also solves determined and underdetermined sets of equations by computing the minimum norm solution.
Description: \emph{Journal of Computational and Applied Mathematics}, vol. 33, 1990
ISSN: 0377-0427
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science