An efficient matrix iteration family for finding the generalized outer inverse
From MaRDI portal
Publication:2148067
DOI10.1016/j.amc.2022.127292OpenAlexW4281740669WikidataQ114210836 ScholiaQ114210836MaRDI QIDQ2148067
Sanjeev Kumar, Manpreet Kaur, Munish Kansal
Publication date: 21 June 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127292
rate of convergencerectangular matricesmatrix multiplicationsSchulz-type methodgeneralized outer inverse
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neural network approach to computing outer inverses based on the full rank representation
- Hyper-power methods for the computation of outer inverses
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- An efficient matrix iteration for computing weighted Moore-Penrose inverse
- A rapid numerical algorithm to compute matrix inversion
- Chebyshev-type methods and preconditioning techniques
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- Conditions for existence, representations, and computation of matrix generalized inverses
- Some matrix iterations for computing generalized inverses and balancing chemical equations
- An efficient computation of generalized inverse of a matrix
- Generalized inverses: theory and computations
- Newton-like iteration based on a cubic polynomial for structured matrices
- Generalized inverses. Theory and applications.
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Computation of outer inverses of tensors using the QR decomposition
- A class of numerical algorithms for computing outer inverses
- Computing the Moore-Penrose inverse using its error bounds
- Generalized Schultz iterative methods for the computation of outer inverses
- Successive matrix squaring algorithm for computing outer inverses
- On finding robust approximate inverses for large sparse matrices
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Optimized mean based second derivative-free families of Chebyshev–Halley type methods
- A geometrical approach on generalized inverses by Neumann-type series
This page was built for publication: An efficient matrix iteration family for finding the generalized outer inverse