Solving Toeplitz least squares problems by means of Newton's iteration

DOI10.1023/A:1025543417700zbMath1031.65059OpenAlexW1628239836MaRDI QIDQ1410453

Gianni Codevico, Dario Andrea Bini, Marc Van Barel

Publication date: 14 October 2003

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025543417700

zbMATH Keywords

numerical experimentsleast squaresgeneralized inverseToeplitz matricesimage restorationNewton's iterationapproximate displacement rankobject-oriented implementatin in C++

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Iterative numerical methods for linear systems (65F10) Packaged methods for numerical algorithms (65Y15)

Related Items (6)

The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices ⋮ Modified SMS method for computing outer inverses of Toeplitz matrices ⋮ Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse ⋮ Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration ⋮ Newton-like iteration based on a cubic polynomial for structured matrices ⋮ Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates

This page was built for publication: Solving Toeplitz least squares problems by means of Newton's iteration