# Generalized Kernel-Based Dynamic Mode Decomposition

arXiv: https://arxiv.org/abs/2002.04375 · HTML: https://mlsanity.com/paper/2002.04375/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Feb 2020.

## Built on by (most cited first, 1 of 1)

- [State-Of-The-Art Algorithms For Low-Rank Dynamic Mode Decomposition](https://mlsanity.com/paper/2108.09160/) (2021)

## Abstract (arXiv)

Reduced modeling in high-dimensional reproducing kernel Hilbert spaces offers the opportunity to approximate efficiently non-linear dynamics. In this work, we devise an algorithm based on low rank constraint optimization and kernel-based computation that generalizes a recent approach called "kernel-based dynamic mode decomposition". This new algorithm is characterized by a gain in approximation accuracy, as evidenced by numerical simulations, and in computational complexity.
