Fast computing of the Moore-Penrose inverse matrix

DOI10.13001/1081-3810.1287zbMath1176.65048OpenAlexW2096202120MaRDI QIDQ3394486

Dimitrios Pappas, Vasilios N. Katsikis

Publication date: 7 September 2009

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117635

zbMATH Keywords

reverse order lawMoore-Penrose inverse matrixtensor-product matrix

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Related Items (14)

Existence of solutions to fractional boundary value problems at resonance in Hilbert spaces ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices ⋮ A Novel Iterative Method for Computing Generalized Inverse ⋮ Improved Qrginv algorithm for computing Moore-Penrose inverse matrices ⋮ Effective implementation to reduce execution time of a low-rank matrix approximation problem ⋮ Application of the partitioning method to specific Toeplitz matrices ⋮ An improved method for the computation of the Moore-Penrose inverse matrix ⋮ Digital image reconstruction in the spectral domain utilizing the Moore-Penrose inverse ⋮ Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates ⋮ Computing the Moore-Penrose inverse using its error bounds ⋮ On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation ⋮ Convergence of Rump’s method for computing the Moore-Penrose inverse ⋮ Applications of the Moore-Penrose inverse in digital image restoration

This page was built for publication: Fast computing of the Moore-Penrose inverse matrix