On the stability of Reduced Basis methods for Stokes Equations in parametrized domains
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
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 ...
We apply the reduced basis method to solve Navier-Stokes equations in parametrized domains. Special attention is devoted to the treatment of the parametrized nonlinear transport term in the reduced basis framework, including the case of nonaffine parametri ...
Analytical solutions to problems of solids mechanics are useful to test the accuracy and the precision of the numerical approaches. Problems such as shear locking or boundary layer can be better understood with the help of analytical solutions. However, it ...
In this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of deg ...
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 ...
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 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 ...
Using methods originating in numerical analysis, we will develop a unified framework for derivation of efficient list decoding algorithms for algebraicgeometric codes. We will demonstrate our method by accelerating Sudan's list decoding algorithm for Reed- ...
Let A be a rational n × n square matrix and b be a rational n-vector for some positive integer n. The linear complementarity problem (abbreviated by LCP) is to find a vector (x, y) in R^(2n) satisfying y = Ax + b (x, y) >= 0 and the complementarity conditi ...
