.png){kind=icon}
.png){kind=icon}
Return
DYNAMICAL APPROXIMATION AND SENSOR PLACEMENT FOR FILTERING PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1137/23M1625548.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the inverse problem of reconstructing an unknown function u from a finite set of measurements, under the assumption that u is the trajectory of a transport-dominated problem with unknown input parameters. We propose an algorithm based on the Parameterized Background Data-Weak method (PBDW), where dynamical sensor placement is combined with approximation spaces that evolve in time. We prove that the method ensures an accurate reconstruction at all times and allows us to incorporate relevant physical properties in the reconstructed solutions by suitably evolving the dynamical approximation space. As an application of this strategy we consider Hamiltonian systems modeling wave-type phenomena, where preservation of the geometric structure of the flow plays a crucial role in the accuracy and stability of the reconstructed trajectory.
Keywords:
inverse problem
state estimation
parametric Hamiltonian systems
dynamical low-rank approximation
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W