Optimal reduced model algorithms for data-based state estimation
| dc.contributor.author | Cohen, Albert | |
| dc.contributor.author | Dahmen, Wolfgang | |
| dc.contributor.author | Devore, Ronald | |
| dc.contributor.author | Fadili, Jalal | |
| dc.contributor.author | Mula, Olga | |
| dc.contributor.author | Nichols, James | |
| dc.date.accessioned | 2023-08-10T02:21:49Z | |
| dc.date.issued | 2020 | |
| dc.date.updated | 2022-07-24T08:18:12Z | |
| dc.description.abstract | Reduced model spaces, such as reduced bases and polynomial chaos, are linear spaces Vn of finite dimension n which are designed for the efficient approximation of certain families of parametrized PDEs in a Hilbert space V . The manifold M that gathers the solutions of the PDE for all admissible parameter values is globally approximated by the space Vn with some controlled accuracy ϵn, which is typically much smaller than when using standard approximation spaces of the same dimension such as finite elements. Reduced model spaces have also been proposed in [Y. Maday et al., Internat. J. Numer. Methods Ergrg., 102 (2015), pp. 933-965] as a vehicle to design a simple linear recovery algorithm of the state u ∈ M corresponding to a particular solution instance when the values of parameters are unknown but a set of data is given by m linear measurements of the state. The measurements are of the form lj (u), j = 1, . . .,m, where the lj are linear functionals on V . The analysis of this approach in [P. Binev et al., SIAM/ASA J. Uncertain. Quantif., 5 (2017), pp. 1-29] shows that the recovery error is bounded by μnϵn, where μn = μ (Vn,W) is the inverse of an inf-sup constant that describe the angle between Vn and the space W spanned by the Riesz representers of (l1, . . ., l m). A reduced model space which is efficient for approximation might thus be ineffective for recovery if μ n is large or infinite. In this paper, we discuss the existence and effective construction of an optimal reduced model space for this recovery method. We extend our search to affine spaces which are better adapted than linear spaces for various purposes. Our basic observation is that this problem is equivalent to the search of an optimal affine algorithm for the recovery of M in the worst case error sense. This allows us to peform our search by a convex optimization procedure. Numerical tests illustrate that the reduced model spaces constructed from our approach perform better than the classical reduced basis spaces. | en_AU |
| dc.description.sponsorship | The work of the third author was supported by the Institut Universitaire de France, the ERC Adv grant BREAD, the EMERGENCES grant project “Models and Measures” from the Paris City Council, the National Science Foundation grants DMS 15-21067, DMS 18-17603, DMS 172097 and the Oce of Naval Research grants N00014-17-1-2908, N00014-16-1-2706. The work of the first, second, third, fifth and sixth authors were also supported as visitors by the Isaac Newton Institute at Cambridge University | en_AU |
| dc.format.mimetype | application/pdf | en_AU |
| dc.identifier.issn | 0036-1429 | en_AU |
| dc.identifier.uri | http://hdl.handle.net/1885/295489 | |
| dc.language.iso | en_AU | en_AU |
| dc.publisher | Society for Industrial and Applied Mathematics-SIAM Publications | en_AU |
| dc.rights | © 2020 Society for Industrial and Applied Mathematics | en_AU |
| dc.source | SIAM Journal of Numerical Analysis | en_AU |
| dc.subject | reduced models | en_AU |
| dc.subject | optimal recovery | en_AU |
| dc.subject | sensing | en_AU |
| dc.subject | convex optimization | en_AU |
| dc.subject | parametrized PDEs | en_AU |
| dc.title | Optimal reduced model algorithms for data-based state estimation | en_AU |
| dc.type | Journal article | en_AU |
| local.bibliographicCitation.issue | 6 | en_AU |
| local.bibliographicCitation.lastpage | 3381 | en_AU |
| local.bibliographicCitation.startpage | 3355 | en_AU |
| local.contributor.affiliation | Cohen, Albert, Sorbonne University | en_AU |
| local.contributor.affiliation | Dahmen, Wolfgang, University of South Carolina | en_AU |
| local.contributor.affiliation | Devore, Ronald, Texas A&M University | en_AU |
| local.contributor.affiliation | Fadili, Jalal, Normandie University | en_AU |
| local.contributor.affiliation | Mula, Olga, CNRS | en_AU |
| local.contributor.affiliation | Nichols, James, College of Science, ANU | en_AU |
| local.contributor.authoruid | Nichols, James, u3357769 | en_AU |
| local.description.embargo | 2099-12-31 | |
| local.description.notes | Imported from ARIES | en_AU |
| local.identifier.absfor | 490302 - Numerical analysis | en_AU |
| local.identifier.absfor | 490101 - Approximation theory and asymptotic methods | en_AU |
| local.identifier.ariespublication | a383154xPUB16764 | en_AU |
| local.identifier.citationvolume | 58 | en_AU |
| local.identifier.doi | 10.1137/19M1255185 | en_AU |
| local.identifier.scopusID | 2-s2.0-85098004718 | |
| local.identifier.thomsonID | WOS:000600688900010 | |
| local.publisher.url | https://epubs.siam.org/ | en_AU |
| local.type.status | Published Version | en_AU |
Downloads
Original bundle
1 - 1 of 1
Loading...
- Name:
- OPTIMAL REDUCED MODEL ALGORITHMS.pdf
- Size:
- 2.09 MB
- Format:
- Adobe Portable Document Format
- Description: