摘要：AbstractThe reduced basis (RB) method is an efficient technique to solve parametric partial differential equations in a multi-query context, where the solution has to be computed for many different parameter values. The RB method drastically reduces the computational time for any additional solution (during the so-calledonlinestage) once an initial set of basis functions has been computed (during the so-calledofflinestage) still retaining a certified level of accuracy. The greedy algorithm is the classical sampling strategy to select parameter values that define the set of basis functions. Here, an alternative and competitive approach for choosing the parameter values is presented. The new approach is based on an optimization problem for the parameters that allows to reduce the computational complexity of the offline stage of the RB method and improve its effectiveness.
关键词：KeywordsPDE-constrained optimizationreduced-order modelsreduced basis methodgreedy algorithmparametric distributed function
