Infoscience

Journal article

On the stability of Reduced Basis methods for Stokes Equations in parametrized domains

We present an application of reduced basis method for Stokes equations in domains with affine parametric dependence. The essential components of the method are (i) the rapid convergence of global reduced basis approximations – Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) the off-line/on-line computational procedures decoupling the generation and projection stages of the approximation process. The operation count for the on-line stage – in which, given a new parameter value, we calculate an output of interest – depends only on N (typically very small) and the parametric complexity of the problem; the method is thus ideally suited for the repeated and rapid evaluations required in the context of parameter estimation, design, optimization, and real-time control. Particular attention is given (i) to the pressure treatment of incompressible Stokes problem; (ii) to find an equivalent inf–sup condition that guarantees stability of reduced basis solutions by enriching the reduced basis velocity approximation space with the solutions of a supremizer problem; (iii) to provide algebraic stability of the problem by reducing the condition number of reduced basis matrices using an orthonormalization procedure applied to basis functions; (iv) to reduce computational costs in order to allow real-time solution of parametrized problem.

Fulltext

Related material