IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i8p731-d256636.html
   My bibliography  Save this article

Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme

Author

Listed:
  • Haifa Bin Jebreen

    (Mathematics Department, College of Science, King Saud University, Riyadh 11451, Saudi Arabia)

Abstract

The goal of this research is to extend and investigate an improved approach for calculating the weighted Moore–Penrose (WMP) inverses of singular or rectangular matrices. The scheme is constructed based on a hyperpower method of order ten. It is shown that the improved scheme converges with this rate using only six matrix products per cycle. Several tests are conducted to reveal the applicability and efficiency of the discussed method, in contrast with its well-known competitors.

Suggested Citation

  • Haifa Bin Jebreen, 2019. "Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme," Mathematics, MDPI, vol. 7(8), pages 1-11, August.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:8:p:731-:d:256636
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/8/731/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/8/731/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Haifa Bin Jebreen & Yurilev Chalco-Cano, 2018. "An Improved Computationally Efficient Method for Finding the Drazin Inverse," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-8, October.
    2. Predrag S. Stanimirović & Miroslav Ćirić & Igor Stojanović & Dimitrios Gerontitis, 2017. "Conditions for Existence, Representations, and Computation of Matrix Generalized Inverses," Complexity, Hindawi, vol. 2017, pages 1-27, June.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Dilan Ahmed & Mudhafar Hama & Karwan Hama Faraj Jwamer & Stanford Shateyi, 2019. "A Seventh-Order Scheme for Computing the Generalized Drazin Inverse," Mathematics, MDPI, vol. 7(7), pages 1-10, July.
    2. 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).
    3. Stanimirović, Predrag S. & Petković, Marko D. & Mosić, Dijana, 2022. "Exact solutions and convergence of gradient based dynamical systems for computing outer inverses," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    4. Stanimirović, Predrag S. & Ćirić, Miroslav & Lastra, Alberto & Sendra, Juan Rafael & Sendra, Juana, 2021. "Representations and symbolic computation of generalized inverses over fields," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    5. Ashim Kumar & Dijana Mosić & Predrag S. Stanimirović & Gurjinder Singh & Lev A. Kazakovtsev, 2022. "Commuting Outer Inverse-Based Solutions to the Yang–Baxter-like Matrix Equation," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    6. Dijana Mosić & Predrag S. Stanimirović & Spyridon D. Mourtas, 2023. "Minimal Rank Properties of Outer Inverses with Prescribed Range and Null Space," Mathematics, MDPI, vol. 11(7), pages 1-18, April.
    7. Stanimirović, Predrag S. & Mosić, Dijana & Wei, Yimin, 2022. "Generalizations of composite inverses with certain image and/or kernel," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    8. Chan, Eunice Y.S. & Corless, Robert M. & González-Vega, Laureano & Sendra, J. Rafael & Sendra, Juana, 2022. "Inner Bohemian inverses," Applied Mathematics and Computation, Elsevier, vol. 421(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:gam:jmathe:v:7:y:2019:i:8:p:731-:d:256636. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.