Fast computing of the Moore-Penrose inverse matrix
DOI10.13001/1081-3810.1287zbMATH Open1176.65048OpenAlexW2096202120MaRDI QIDQ3394486FDOQ3394486
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- An improved method for the computation of the Moore-Penrose inverse matrix
- On the Moore-Penrose generalized inverse matrix
- scientific article; zbMATH DE number 633404
- A computing method for the Moore-Penrose inverse of some special matrices
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cited In (21)
- Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates
- An improved method for the computation of the Moore-Penrose inverse matrix
- Computing the Moore-Penrose inverse using its error bounds
- Title not available (Why is that?)
- Digital image reconstruction in the spectral domain utilizing the Moore-Penrose inverse
- Fast calculation of Laurent expansions for matrix inverses
- Applications of the Moore-Penrose inverse in digital image restoration
- Application of the partitioning method to specific Toeplitz matrices
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- A computing method for the Moore-Penrose inverse of some special matrices
- Existence of solutions to fractional boundary value problems at resonance in Hilbert spaces
- Title not available (Why is that?)
- On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation
- Convergence of Rump’s method for computing the Moore-Penrose inverse
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
- Full rank decomposition and Moore-Penrose inverses of completely symmetric matrices
- A fast algorithm of Moore-Penrose inverse for the Loewner-type matrix
- A Novel Iterative Method for Computing Generalized Inverse
- Title not available (Why is that?)
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
This page was built for publication: Fast computing of the Moore-Penrose inverse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394486)
