A greedy Galerkin method to efficiently select sensors for linear dynamical systems
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Cornell Univ., Ithaca, NY (United States)
- Stanford Univ., CA (United States)
A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE Laboratory Directed Research and Development (LDRD) Program; US Air Force Office of Scientific Research (AFOSR); National Science Foundation (NSF)
- Grant/Contract Number:
- NA0003525
- OSTI ID:
- 2311282
- Report Number(s):
- SAND--2023-10184J
- Journal Information:
- Linear Algebra and Its Applications, Journal Name: Linear Algebra and Its Applications Vol. 679; ISSN 0024-3795
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the Implementation of 3D Galerkin Boundary Integral Equations
On Stable Marriages and Greedy Matchings