Reduced basis method for the Stokes equations in decomposable parametrized domains using greedy optimization
Related publications (38)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...
In this paper we further develop an approach previously introduced in [Lassila and Rozza, C.M.A.M.E 2010] for shape optimization that combines a suitable low-dimensional parametrization of the geometry (yielding a geometrical reduction) with reduced basis ...
The objective of this work is to develop a numerical framework to perform rapid and reliable simulations for solving parametric problems in domains represented by networks and to extend the classical reduced basis method. Aimed at this scope, we propose tw ...
In this paper we consider (hierarchical, Lagrange) reduced basis approximation and a posteriori error estimation for potential flows in affinely parametrized geometries. We review the essential ingredients: i) a Galerkin projection onto a low dimensional s ...
In this thesis we will deal with the creation of a Reduced Basis (RB) approximation of parametrized Partial Differential Equations (PDE) for three-dimensional problems. The the idea behind RB is to decouple the generation and projection stages (Offline/Onli ...
Reduction strategies, such as model order reduction (MOR) or reduced basis (RB) methods, in scientic computing may become crucial in applications of increasing complexity. In this paper we review the reduced basis method (built upon a high-delity "truth" f ...
In many fields, the computation of an output depending on a field variable is of great interest. If the field variable depends on a high-dimensional parameter, the computational cost involved can be huge. Hence, it is necessary to find efficient and reliab ...
We present a reduced basis element method (RBEM) for the time-harmonic Maxwell's equation. The RBEM is a Reduced Basis Method (RBM) with parameters describing the geometry of the computational domain, coupled with a domain decomposition method. The basic i ...
Parametrized systems of Differential Algebraic Equations (DAEs) stand at the base of several mathematical models in Microelectronics, Computational Fluid Dynamics and other Engineering fields. Since the dimension of these systems can be huge, high computat ...
In this paper we deal with reduced basis techniques applied to Stokes equations. We consider domains with different shape, parametrized by affine and non-affine maps with respect to a reference domain. The proposed method is ideally suited for the repeated ...