An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
type: Item
instance of: scholarly article
title: An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
zbMATH Open document ID: 0768.65015
DOI: 10.1007/BF02142742
author: Sabine Van Huffel
author: Hongyuan Zha
published in: Numerical Algorithms
publication date: 1993-05-16T00:00:00Z
review text: A ``rank-revealing two-sided orthogonal decomposition'' decomposes a matrix into a product of a unitary matrix, a triangular matrix, and another unitary matrix in such a way that one can see the numerical rank of the matrix. The authors study such decompositions and base a new algorithm for total least-squares problems (also multidimensional and non-generic ones) on it. They carefully consider a parallel implementation of their method and compare its complexity to other total least squares algorithms.
reviewed by: Heinz W. Engl
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 165780
zbMATH Keywords: singular value decomposition
zbMATH Keywords: rank-revealing two-sided orthogonal decomposition
zbMATH Keywords: total least squares problems
zbMATH Keywords: parallel implementation
zbMATH Keywords: complexity
describes a project that uses: VanHuffel
MaRDI profile type: Publication
cites work: Structure-Preserving and Rank-Revealing QR-Factorizations
cites work: Rang revealing QR factorizations
cites work: Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
cites work: Some Applications of the Rank Revealing QR Factorization
cites work: Adaptive Lanczos methods for recursive condition estimation
cites work: Rank and null space calculations using matrix decomposition without column interchanges
cites work: Q3359644
cites work: A Survey of Condition Number Estimation for Triangular Matrices
cites work: Fast Adaptive Condition Estimation
cites work: Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
cites work: The economical storage of plane rotations
cites work: On the Implicit Deflation of Nearly Singular Systems of Linear Equations
cites work: A block QR algorithm and the singular value decomposition
cites work: Updating a Rank-Revealing ULV Decomposition
cites work: Updating URV decompositions in parallel
cites work: On the Significance of Nongeneric Total Least Squares Problems
cites work: The partial total least squares algorithm
cites work: Analysis and Solution of the Nongeneric Total Least Squares Problem
cites work: Iterative speed improvement for solving slowly varying total least squares problems
cites work: Q4001897
cites work: An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
full work available at URL: https://doi.org/10.1007/bf02142742
OpenAlex ID: W1982143352
Recommended article: Q4353196
Recommended article: The application of rank revealing two-sided orthogonal decompositions
Recommended article: Accurate solution of structured least squares problems via rank-revealing decompositions
Recommended article: Orthogonal Low Rank Tensor Approximation: Alternating Least Squares Method and Its Global Convergence
Recommended article: Efficient Solution Of The Rank-Deficient Linear Least Squares Problem
Recommended article: Efficient Algorithms for Solution of Regularized Total Least Squares
Recommended article: Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
Recommended article: Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
Recommended article: Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
description: scientific article; zbMATH DE number 165780