REDUCED BASIS A POSTERIORI ERROR BOUNDS FOR THE STOKES EQUATIONS IN PARAMETRIZED DOMAINS: A PENALTY APPROACH

Abstract

We present reduced basis approximations and associated rigorous a posteriori error bounds for the Stokes equations in parametrized domains. The method, built upon the penalty formulation for saddle point problems, provides error bounds not only for the velocity but also for the pressure approximation, while simultaneously admitting affine geometric variations with relative ease. The essential ingredients are: (i) dimension reduction through Galerkin projection onto a low-dimensional reduced basis space; (ii) stable, good approximation of the pressure through supremizer-enrichment of the velocity reduced basis space; (iii) optimal and numerically stable approximations identified through an efficient greedy sampling method; (iv) certainty, through rigorous a posteriori bounds for the errors in the reduced basis approximation; and (v) efficiency, through an offline-online computational strategy. The method is applied to a flow problem in a two-dimensional channel with a (parametrized) rectangular obstacle. Numerical results show that the reduced basis approximation converges rapidly, the effectivities associated with the (inexpensive) rigorous a posteriori error bounds remain good even for reasonably small values of the penalty parameter, and that the effects of the penalty parameter are relatively benign.