Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
While reduced-order models (ROMs) are popular for approximately solving large systems of differential equations, the stability of reduced models over long-time integration remains an open question. We present a greedy approach for ROM generation of parametric Hamiltonian systems which captures the symplectic structure of Hamiltonian systems to ensure stability of the reduced model. Through the greedy selection of basis vectors, two new vectors are added at each iteration to the set of basis vectors to increase the overall accuracy of the reduce basis. We used the error in the Hamiltonian function due to model reduction, as an error indicator to search the parameter space and find the next best basis vectors. We show that the greedy algorithm converges with exponential rate, under natural assumptions on the set of all solutions of the Hamiltonian system under variation of the parameters. Moreover, we demonstrate that combining the greedy basis with the discrete empirical interpolation method also preserves the symplectic structure. This enables the reduction of computational cost for nonlinear Hamiltonian systems. The efficiency, accuracy, and stability of this model reduction technique is illustrated through simulations of the parametric wave equation and the parametric Schroedinger equation.
Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani
Simone Deparis, Riccardo Tenderini, Nicholas Mueller