Hyper-power methods for the computation of outer inverses
From MaRDI portal
Publication:475650
DOI10.1016/J.CAM.2014.09.024zbMATH Open1304.65135OpenAlexW2035381949MaRDI QIDQ475650FDOQ475650
Marko D. Petković, M. S. Petković
Publication date: 27 November 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.09.024
Recommendations
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- Exploiting higher computational efficiency index for computing outer generalized inverses
- Generalized Schultz iterative methods for the computation of outer inverses
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- An efficient computation of generalized inverse of a matrix
convergencenumerical resultsiterative methodsMoore-Penrose inverseDrazin inverseouter inverseHorner schemehyper-power methodsSchultz' method
Cites Work
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application
- Successive matrix squaring algorithm for computing outer inverses
- Gauss-Jordan elimination method for computing outer inverses
- Generalised matrix inversion and rank computation by successive matrix powering
- Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- An improved method for the computation of the Moore-Penrose inverse matrix
- Successive matrix squaring algorithm for computing the Drazin inverse
- Generalized Schultz iterative methods for the computation of outer inverses
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
Cited In (16)
- Hyperpower least squares progressive iterative approximation
- GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications
- Factorizations of hyperpower family of iterative methods via least squares approach
- Exploiting higher computational efficiency index for computing outer generalized inverses
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- Rapid generalized Schultz iterative methods for the computation of outer inverses
- Title not available (Why is that?)
- The hyperpower iteration revisited
- Computing outer inverses by scaled matrix iterations
- An efficient matrix iteration family for finding the generalized outer inverse
- A two-step iterative method and its acceleration for outer inverses
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- Existence and Representations of Solutions to Some Constrained Systems of Matrix Equations
- An efficient computation of generalized inverse of a matrix
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
Uses Software
This page was built for publication: Hyper-power methods for the computation of outer inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475650)
