Koopman Kalman Filter (KKF): An asymptotically optimal nonlinear filtering algorithm with error bounds and its application to parameter estimation

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Olguín, Diego, Osses, Axel, Ramírez, Héctor
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914140744843264
author Olguín, Diego
Osses, Axel
Ramírez, Héctor
author_facet Olguín, Diego
Osses, Axel
Ramírez, Héctor
contents In this article, we propose a new filtering algorithm based in the Koopman operator, showing that a nonlinear filtering problem can be seen as an equivalent problem where the dynamics is infinite dimensional, but linear. Using Extended Dynamic Mode Decomposition (EDMD), we create a finite dimensional approximation of the filtering problem of dimension $N$, in state and error covariance matrix, that accomplishes an error bound of order \(O(N^{-1/2})\) in both where $N$ denotes the number of points used in the Koopman approximation. The algorithm is denominated Koopman Kalman Filter (KKF), and has computational complexity \(O(T\cdot N^3)\) in time, and \(O(T \cdot N^2)\) in space, where \(T\) is the number of iterations of the filtering problem. We test the algorithm in linear and nonlinear dynamics cases, showing and effective error bound with respect to the Kalman filter, that corresponds to the optimal solution in the linear case, and equals the error performance of other methods in the state of the art, but with a much lower execution time. Also, we propose a parameter estimation algorithm based in KKF, comparing it with Markov Chain Monte Carlo techniques, showing similar performance with lower execution time.
format Preprint
id arxiv_https___arxiv_org_abs_2511_04252
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Koopman Kalman Filter (KKF): An asymptotically optimal nonlinear filtering algorithm with error bounds and its application to parameter estimation
Olguín, Diego
Osses, Axel
Ramírez, Héctor
Dynamical Systems
Optimization and Control
47B32, 47B33, 60G35, 62L12, 62M20, 93E11
In this article, we propose a new filtering algorithm based in the Koopman operator, showing that a nonlinear filtering problem can be seen as an equivalent problem where the dynamics is infinite dimensional, but linear. Using Extended Dynamic Mode Decomposition (EDMD), we create a finite dimensional approximation of the filtering problem of dimension $N$, in state and error covariance matrix, that accomplishes an error bound of order \(O(N^{-1/2})\) in both where $N$ denotes the number of points used in the Koopman approximation. The algorithm is denominated Koopman Kalman Filter (KKF), and has computational complexity \(O(T\cdot N^3)\) in time, and \(O(T \cdot N^2)\) in space, where \(T\) is the number of iterations of the filtering problem. We test the algorithm in linear and nonlinear dynamics cases, showing and effective error bound with respect to the Kalman filter, that corresponds to the optimal solution in the linear case, and equals the error performance of other methods in the state of the art, but with a much lower execution time. Also, we propose a parameter estimation algorithm based in KKF, comparing it with Markov Chain Monte Carlo techniques, showing similar performance with lower execution time.
title Koopman Kalman Filter (KKF): An asymptotically optimal nonlinear filtering algorithm with error bounds and its application to parameter estimation
topic Dynamical Systems
Optimization and Control
47B32, 47B33, 60G35, 62L12, 62M20, 93E11
url https://arxiv.org/abs/2511.04252