Reduced basis method for the Stokes equations in decomposable domains using greedy optimization

Journal: 

ECMI 2014 proceedings, p. pp. 1–7

Date: 

2014

Authors: 

L. Iapichino, A. Quarteroni, G. Rozza and S. Volkwein

In this paper we present a reduced order method for the solution of parametrized Stokes equations in domain composed by an arbitrary number of predefined shapes. The novelty of the proposed approach is the possibility to use a small set of precomputed bases to solve Stokes equations in very different computational domains, defined by combining one or more reference geometries. The selection of the basis functions is performed through an optimization greedy algorithm.