Efficient approximation of the Koopman operator for large-scale nonlinear systems

Implementing Model Predictive Control (MPC) for large-scale nonlinear systems is often computationally challenging due to the intensive online optimization required. To address this, various reduced-order linearization techniques have been developed. The Koopman operator linearizes a nonlinear system by mapping it into an infinite-dimensional space of observables, enabling the application of linear control strategies. While Artificial Neural Networks (ANNs) can approximate the Koopman operator in a data-driven manner, training these networks becomes computationally intensive for high-dimensional systems as the lifting into a higher-dimensional observable space significantly increases data size and complexity. In this work, we propose a technique, combining Proper Orthogonal Decomposition (POD) with an efficient ANN structure to reduce the training time of ANN for large order systems. By first applying POD, we obtain a low order projection of the system. Subsequently, we train the ANN with an efficient structure to approximate the Koopman operator, significantly decreasing training time without sacrificing accuracy.

Authors

Institutions

Publication Details

Journal
Systems and Control Transactions
Published
2025-06-30
DOI
https://doi.org/10.69997/sct.169758
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient approximation of the Koopman operator for large-scale nonlinear systems

Constantinos Theodoropoulos, William P. Heath, Gajanand Verma
Systems and Control Transactions
Model Reduction and Neural Networks
article

Efficient approximation of the Koopman operator for large-scale nonlinear systems

Constantinos Theodoropoulos, William P. Heath, Gajanand Verma
article en

Abstract

Implementing Model Predictive Control (MPC) for large-scale nonlinear systems is often computationally challenging due to the intensive online optimization required. To address this, various reduced-order linearization techniques have been developed. The Koopman operator linearizes a nonlinear system by mapping it into an infinite-dimensional space of observables, enabling the application of linear control strategies. While Artificial Neural Networks (ANNs) can approximate the Koopman operator in a data-driven manner, training these networks becomes computationally intensive for high-dimensional systems as the lifting into a higher-dimensional observable space significantly increases data size and complexity. In this work, we propose a technique, combining Proper Orthogonal Decomposition (POD) with an efficient ANN structure to reduce the training time of ANN for large order systems. By first applying POD, we obtain a low order projection of the system. Subsequently, we train the ANN with an efficient structure to approximate the Koopman operator, significantly decreasing training time without sacrificing accuracy.

Systems and Control TransactionsVol. 4
Bangor University (GB), University of Manchester (GB)
Openalex Percentile: Top 88%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.