IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaaa/596049.html
   My bibliography  Save this article

Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse

Author

Listed:
  • Xingping Sheng

Abstract

We first study the complexity of the algorithm presented in Guo and Huang (2010). After that, a new explicit formula for computational of the Moore-Penrose inverse of a singular or rectangular matrix . This new approach is based on a modified Gauss-Jordan elimination process. The complexity of the new method is analyzed and presented and is found to be less computationally demanding than the one presented in Guo and Huang (2010). In the end, an illustrative example is demonstrated to explain the corresponding improvements of the algorithm.

Suggested Citation

  • Xingping Sheng, 2014. "Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse," Abstract and Applied Analysis, Hindawi, vol. 2014, pages 1-6, March.
    • Handle: RePEc:hin:jnlaaa:596049
    DOI: 10.1155/2014/596049
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AAA/2014/596049.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AAA/2014/596049.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/596049?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
    ---><---

    Citations

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


    Cited by:

    1. Chen, Xuzhou & Ji, Jun, 2020. "A divide-and-conquer approach for the computation of the Moore-Penrose inverses," Applied Mathematics and Computation, Elsevier, vol. 379(C).
    2. Ma, Jie & Gao, Feng & Li, Yongshu, 2019. "An efficient method to compute different types of generalized inverses based on linear transformation," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 367-380.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlaaa:596049. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.