Deflation-based certified greedy algorithm and adaptivity for bifurcating nonlinear PDEs

This work deals with tailored reduced order models for bifurcating nonlinear parametric partial differential equations, where multiple coexisting solutions arise for a given parametric instance. Approaches based on proper orthogonal decomposition have been widely investigated in the literature, but they usually rely on some a-priori knowledge about the bifurcating model and lack any error estimation. On the other hand, standard certified reduced basis techniques fail to represent correctly the branching behavior, since the error estimator is no longer reliable. The main goal of the contribution is to overcome these limitations by introducing two novel algorithms: (i) the adaptive-greedy, detecting the bifurcation point starting from scarce information over the parametric space, and (ii) the deflated-greedy, certifying multiple coexisting branches simultaneously. The former approach takes advantage of the features of the reduced manifold to detect the bifurcation, while the latter exploits the deflation and continuation methods to discover the bifurcating solutions and enrich the reduced space. We test the two strategies for the Coanda effect held by the Navier–Stokes equations in a sudden-expansion channel. The accuracy of the approach and the error certification are compared with vanilla-greedy and proper orthogonal decomposition. • Novel greedy-based algorithms to certify reduced models for bifurcating PDEs. • Adaptive-greedy strategy to detect the critical points with no prior knowledge of the bifurcation. • Deflated-greedy algorithm to discover multiple coexisting branches at the reduced level. • Outperforming state-of-the-art approaches based on vanilla-greedy and POD techniques.