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

DOI10.1023/A:1025543417700zbMath1031.65059MaRDI 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 experiments; least squares; generalized inverse; Toeplitz matrices; image restoration; Newton's iteration; approximate displacement rank; object-oriented implementatin in C++

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

65F10: Iterative numerical methods for linear systems

65Y15: Packaged methods for numerical algorithms

Related Items

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