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

Memory-usage advantageous block recursive matrix inverse

Author

Listed:
  • Cosme, Iria C.S.
  • Fernandes, Isaac F.
  • de Carvalho, João L.
  • Xavier-de-Souza, Samuel

Abstract

The inversion of extremely high order matrices has been a challenging task because of the limited processing and memory capacity of conventional computers. In a scenario in which the data does not fit in memory, it is worth to consider exchanging less memory usage for more processing time in order to enable the computation of the inverse which otherwise would be prohibitive. We propose a new algorithm to compute the inverse of block partitioned matrices with a reduced memory footprint. The algorithm works recursively to invert one block of a k × k block matrix M, with k ≥ 2, based on the successive splitting of M. It computes one block of the inverse at a time, in order to limit memory usage during the entire processing. Experimental results show that, despite increasing computational complexity, matrices that otherwise would exceed the memory-usage limit can be inverted using this technique.

Suggested Citation

  • Cosme, Iria C.S. & Fernandes, Isaac F. & de Carvalho, João L. & Xavier-de-Souza, Samuel, 2018. "Memory-usage advantageous block recursive matrix inverse," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 125-136.
    • Handle: RePEc:eee:apmaco:v:328:y:2018:i:c:p:125-136
    DOI: 10.1016/j.amc.2018.01.051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318300742
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.01.051?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. Serge B. Provost & John N. Haddad, 2019. "A recursive approach for determining matrix inverses as applied to causal time series processes," METRON, Springer;Sapienza Università di Roma, vol. 77(1), pages 53-62, April.

    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:328:y:2018:i:c:p:125-136. 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.