pith. sign in

arxiv: 1512.06527 · v2 · pith:GKZ2PTVDnew · submitted 2015-12-21 · 🧮 math.NA

Towards tensor-based methods for the numerical approximation of the Perron-Frobenius and Koopman operator

classification 🧮 math.NA
keywords eigenfunctionssystembehaviorlow-rankoperatoroperatorstensortensor-based
0
0 comments X
read the original abstract

The global behavior of dynamical systems can be studied by analyzing the eigenvalues and corresponding eigenfunctions of linear operators associated with the system. Two important operators which are frequently used to gain insight into the system's behavior are the Perron-Frobenius operator and the Koopman operator. Due to the curse of dimensionality, computing the eigenfunctions of high-dimensional systems is in general infeasible. We will propose a tensor-based reformulation of two numerical methods for computing finite-dimensional approximations of the aforementioned infinite-dimensional operators, namely Ulam's method and Extended Dynamic Mode Decomposition (EDMD). The aim of the tensor formulation is to approximate the eigenfunctions by low-rank tensors, potentially resulting in a significant reduction of the time and memory required to solve the resulting eigenvalue problems, provided that such a low-rank tensor decomposition exists. Typically, not all variables of a high-dimensional dynamical system contribute equally to the system's behavior, often the dynamics can be decomposed into slow and fast processes, which is also reflected in the eigenfunctions. Thus, the weak coupling between different variables might be approximated by low-rank tensor cores. We will illustrate the efficiency of the tensor-based formulation of Ulam's method and EDMD using simple stochastic differential equations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Nonparametric Sparse Online Learning of the Koopman Operator

    stat.ML 2024-05 unverdicted novelty 6.0

    Develops a nonparametric sparse online algorithm to learn the Koopman operator iteratively via stochastic approximation with explicit complexity control and convergence guarantees in misspecified RKHS settings via con...