Abstract
An algorithm is proposed for computing intervals containing the Moore–Penrose inverses. For developing this algorithm, we analyze the Ben-Israel iteration. We particularly emphasize that the algorithm is applicable even for rank deficient matrices. Numerical results show that the algorithm is more successful than previous algorithms in the rank deficient cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Israel, A., Greville, T.N.: Generalized Inverses: Theory and Applications, 2nd edn. Springer, New York (2003)
Campbell, S.L.: Operator methods and singular control problems. In: Lee, S.-J. (ed.) Operator Methods for Optimal Control Problems, pp. 57–66. Marcel Dekker, New York (1987)
Campbell, S.L., Meyer, C.D.: Generalized Inverses of Linear Transformations. Dover Publications, New York (1991)
Chen, Y., Shi, X., Wei, Y.: Convergence of Rump’s method for computing the Moore–Penrose inverse. Czechoslov. Math. J. 66(3), 859–879 (2016)
Cucker, F., Diao, H., Wei, Y.: Smoothed analysis of some condition numbers. Numer. Linear Algebra Appl. 13, 71–84 (2006)
Cucker, F., Diao, H., Wei, Y.: Mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems. Math. Comput. 76(258), 947–963 (2007)
Davis, T.A., Hu, Y., Kolodziej, S.: The SuiteSparse Matrix Collection. https://sparse.tamu.edu/. Accessed 22 Jan 2020
Demmel, J., Higham, N.J.: Improved error bounds for underdetermined system solvers. SIAM J. Matrix Anal. Appl. 14, 1–14 (1993)
Diao, H., Wang, W., Wei, Y., Qiao, S.: On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products. Numer. Linear Algebra Appl. 20, 44–59 (2013)
Diao, H., Wei, Y.: On Frobenius normwise condition numbers for Moore–Penrose inverse and linear least-squares problems. Numer. Linear Algebra Appl. 14, 603–610 (2007)
Diao, H., Wei, Y., Qiao, S.: Structured condition numbers of structured Tikhonov regularization problem and their estimations. J. Comput. Appl. Math. 308, 276–300 (2016)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)
Gulliksson, M., Wedin, P.Å., Wei, Y.: Perturbation identities for regularized Tikhonov inverses and weighted pseudoinverses. BIT 40, 513–523 (2000)
Li, Z., Xu, Q., Wei, Y.: A note on stable perturbations of Moore–Penrose inverses. Numer. Linear Algebra Appl. 20, 18–26 (2013)
Miyajima, S.: Fast enclosure for all eigenvalues and invariant subspaces in generalized eigenvalue problems. SIAM J. Matrix Anal. Appl. 35, 1205–1225 (2014)
Miyajima, S., Ogita, T., Oishi, S.: Fast verification for respective eigenvalues of symmetric matrix. Lecture Notes Comput. Sci. 3718, 306–317 (2005)
Miyajima, S., Ogita, T., Rump, S.M., Oishi, S.: Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems. Reliab. Comput. 14, 24–45 (2010)
Petković, M.D., Petković, M.S.: Iterative methods for the inclusion of the inverse matrix. (2014). arXiv preprint arXiv:1406.5343
Rao, C.R., Mitra, S.K.: Generalized Inverses of Matrices and Its Applications. Wiley, New York (1971)
Rohn, J.: VERSOFT: verification software in MATLAB/INTLAB. http://uivtx.cs.cas.cz/~rohn/matlab. Accessed 22 Jan 2020
Roy, F., Gupta, D.K., Stanimirović, P.S.: An interval extension of SMS method for computing weighted Moore–Penrose inverse. Calcolo (2018). https://doi.org/10.1007/s10092-018-0257-4
Rump, S.M.: INTLAB—INTerval LABoratory. In: Csendes, T. (ed.) Developments in Reliable Computing, pp. 77–107. Kluwer Academic Publishers, Dordrecht (1999)
Rump, S.M., Zemke, J.: On eigenvector bounds. BIT 43, 823–837 (2004)
Saraev, P.V.: Interval pseudo-inverse matrices and interval Greville algorithm. Reliab. Comput. 18, 147–156 (2013)
Wang, G., Wei, Y., Qiao, S.: Generalized Inverses: Theory and Computations, Developments in Mathematics 53. Springer, Singapore (2018)
Wei, Y., Stanimirović, P., Petković, M.: Numerical and Symbolic Computations of Generalized Inverses. World Scientific Publishing, Hackensack (2018)
Wilkinson, J.H.: Rigorous error bounds for computed eigensystem. Comput. J. 4, 230–241 (1961)
Zhang, X., Cai, J., Wei, Y.: Interval iterative methods for computing Moore–Penrose inverse. Appl. Math. Comput. 183(1), 522–532 (2006)
Zhi, L.: Symbolic-numeric algorithms for computing validated results. In: Proceedings of ISSAC conference, Kobe, pp. 25–26 (2014)
Zhou, L., Lin, L., Wei, Y., Qiao, S.: Perturbation analysis and condition numbers of scaled total least squares problems. Numer. Algorithms 51, 381–399 (2009)
Acknowledgements
This work was partially done during the visit to National Formosa University. The author sincerely thanks Prof. Chun-Yueh Chiang in National Formosa University and Prof. Min-Hsiung Lin in National Cheng Kung University for the invitation and hospitality. The author also acknowledges the referee for the valuable comment.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was partially supported by JSPS KAKENHI Grant No. JP16K05270.
Rights and permissions
About this article
Cite this article
Miyajima, S. Enclosing Moore–Penrose inverses. Calcolo 57, 7 (2020). https://doi.org/10.1007/s10092-020-0357-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10092-020-0357-9