Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
The aim of this paper is to present an algorithm to compute the Moore-Penrose inverse of a rank-deficient Toeplitz matrix. The algorithm is based on Newton's iteration and the concept of \(\varepsilon\)-displacement rank. A simple residual error bound is derived. The bound contains the errors due to Newton's iteration and the errors in the approximation of the displacement representation of the Moore-Penrose inverse. Finally, numerical experiments involving matrices of order up to 32768 are reported, illustrating the convergence of the algorithm.
- Solving Toeplitz least squares problems by means of Newton's iteration
- scientific article; zbMATH DE number 5127891
- Newton-like iteration based on a cubic polynomial for structured matrices
- An improved Newton iteration for the weighted Moore-Penrose inverse
- Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates
- Algebraic methods for Toeplitz-like matrices and operators
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Approximate displacement rank and applications
- Displacement Structure: Theory and Applications
- scientific article; zbMATH DE number 3477343 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Recurrent neural networks for computing weighted Moore-Penrose inverse
- Solving Toeplitz least squares problems by means of Newton's iteration
- Structured matrices and Newton's iteration: unified approach
- Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\)
- Weighted Tikhonov filter matrices for ill-posed problems.
- Newton's iteration for inversion of Cauchy-like and other structured matrices
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
- Newton-like iteration based on a cubic polynomial for structured matrices
- Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion
- Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications
- Enclosing Moore-Penrose inverses
- An improved Newton iteration for the weighted Moore-Penrose inverse
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices
- scientific article; zbMATH DE number 5127891 (Why is no real title available?)
- Modified SMS method for computing outer inverses of Toeplitz matrices
- Computing Moore–Penrose Inverses with Polynomials in Matrices
- Displacement structure of the core inverse
- Representations of the Moore-Penrose inverse for a class of 2-by-2 block operator valued partial matrices
- Application of the partitioning method to specific Toeplitz matrices
- Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse
- Improved recurrent neural networks for online solution of Moore-Penrose inverse applied to redundant manipulator kinematic control
- Explicit group inverse of an innovative patterned matrix
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- Interval iterative methods for computing Moore-Penrose inverse
This page was built for publication: Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764965)
