A note of computation for M-P inverseA†
Authors:
- 1 August 2010
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 87 (10) , 2235-2241
Abstract
This paper presents an explicit representation for M-P inverse A †. Based on this, we can use Gauss–Jordan elimination to compute it, and get the upper bound of the total number of arithmetic operations about 21/4n 3. Finally, a numerical example is demonstrated.Keywords
This publication has 5 references indexed in Scilit:
- Explicit expressions of the generalized inverses and condensed Cramer rulesLinear Algebra and its Applications, 2005
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares ProblemsSIAM Review, 1977
- Perturbation theory for pseudo-inversesBIT Numerical Mathematics, 1973
- On the Continuity of the Generalized InverseSIAM Journal on Applied Mathematics, 1969
- A generalized inverse for matricesMathematical Proceedings of the Cambridge Philosophical Society, 1955