A higher order iterative method for \(A^{(2)}_{T,S}\)
From MaRDI portal
Publication:741388
DOI10.1007/s12190-013-0743-4zbMath1305.65128OpenAlexW2013699547MaRDI QIDQ741388
Shwetabh Srivastava, Dharmendra Kumar Gupta
Publication date: 12 September 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-013-0743-4
convergencenumerical exampleiterative methoderror boundDrazin inverseweighted Moore-Penrose inversegeneralized inverseBott-Duffin inverse\(A^{\dagger}_{MMoore-Penrose inverse \(A^\dagger\)N}\) representationouter inverse \(A^{(2)}_{T, S}\)
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
A two-step iterative method and its acceleration for outer inverses, Representations and properties for the MPCEP inverse, A hyperpower iterative method for computing the generalized Drazin inverse of Banach algebra element, An efficient method to compute the Moore-Penrose inverse, An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\), An efficient quadratically convergent iterative method to find the Moore–Penrose inverse, Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement, Finding the Moore-Penrose inverse by a new matrix iteration
Uses Software
Cites Work
- Unnamed Item
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Full-rank representations of outer inverses based on the QR decomposition
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- New proofs of two representations and minor of generalized inverse \(A_{T,S}^{(2)}\)
- Representation and approximate for generalized inverse \(A_{T,S}^{(2)}\): revisited
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- Convergence of Newton-like methods for singular operator equations using outer inverses
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- A characterization and representation of the generalized inverse \(A_{T,S}^{(2)}\) and its applications
- The representation and approximation for the generalized inverse \(A^{(2)}_{T,S}\)
- Generalized inverses. Theory and applications.
- Iterative methods for computing the generalized inverses \(A^{(2)}_{T,S}\) of a matrix \(A\)
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Representation and approximation of the outer inverse \(A_{T,S}^{(2)}\) of a matrix \(A\)
- Gauss-Jordan elimination method for computing outer inverses
- Successive matrix squaring algorithm for computing outer inverses
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
- (T,S) splitting methods for computing the generalized inverse and rectangular systems∗
- A fast convergent iterative solver for approximate inverse of matrices
- The representation and approximation for Drazin inverse
