RB methods in action: Computing the solution

Abstract

We present a selection of numerical results dealing with the RB approximation of the parametrized problems formulated in the previous chapter. For each problem we highlight the RB method’s computational performance, assess its accuracy by means of a posteriori error bounds, and show various options for the construction of the RB space (either via POD or the greedy algorithm) and different projection criteria (G-RB versus LS-RB methods). Here we focus on linear affine PDEs, and defer nonaffine and nonlinear problems to Chaps. 10 and 11 respectively.