A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix

From MaRDI portal
Publication:846447

DOI10.1016/j.amc.2009.10.038zbMath1185.65057OpenAlexW2119812841MaRDI QIDQ846447

N. E. Zubov

Publication date: 9 February 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.10.038




Related Items (38)

Boundary-consistent B-spline filtering schemes and application to high-fidelity simulations of turbulenceGeneralized Schultz iterative methods for the computation of outer inversesHigher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matricesOn finding robust approximate inverses for large sparse matricesA fast computational algorithm for computing outer pseudo-inverses with numerical experimentsFrom Zhang neural network to scaled hyperpower iterationsA family of iterative methods for computing Moore-Penrose inverse of a matrixEPEM: efficient parameter estimation for multiple class monotone missing dataConvergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-productComputing outer inverses by scaled matrix iterationsRandomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion AlgorithmsA family of higher-order convergent iterative methods for computing the Moore-Penrose inverseUnnamed ItemA Novel Iterative Method for Computing Generalized InverseA new iterative method for finding approximate inverses of complex matricesOne-sided weighted outer inverses of tensorsEffective implementation to reduce execution time of a low-rank matrix approximation problemNeural network for computing pseudoinverses and outer inverses of complex-valued matricesComposite outer inverses for rectangular matricesA fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensorsAn efficient method to compute the Moore-Penrose inverseA general class of arbitrary order iterative methods for computing generalized inversesExact solutions and convergence of gradient based dynamical systems for computing outer inversesZNN models for computing matrix inverse based on hyperpower iterative methodsHigher-order convergent iterative method for computing the generalized inverse over Banach spacesA rapid numerical algorithm to compute matrix inversionComputing the Moore-Penrose inverse using its error boundsAn efficient quadratically convergent iterative method to find the Moore–Penrose inverseA predictor-corrector iterative method for solving linear least squares problems and perturbation error analysisUnified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvementA class of Kung-Traub-type iterative algorithms for matrix inversionA fast convergent iterative solver for approximate inverse of matricesA class of quadratically convergent iterative methodsFurther efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)High-order iterative methods for the DMP inverseVarying-parameter Zhang neural network for approximating some expressions involving outer inversesA note on the stability of a \(p\)th order iteration for finding generalized inversesFinding the Moore-Penrose inverse by a new matrix iteration



Cites Work


This page was built for publication: A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix