Nonlinear compressive reduced basis approximation for multi-parameter elliptic problem

Hassan Ballout (), Yvon Maday () and Christophe Prud’homme ()
Additional contact information
Hassan Ballout: University of Strasbourg, CNRS, Cemosis, IRMA UMR 7501
Yvon Maday: Sorbonne Université, CNRS, Université Paris Cité, Laboratoire Jacques-Louis Lions (LJLL)
Christophe Prud’homme: University of Strasbourg, CNRS, Cemosis, IRMA UMR 7501

A chapter in Multiscale, Nonlinear and Adaptive Approximation II, 2024, pp 55-73 from Springer

Abstract: Abstract Reduced basis methods for approximating the solutions of parameterdependant partial differential equations (PDEs) are based on learning the structure of the set of solutions - seen as a manifold $$ \mathcal{S} $$ in some functional space - when the parameters vary. This involves investigating the manifold and, in particular, understanding whether it is close to a low-dimensional affine space. This leads to the notion of Kolmogorov N-width that consists of evaluating to which extent the best choice of a vectorial space of dimension N approximates $$ \mathcal{S} $$ well enough. If a good approximation of elements in $$ \mathcal{S} $$ can be done with some well-chosen vectorial space of dimension N – provided N is not too large – then a “reduced” basis can be proposed that leads to a Galerkin type method for the approximation of any element in $$ \mathcal{S} $$ . In many cases, however, the Kolmogorov N-width is not so small, even if the parameter set lies in a space of small dimension yielding a manifold with small dimension. In terms of complexity reduction, this gap between the small dimension of the manifold and the large Kolmogorov N-width can be explained by the fact that the Kolmogorov N-width is linear while, in contrast, the dependency in the parameter is, most often, non-linear. There have been many contributions aiming at reconciling these two statements, either based on deterministic or AI approaches.We investigate here further a new paradigm that, in some sense, merges these two aspects: the nonlinear compressive reduced basis approximation.We focus on a simple multiparameter problem and illustrate rigorously that the complexity associated with the approximation of the solution to the parameter dependant PDE is directly related to the number of parameters rather than the Kolmogorov N-width.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-75802-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9783031758027

DOI: 10.1007/978-3-031-75802-7_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().