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


ECMI 2014 proceedings, p. pp. 1–7




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.

author = {Iapichino, Laura and Quarteroni, Alfio and Rozza, Gianluigi and Volkwein,
title = {Reduced basis method for the {S}tokes equations in decomposable domains
using greedy optimization},
year = {2014},
pages = {1--7},
booktitle = {ECMI 2014 proceedings},
doi = {10.1007/978-3-319-23413-7_89}

[Download preprint] [View on publisher website]