Finding generalized inverses by a fast and efficient numerical method
From MaRDI portal
(Redirected from Publication:482683)
Recommendations
- An efficient computation of generalized inverse of a matrix
- On a fast iterative method for approximate inverse of matrices
- A high-order iterate method for computing \(A_{T, S}^{(2)}\)
- An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
- scientific article; zbMATH DE number 4024634
Cites work
- A class of numerical algorithms for computing outer inverses
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- A geometrical approach on generalized inverses by Neumann-type series
- A high-order iterate method for computing \(A_{T, S}^{(2)}\)
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse
- Chebyshev-type methods and preconditioning techniques
- Full-rank representations of outer inverses based on the QR decomposition
- Generalized inverses. Theory and applications.
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
- Higher-order convergent iterative method for computing the generalized inverse over Banach spaces
- On finding robust approximate inverses for large sparse matrices
- Representation and approximate for generalized inverse \(A_{T,S}^{(2)}\): revisited
- The Mathematica GuideBook for Numerics
Cited in
(11)- Fast computation of some asymptotic functional inverses
- Some matrix iterations for computing generalized inverses and balancing chemical equations
- Hyperpower least squares progressive iterative approximation
- Exploiting higher computational efficiency index for computing outer generalized inverses
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- scientific article; zbMATH DE number 4180665 (Why is no real title available?)
- Numerical and symbolic computations of generalized inverses
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- M-QR decomposition and hyperpower iterative methods for computing outer inverses of tensors
This page was built for publication: Finding generalized inverses by a fast and efficient numerical method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482683)
