Not checkedNot checked for notices yet.
Global convergence of RTLSQEP: A solver of regularized total least squares problems via quadratic eigenproblems
Jörg Lampe, Heinrich Voss
Mathematical Modelling and Analysis · 2008
doi:10.3846/1392-6292.2008.13.55-66 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The total least squares (TLS) method is a successful approach for linear problems if both the matrix and the right hand side are contaminated by some noise. In a recent paper Sima, Van Huffel and Golub suggested an iterative method for solving regularized TLS problems, where in each iteration step a quadratic eigenproblem has to be solved. In this paper we prove its global convergence, and we present an efficient implementation using an iterative projection method with thick updates.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.