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

Randomized Projection Learning Method for Dynamic Mode Decomposition

Author

Listed:
  • Sudam Surasinghe

    (Department of Mathematics, Clarkson University, Potsdam, NY 13699, USA
    These authors contributed equally to this work.)

  • Erik M. Bollt

    (Electrical and Computer Engineering and C 3 S 2 the Clarkson Center for Complex Systems Science, Clarkson University, Potsdam, NY 13699, USA
    These authors contributed equally to this work.)

Abstract

A data-driven analysis method known as dynamic mode decomposition (DMD) approximates the linear Koopman operator on a projected space. In the spirit of Johnson–Lindenstrauss lemma, we will use a random projection to estimate the DMD modes in a reduced dimensional space. In practical applications, snapshots are in a high-dimensional observable space and the DMD operator matrix is massive. Hence, computing DMD with the full spectrum is expensive, so our main computational goal is to estimate the eigenvalue and eigenvectors of the DMD operator in a projected domain. We generalize the current algorithm to estimate a projected DMD operator. We focus on a powerful and simple random projection algorithm that will reduce the computational and storage costs. While, clearly, a random projection simplifies the algorithmic complexity of a detailed optimal projection, as we will show, the results can generally be excellent, nonetheless, and the quality could be understood through a well-developed theory of random projections. We will demonstrate that modes could be calculated for a low cost by the projected data with sufficient dimension.

Suggested Citation

  • Sudam Surasinghe & Erik M. Bollt, 2021. "Randomized Projection Learning Method for Dynamic Mode Decomposition," Mathematics, MDPI, vol. 9(21), pages 1-17, November.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:21:p:2803-:d:672402
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/21/2803/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/21/2803/
    Download Restriction: no
    ---><---

    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:9:y:2021:i:21:p:2803-:d:672402. 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: 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.