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

Computation of weighted Moore–Penrose inverse through Gauss–Jordan elimination on bordered matrices

Author

Listed:
  • Sheng, Xingping

Abstract

In this paper, two new algorithms for computing the Weighted Moore–Penrose inverse AM,N† of a general matrix A for weights M and N which are based on elementary row and column operations on two appropriate block partitioned matrices are introduced and investigated. The computational complexity of the introduced two algorithms is analyzed in detail. These two algorithms proposed in this paper are always faster than those in Sheng and Chen (2013) and Ji (2014), respectively, by comparing their computational complexities. In the end, an example is presented to demonstrate the two new algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:323:y:2018:i:c:p:64-74
    DOI: 10.1016/j.amc.2017.11.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317308238
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.11.041?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.

    Citations

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


    Cited by:

    1. 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).

    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:323:y:2018:i:c:p:64-74. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.