Hyper-power methods for the computation of outer inverses
From MaRDI portal
Publication:475650
DOI10.1016/j.cam.2014.09.024zbMath1304.65135OpenAlexW2035381949MaRDI QIDQ475650
Marko D. Petković, Miodrag 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
convergencenumerical resultsHorner schemeDrazin inverseiterative methodsMoore-Penrose inverseouter inversehyper-power methodsSchultz' method
Related Items (14)
Exploiting higher computational efficiency index for computing outer generalized inverses ⋮ A two-step iterative method and its acceleration for outer inverses ⋮ An efficient matrix iteration family for finding the generalized outer inverse ⋮ A fast computational algorithm for computing outer pseudo-inverses with numerical experiments ⋮ Existence and Representations of Solutions to Some Constrained Systems of Matrix Equations ⋮ Computing outer inverses by scaled matrix iterations ⋮ 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 ⋮ Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices ⋮ On hyperpower family of iterations for computing outer inverses possessing high efficiencies ⋮ An efficient computation of generalized inverse of a matrix ⋮ Factorizations of hyperpower family of iterative methods via least squares approach ⋮ Rapid 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)}\) ⋮ Hyperpower least squares progressive iterative approximation
Uses Software
Cites Work
- Unnamed Item
- 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
- Generalised matrix inversion and rank computation by successive matrix powering
- Successive matrix squaring algorithm for computing the Drazin inverse
- Generalized inverses. Theory and applications.
- Gauss-Jordan elimination method for computing outer inverses
- Generalized Schultz iterative methods for the computation of outer inverses
- Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application
- Successive matrix squaring algorithm for computing outer inverses
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
This page was built for publication: Hyper-power methods for the computation of outer inverses