Finding the Moore-Penrose inverse by a new matrix iteration

DOI10.1007/s12190-014-0759-4zbMath1325.65058OpenAlexW2000579467MaRDI QIDQ2354185

Masoud Rasouli, Fazlollah Soleymani, H. Salmani

Publication date: 10 July 2015

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-014-0759-4

zbMATH Keywords

complexityiterative methodMoore-Penrose inversematrix inversioninformation indexstarting valueSchulz iteration

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)

Related Items (7)

Modeling information diffusion in social networks with ordinary linear differential equations ⋮ A quartically convergent Jarratt-type method for nonlinear system of equations ⋮ Some matrix iterations for computing generalized inverses and balancing chemical equations ⋮ The iterative methods for \(A^{(2)}_{T,S}\) of the bounded linear operator between Banach spaces ⋮ An efficient method to compute the Moore-Penrose inverse ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ Hyperpower least squares progressive iterative approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• An efficient matrix iteration for computing weighted Moore-Penrose inverse
• Generalized inverses and sampling problems
• Chebyshev-type methods and preconditioning techniques
• A higher order iterative method for \(A^{(2)}_{T,S}\)
• A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
• An accelerated iterative method for computing weighted Moore-Penrose inverse
• Applications of the Moore-Penrose inverse in digital image restoration
• Newton-like iteration based on a cubic polynomial for structured matrices
• Generalized inverses. Theory and applications.
• A family of iterative methods for computing Moore-Penrose inverse of a matrix
• A class of numerical algorithms for computing outer inverses
• A note on the stability of a \(p\)th order iteration for finding generalized inverses
• The generalized weighted Moore-Penrose inverse
• Successive matrix squaring algorithm for computing outer inverses
• Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
• ON A FAST ITERATIVE METHOD FOR APPROXIMATE INVERSE OF MATRICES
• Application of the pseudoinverse computation in reconstruction of blurred images
• On finding robust approximate inverses for large sparse matrices
• An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
• The Moore of the Moore-Penrose inverse
• Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
• On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
• The Mathematica GuideBook for Numerics

This page was built for publication: Finding the Moore-Penrose inverse by a new matrix iteration