Exploiting higher computational efficiency index for computing outer generalized inverses
DOI10.1016/J.APNUM.2022.01.017zbMATH Open1484.65071OpenAlexW4210662902WikidataQ128340001 ScholiaQ128340001MaRDI QIDQ2120789FDOQ2120789
Authors: Hemant Kumar Nashine, Sourav Shil, Fazlollah Soleymani, Xiaoxia Ma 
Publication date: 1 April 2022
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2022.01.017
Recommendations
- An efficient computation of generalized inverse of a matrix
- An efficient matrix iteration family for finding the generalized outer inverse
- Hyper-power methods for the computation of outer inverses
- Generalized Schultz iterative methods for the computation of outer inverses
- Rapid generalized Schultz iterative methods for the computation of outer inverses
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Title not available (Why is that?)
- Generalized inverse \(A^{(2)}_{T,S}\) and a rank equation
- An improved Newton iteration for the weighted Moore-Penrose inverse
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Some New Methods in Matrix Calculation
- Stability of Methods for Matrix Inversion
- The matrix sign function and computations in systems
- Hyper-power methods for the computation of outer inverses
- A class of numerical algorithms for computing outer inverses
- On finding robust approximate inverses for large sparse matrices
- Finding generalized inverses by a fast and efficient numerical method
- Chebyshev-type methods and preconditioning techniques
- A numerical method for computing the principal square root of a matrix
- A class of quadratically convergent iterative methods
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- A general class of arbitrary order iterative methods for computing generalized inverses
- Numerical algorithms for high-performance computational science
- Numerical and symbolic computations of generalized inverses
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
- Removal of blur in images based on least squares solutions
- An efficient computation of generalized inverse of a matrix
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- Weighted composite outer inverses
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- ZNN models for computing matrix inverse based on hyperpower iterative methods
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- Cryptanalysis of schemes based on pseudoinverse matrix
Cited In (2)
Uses Software
This page was built for publication: Exploiting higher computational efficiency index for computing outer generalized inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120789)
