A total least squares method for Toeplitz systems of equations (Q1272882): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained total least squares technique and its applications to harmonic superresolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QR factorization of Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of Methods for Solving Toeplitz Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The circulant operator in the Banach algebra of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant Preconditioned Toeplitz Least Squares Iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Methods for Toeplitz Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Circulant Preconditioner for Toeplitz Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for QR and Triangular Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Toeplitz Orthogonalization Using Inner Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization by Truncated Total Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank revealing \(UTV\) decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Modification of LDL T Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Modifying Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability analysis and fast algorithms for triangulation of Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Toeplitz orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence criteria for iterative restoration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Superoptimal Circulant Preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001758 / rank
 
Normal rank

Latest revision as of 16:34, 28 May 2024

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
    0 references
    0 references
    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
    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

    Identifiers