IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v371y2020ics009630031930949x.html
   My bibliography  Save this article

Computing the Moore-Penrose inverse using its error bounds

Author

Listed:
  • Stanimirović, Predrag S.
  • Roy, Falguni
  • Gupta, Dharmendra K.
  • Srivastava, Shwetabh

Abstract

A new iterative scheme for the computation of the Moore-Penrose generalized inverse of an arbitrary rectangular or singular complex matrix is proposed. The method uses appropriate error bounds and is applicable without restrictions on the rank of the matrix. But, it requires that the rank of the matrix is known in advance or computed beforehand. The method computes a sequence of monotonic inclusion interval matrices which contain the Moore-Penrose generalized inverse and converge to it. Successive interval matrices are constructed by using previous approximations generated from the hyperpower iterative method of an arbitrary order and appropriate error bounds of the Moore-Penrose inverse. A convergence theorem of the introduced method is established. Numerical examples involving randomly generated matrices are presented to demonstrate the efficacy of the proposed approach. The main property of our method is that the successive interval matrices are not defined using principles of interval arithmetic, but using accurately defined error bounds of the Moore-Penrose inverse.

Suggested Citation

  • Stanimirović, Predrag S. & Roy, Falguni & Gupta, Dharmendra K. & Srivastava, Shwetabh, 2020. "Computing the Moore-Penrose inverse using its error bounds," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    • Handle: RePEc:eee:apmaco:v:371:y:2020:i:c:s009630031930949x
    DOI: 10.1016/j.amc.2019.124957
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031930949X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124957?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sheng, Xingping, 2018. "Computation of weighted Moore–Penrose inverse through Gauss–Jordan elimination on bordered matrices," Applied Mathematics and Computation, Elsevier, vol. 323(C), pages 64-74.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kansal, Munish & Kumar, Sanjeev & Kaur, Manpreet, 2022. "An efficient matrix iteration family for finding the generalized outer inverse," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    2. Zontini, Diego D. & Mirkoski, Maikon L. & Santos, João A.F., 2023. "Error bounds in the computation of outer inverses with generalized Schultz iterative methods and its use in computing of Moore-Penrose inverse," Applied Mathematics and Computation, Elsevier, vol. 440(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:371:y:2020:i:c:s009630031930949x. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.