Analytical Uncertainty Propagation and Maximum A Posteriori Filtering with the Koopman Operato

This paper proposes a method to propagate uncertainties undergoing nonlinear dynamics using the Koopman Operator (KO). Probability density functions are propagated directly using the Koopman approximation of the solution flow of the system, where the dynamics have been projected on a well-defined set of basis functions. The prediction technique is derived following both the analytical (Galerkin) and numerical (EDMD) derivation of the KO, and a least square reduction algorithm assures the recursivity of the proposed methodology. Furthermore, a complete filtering algorithm is proposed, where the predicted uncertainties are updated analytically using the likelihood function, following Bayes’ formulation. Estimates are provided after optimization according to the Maximum A Posteriori formulation, where a backtracking Newton solver identifies the global most likely posterior state.

Authors

Publication Details

Journal
Iowa State University Digital Repository (Iowa State University)
Published
2025-05-02
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

Analytical Uncertainty Propagation and Maximum A Posteriori Filtering with the Koopman Operato

Simone Servadio
Iowa State University Digital Repository (Iowa State University)
Model Reduction and Neural Networks
article

Analytical Uncertainty Propagation and Maximum A Posteriori Filtering with the Koopman Operato

Simone Servadio
article en

Abstract

This paper proposes a method to propagate uncertainties undergoing nonlinear dynamics using the Koopman Operator (KO). Probability density functions are propagated directly using the Koopman approximation of the solution flow of the system, where the dynamics have been projected on a well-defined set of basis functions. The prediction technique is derived following both the analytical (Galerkin) and numerical (EDMD) derivation of the KO, and a least square reduction algorithm assures the recursivity of the proposed methodology. Furthermore, a complete filtering algorithm is proposed, where the predicted uncertainties are updated analytically using the likelihood function, following Bayes’ formulation. Estimates are provided after optimization according to the Maximum A Posteriori formulation, where a backtracking Newton solver identifies the global most likely posterior state.

Iowa State University Digital Repository (Iowa State University)
Openalex Percentile: Top 24%
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.

Analytical Uncertainty Propagation and Maximum A Posteriori Filtering with the Koopman Operato — Simone Servadio · Iowa State University Digital Repository (Iowa State University) (2025) | TGRS Research Map | TGRS