Indexed metadata

Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models

Peter Binev, Albert Cohen, Olga Mula, James Nichols

Source record

Source: Crossref

Published: Jan 1, 2018

DOI: 10.1137/17m1157635

Open original source ↗

Source abstract

We consider the problem of optimal recovery of an unknown function uu in a Hilbert space VV from measurements of the form ℓj(u)\ell_j(u), j=1,…,mj=1,\ldots,m, where the ℓj\ell_j are known linear functionals on VV. We are motivated by the setting where uu is a solution to a PDE with some unknown parameters, therefore lying on a certain manifold contained in VV. Following the approach adopted in [Maday, Patera, Penn and Yano, Int. J. Numer. Methods Engrg., 102 (2015), pp. 933--965, Binev, Cohen, Dahmen, DeVore, Petrova, and Wojtaszczyk, SIAM J. Uncertainty Quantification, 5 (2017), pp. 1--29], the prior on the unknown function can be described in terms of its approximability by finite-dimensional reduced model spaces (Vn)n≥1(V_n)_{n\geq 1} where dim⁡(Vn)=n\dim(V_n)=n. Examples of such spaces include classical approximation spaces, e.g., finite elements or trigonometric polynomials, as well as reduced basis spaces which are designed to match the solution manifold more closely. The error bounds for optimal recovery under such priors are of the form μ(Vn,Wm)εn\mu(V_n,W_m) \varepsilon_n, where εn\varepsilon_n is the accuracy of the reduced model VnV_n and μ(Vn,Wm)\mu(V_n,W_m) is the inverse of an inf-sup constant that describe the angle between VnV_n and the space WmW_m spanned by the Riesz representers of (ℓ1,…,ℓm)(\ell_1,\ldots,\ell_m). This paper addresses the problem of properly selecting the measurement functionals, in order to control at best the stability constant μ(Vn,Wm)\mu(V_n,W_m), for a given reduced model space VnV_n. Assuming that the ℓj\ell_j can be picked from a given dictionary D{\cal D} we introduce and analyze greedy algorithms that perform a suboptimal selection in reasonable computational time. We study the particular case of dictionaries that consist either of point value evaluations or local averages, as idealized models for sensors in physical systems. Our theoretical analysis and greedy algorithms may therefore be used in order to optimize the position of such sensors.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models — Mathematical Frontier Network