An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition

DOI10.1007/BF02142742zbMath0768.65015OpenAlexW1982143352MaRDI QIDQ1208058

Hongyuan Zha, Sabine Van Huffel

Publication date: 16 May 1993

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02142742

zbMATH Keywords

complexitysingular value decompositionparallel implementationtotal least squares problemsrank-revealing two-sided orthogonal decomposition

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05)

Related Items

On a basic multivariate EIV model with linear equality constraints ⋮ Perturbation theory for orthogonal projection methods with applications to least squares and total least squares ⋮ An algorithm and stability theory for downdating the ULV decomposition ⋮ A note on the scaled total least squares problem ⋮ Subspace Iteration Randomization and Singular Value Problems

Uses Software

• VanHuffel

Cites Work

• Unnamed Item
• Unnamed Item
• Rang revealing QR factorizations
• Rank and null space calculations using matrix decomposition without column interchanges
• An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
• The partial total least squares algorithm
• Adaptive Lanczos methods for recursive condition estimation
• The economical storage of plane rotations
• Updating URV decompositions in parallel
• A block QR algorithm and the singular value decomposition
• Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
• A Survey of Condition Number Estimation for Triangular Matrices
• Analysis and Solution of the Nongeneric Total Least Squares Problem
• Iterative speed improvement for solving slowly varying total least squares problems
• On the Implicit Deflation of Nearly Singular Systems of Linear Equations
• Structure-Preserving and Rank-Revealing QR-Factorizations
• On the Significance of Nongeneric Total Least Squares Problems
• Fast Adaptive Condition Estimation
• Some Applications of the Rank Revealing QR Factorization
• Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
• Updating a Rank-Revealing ULV Decomposition

This page was built for publication: An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition