Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Optimal reduced model algorithms for data-based state estimation

dc.contributor.authorCohen, Albert
dc.contributor.authorDahmen, Wolfgang
dc.contributor.authorDevore, Ronald
dc.contributor.authorFadili, Jalal
dc.contributor.authorMula, Olga
dc.contributor.authorNichols, James
dc.date.accessioned2023-08-10T02:21:49Z
dc.date.issued2020
dc.date.updated2022-07-24T08:18:12Z
dc.description.abstractReduced 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.sponsorshipThe 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 Universityen_AU
dc.format.mimetypeapplication/pdfen_AU
dc.identifier.issn0036-1429en_AU
dc.identifier.urihttp://hdl.handle.net/1885/295489
dc.language.isoen_AUen_AU
dc.publisherSociety for Industrial and Applied Mathematics-SIAM Publicationsen_AU
dc.rights© 2020 Society for Industrial and Applied Mathematicsen_AU
dc.sourceSIAM Journal of Numerical Analysisen_AU
dc.subjectreduced modelsen_AU
dc.subjectoptimal recoveryen_AU
dc.subjectsensingen_AU
dc.subjectconvex optimizationen_AU
dc.subjectparametrized PDEsen_AU
dc.titleOptimal reduced model algorithms for data-based state estimationen_AU
dc.typeJournal articleen_AU
local.bibliographicCitation.issue6en_AU
local.bibliographicCitation.lastpage3381en_AU
local.bibliographicCitation.startpage3355en_AU
local.contributor.affiliationCohen, Albert, Sorbonne Universityen_AU
local.contributor.affiliationDahmen, Wolfgang, University of South Carolinaen_AU
local.contributor.affiliationDevore, Ronald, Texas A&M Universityen_AU
local.contributor.affiliationFadili, Jalal, Normandie Universityen_AU
local.contributor.affiliationMula, Olga, CNRSen_AU
local.contributor.affiliationNichols, James, College of Science, ANUen_AU
local.contributor.authoruidNichols, James, u3357769en_AU
local.description.embargo2099-12-31
local.description.notesImported from ARIESen_AU
local.identifier.absfor490302 - Numerical analysisen_AU
local.identifier.absfor490101 - Approximation theory and asymptotic methodsen_AU
local.identifier.ariespublicationa383154xPUB16764en_AU
local.identifier.citationvolume58en_AU
local.identifier.doi10.1137/19M1255185en_AU
local.identifier.scopusID2-s2.0-85098004718
local.identifier.thomsonIDWOS:000600688900010
local.publisher.urlhttps://epubs.siam.org/en_AU
local.type.statusPublished Versionen_AU

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
OPTIMAL REDUCED MODEL ALGORITHMS.pdf
Size:
2.09 MB
Format:
Adobe Portable Document Format
Description: