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.
We present a Petrov-Galerkin reduced basis (RB) approximation for the parameterized Stokes equation. Our method, which relies on a reduced solution space and a parameter-dependent test space, is shown to be stable (in the sense of Babuska) and algebraically stable '(a bound on the condition number of the online system can be established). Compared to other stable RB methods that can also be shown to be algebraically stable, our approach is among those with the smallest online time cost and it has general applicability to linear non-coercive problems without assuming a saddle-point structure. (C) 2015 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.
Rachid Guerraoui, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis, Gauthier Jérôme Timothée Voron