A total least squares method for Toeplitz systems of equations (Q1272882)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A total least squares method for Toeplitz systems of equations |
scientific article |
Statements
A total least squares method for Toeplitz systems of equations (English)
0 references
17 August 1999
0 references
The Newton method is used to solve the total least squares (TLS) problem for Toeplitz systems (a Toeplitz matrix has constant entries on each diagonal). TLS differs from the usual \(\text{LS} (Tf\approx g)\) in that both \(T\) and \(g\) are corrupted by errors. The Newton method requires the solution of a linear system and the authors present a preconditioned conjugate gradient method for this; either \(LDL^T\) factorization, or a circulant approximation, are suggested for the preconditioner. When Newton's method is coupled with a bisection scheme, it is shown that global convergence can be guaranteed. The paper concludes with some numerical tests comparing results of three variants of the basic scheme.
0 references
total least squares method
0 references
Newton method
0 references
Toeplitz systems
0 references
preconditioned conjugate gradient method
0 references
global convergence
0 references
numerical tests
0 references
0 references