Publication

Efficient Multi-step Identification of Koopman Operators

2025

Abstract

This paper proposes computationally efficient methods for identifying Koopman operators using multi-step output-error minimization. The two complementary approaches proposed in the paper trade-off between model accuracy and computational efficiency. Then, we provide an extensive comparison of the proposed methods to the standard Extended Dynamic Mode Decomposition (EDMD) approach through numerical examples. The results demonstrate the advantages of the proposed methods in terms of open and closed-loop performance, while remaining computationally efficient.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2025

Abstract

Official source

Related concepts (32)

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Numerical stability

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues.

Numerical integration

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals.

Related publications (11)

Efficient Multi-step Identification of Koopman Operators

Chat with Graph Search

Symmetry-Aware Bayesian Optimization via Max Kernels

Accelerating discovery across scientific disciplines through reproducible workflows with AiiDAlab

MATHICSE Technical Report : Semi-implicit BDF time discretization of the Navier-Stokes equations with VMS-LES modeling in a High Performance Computing framework