Rapid generalized Schultz iterative methods for the computation of outer inverses
From MaRDI portal
Publication:724547
DOI10.1016/J.CAM.2018.05.048zbMATH Open1451.65040OpenAlexW2807874978MaRDI QIDQ724547FDOQ724547
Authors: Marko D. Petković, Mihailo A. Krstić, Kostadin P. Rajković 
Publication date: 26 July 2018
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.2018.05.048
Recommendations
- Generalized Schultz iterative methods for the computation of outer inverses
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- Iterative methods for computing generalized inverses
- A two-step iterative method and its acceleration for outer inverses
- scientific article; zbMATH DE number 536551
- Further results on iterative methods for computing generalized inverses
- A general class of arbitrary order iterative methods for computing generalized inverses
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Title not available (Why is that?)
- Successive matrix squaring algorithm for computing outer inverses
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- 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
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- Successive matrix squaring algorithm for computing the Drazin inverse
- Generalized Schultz iterative methods for the computation of outer inverses
- Hyper-power methods for the computation of outer inverses
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
Cited In (14)
- Generalized Schultz iterative methods for the computation of outer inverses
- 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
- A novel iterative method for computing generalized inverse
- Exploiting higher computational efficiency index for computing outer generalized inverses
- Modified bas iteration method for absolute value equation
- On a Class of High Order Methods for Inverting Matrices
- Computing outer inverses by scaled matrix iterations
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- A general class of arbitrary order iterative methods for computing generalized inverses
- Block recursive computation of generalized inverses
- Two-parameters numerical methods of the non-symmetric algebraic Riccati equation
This page was built for publication: Rapid generalized Schultz iterative 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 Q724547)
