Philipp Schulze

Julius Reiss, Philipp Schulze, Jörn Sesterhenn et al.

Transport-dominated phenomena provide a challenge for common mode-based model reduction approaches. We present a model reduction method, which is suited for these kind of systems. It extends the proper orthogonal decomposition (POD) by introducing time-dependent shifts of the snapshot matrix. The approach, called shifted proper orthogonal decomposition (sPOD), features a determination of the {\it multiple} transport velocities and a separation of these. One- and two-dimensional test examples reveal the good performance of the sPOD for transport-dominated phenomena and its superiority in comparison to the POD.

Philipp Schulze, Julius Reiss, Volker Mehrmann

We propose a new algorithm to compute a shifted proper orthogonal decomposition (sPOD) for systems dominated by multiple transport velocities. The sPOD is a recently proposed mode decomposition technique which overcomes the poor performance of classical methods like the proper orthogonal decomposition (POD) for transport-dominated phenomena. This is achieved by identifying the transport directions and velocities and by shifting the modes in space to track the transports. Our new algorithm carries out a residual minimization in which the main computational cost arises from solving a nonlinear optimization problem scaling with the snapshot dimension. We apply the algorithm to snapshot data from the simulation of a pulsed detonation combuster and observe that very few sPOD modes are sufficient to obtain a good approximation. For the same accuracy, the common POD needs ten times as many modes and, in contrast to the sPOD modes, the POD modes do not reflect the moving front profiles properly.

Paul Schwerdtner, Philipp Schulze, Jules Berman et al.

This work focuses on the conservation of quantities such as Hamiltonians, mass, and momentum when solution fields of partial differential equations are approximated with nonlinear parametrizations such as deep networks. The proposed approach builds on Neural Galerkin schemes that are based on the Dirac--Frenkel variational principle to train nonlinear parametrizations sequentially in time. We first show that only adding constraints that aim to conserve quantities in continuous time can be insufficient because the nonlinear dependence on the parameters implies that even quantities that are linear in the solution fields become nonlinear in the parameters and thus are challenging to discretize in time. Instead, we propose Neural Galerkin schemes that compute at each time step an explicit embedding onto the manifold of nonlinearly parametrized solution fields to guarantee conservation of quantities. The embeddings can be combined with standard explicit and implicit time integration schemes. Numerical experiments demonstrate that the proposed approach conserves quantities up to machine precision.