A parallel batch greedy algorithm in reduced basis methods: Convergence rates and numerical results

Niklas Reich, Karsten Urban, Jürgen Vorloeper

The "classical" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimat…