The partial total least squares algorithm
From MaRDI portal
Publication:1098234
DOI10.1016/0377-0427(88)90317-2zbMath0636.65035OpenAlexW1979541162MaRDI QIDQ1098234
Sabine Van Huffel, Joos Vandewalle
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90317-2
Related Items
About existence and uniqueness of the restricted total least squares estimation, Multivariate orthogonal regression in astronomy, Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation, Partial singular value decomposition algorithm, Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values, Algebraic relations between the total least squares and least squares problems with more than one solution, An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition, Partial total least squares algorithm
Uses Software
Cites Work
- 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
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Singular value decomposition and least squares solutions
- An Improved Algorithm for Computing the Singular Value Decomposition
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Unnamed Item
- Unnamed Item
