Generalized Kernel-Based Dynamic Mode Decomposition

02/11/2020
by   Patrick Héas, et al.
0

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.

READ FULL TEXT
research
10/30/2017

Optimal Kernel-Based Dynamic Mode Decomposition

The state-of-the-art algorithm known as kernel-based dynamic mode decomp...
research
10/10/2016

Low-Rank Dynamic Mode Decomposition: Optimal Solution in Polynomial-Time

This work studies the linear approximation of high-dimensional dynamical...
research
03/25/2021

Estimating Koopman operators for nonlinear dynamical systems: a nonparametric approach

The Koopman operator is a mathematical tool that allows for a linear des...
research
08/20/2021

State-Of-The-Art Algorithms For Low-Rank Dynamic Mode Decomposition

This technical note reviews sate-of-the-art algorithms for linear approx...
research
01/04/2017

Optimal Low-Rank Dynamic Mode Decomposition

Dynamic Mode Decomposition (DMD) has emerged as a powerful tool for anal...
research
07/03/2018

One-Class Kernel Spectral Regression for Outlier Detection

The paper introduces a new efficient nonlinear one-class classifier form...
research
08/29/2023

An Incremental SVD Method for Non-Fickian Flows in Porous Media: Addressing Storage and Computational Challenges

It is well known that the numerical solution of the Non-Fickian flows at...

Please sign up or login with your details

Forgot password? Click here to reset