arrow
Return

Reduced basis methods for time-dependent problems

delete2022-06-09
delete36
delete
OA
AI
J
Jan S. Hesthaven *
C
Cecilia Pagliantini
G
Gianluigi Rozza
DOI:10.1017/S0962492922000058delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Numerical simulation of parametrized differential equations is of crucial importance in the study of real-world phenomena in applied science and engineering. Computational methods for real-time and many-query simulation of such problems often require prohibitively high computational costs to achieve sufficiently accurate numerical solutions. During the last few decades, model order reduction has proved successful in providing low-complexity high-fidelity surrogate models that allow rapid and accurate simulations under parameter variation, thus enabling the numerical simulation of increasingly complex problems. However, many challenges remain to secure the robustness and efficiency needed for the numerical simulation of nonlinear time-dependent problems. The purpose of this article is to survey the state of the art of reduced basis methods for time-dependent problems and draw together recent advances in three main directions. First, we discuss structure-preserving reduced order models designed to retain key physical properties of the continuous problem. Second, we survey localized and adaptive methods based on nonlinear approximations of the solution space. Finally, we consider data-driven techniques based on non-intrusive reduced order models in which an approximation of the map between parameter space and coefficients of the reduced basis is learned. Within each class of methods, we describe different approaches and provide a comparative discussion that lends insights to advantages, disadvantages and potential open questions.
Keywords:
PROPER ORTHOGONAL DECOMPOSITION
PRESERVING MODEL-REDUCTION
PARTIAL-DIFFERENTIAL-EQUATIONS
POSTERIORI ERROR ESTIMATION
ARTIFICIAL NEURAL-NETWORKS
ORDER REDUCTION
EMPIRICAL INTERPOLATION
BASIS APPROXIMATION
GREEDY ALGORITHMS
DIMENSIONALITY REDUCTION

Journal

Acta Numerica cover
Acta Numerica
IF:
11.3
Papers:
89
Citations:
3.4K

Organization

E
Ecole Polytechnique Federale de Lausanne
Scholars:
1.7W
Papers: 1.3W
Citations: 25
S
swiss federal institutes of technology domain
Scholars:
9.0W
Papers: 8.0W
Citations: 163
E
Eindhoven University of Technology
Scholars:
1.6W
Papers: 1.5W
Citations: 2.2W
researcher View more organizations