Efficient Algorithms for Solution of Regularized Total Least Squares

Error-contaminated systems $Ax \approx b$, for which A is ill-conditioned, are considered. Such systems may be solved using Tikhonov-like regularized total least squares (RTLS) methods. Golub, Hansen, and O'Leary [SIAM J. Matrix Anal. Appl., 21 (1999), pp. 185--194] presented a parameter-depend...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on matrix analysis and applications Ročník 26; číslo 2; s. 457 - 476
Hlavní autoři: Renaut, Rosemary A., Guo, Hongbin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2004
Témata:
Algebra
Algorithms
Alzheimer's disease
Eigenvalues
Exact sciences and technology
Linear and multilinear algebra, matrix theory
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Sciences and techniques of general use
Rayleigh quotient
Lagrangian
Error estimation
total least squares
Error in variable
ill-posedness
Iterative method
Iteration
Modeling
Search algorithm
Numerical analysis
Least squares method
65F30
Linear algebra
Rayleigh quotient iteration 65F22
Ill posed problem
Eigenvalue problem
Quotient
Regularization
Algorithm analysis
Numerical convergence
ISSN:0895-4798, 1095-7162
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Error-contaminated systems $Ax \approx b$, for which A is ill-conditioned, are considered. Such systems may be solved using Tikhonov-like regularized total least squares (RTLS) methods. Golub, Hansen, and O'Leary [SIAM J. Matrix Anal. Appl., 21 (1999), pp. 185--194] presented a parameter-dependent direct algorithm for the solution of the augmented Lagrange formulation for the RTLS problem, and Sima, Van Huffel, and Golub [Regularized Total Least Squares Based on Quadratic Eigenvalue Problem Solvers, Tech. Report SCCM-03-03, SCCM, Stanford University, Stanford, CA, 2003] have introduced a technique for solution based on a quadratic eigenvalue problem, RTLSQEP. Guo and Renaut [A regularized total least squares algorithm, in Total Least Squares and Errors-in-Variables Modeling: Analysis, Algorithms and Applications, S. Van Huffel and P. Lemmerling, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002, pp. 57--66] derived an eigenproblem for the RTLS which can be solved using the iterative inverse power method. Here we present an alternative derivation of the eigenproblem for constrained TLS through the augmented Lagrangian for the constrained normalized residual. This extends the analysis of the eigenproblem and leads to derivation of more efficient algorithms compared to the original formulation. Additional algorithms based on bisection search and a standard L-curve approach are presented. These algorithms vary with respect to the parameters that need to be prescribed. Numerical and convergence results supporting the different versions and contrasting with RTLSQEP are presented.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0895-4798
1095-7162
DOI:10.1137/S0895479802419889