Structure preserving model reduction of parametric Hamiltonian systems

Jan Sickmann Hesthaven, Babak Maboudi Afkham
2017
Article

Résumé

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.

Official source

https://infoscience.epfl.ch/record/217484?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

Physics-informed machine learning for reduced-order modeling of nonlinear problems

Jan Sickmann Hesthaven, Qian Wang

A physics-informed machine learning framework is developed for the reduced-order modeling of parametrized steady-state partial differential equations (PDEs). During the offline stage, a reduced basis is extracted from a collection of high-fidelity solutions and a reduced-order model is then constructed by a Galerkin projection of the full-order model onto the reduced space. A feedforward neural network is used to approximate the mapping from the physical/geometrical parameters to the reduced coefficients. The network can be trained by minimizing the mean squared residual error of the reduced-order equation on a set of points in parameter space. Such a network is referred to as physics-informed neural network (PINN). As the number of residual points is unlimited, a large data set can be generated to train a PINN to approximate the reduced-order model. However, the accuracy of such a network is often limited. This is improved by using the high-fidelity solutions that are generated to extract the reduced basis. The network is then trained by minimizing the sum of the mean squared residual error of the reduced-order equation and the mean squared error between the network output and the projection coefficients of the high-fidelity solutions. For complex nonlinear problems, the projection of high-fidelity solution onto the reduced space is more accurate than the solution of the reduced-order equation. Therefore, higher accuracy than the PINN for this network - referred to as physics-reinforced neural network (PRNN) - can be expected for complex nonlinear problems. Numerical results demonstrate that the PRNN is more accurate than the PINN and both are more accurate than a purely data-driven neural network for complex problems. During the reduced basis refinement, before reaching its accuracy limit, the PRNN obtains higher accuracy than the direct reduced-order model based on a Galerkin projection.

2020

Chargement

In this work, we focus on the Dynamical Low Rank (DLR) approximation of PDEs equations with random parameters. This can be interpreted as a reduced basis method, where the approximate solution is expanded in separable form over a set of few deterministic basis functions at each time, with the peculiarity that both the deterministic modes and the stochastic coefficients are computed on the fly and are free to adapt in time so as best describe the structure of the random solution. Our first goal is to generalize and reformulate in a variational setting the Dynamically Orthogonal (DO) method, proposed by Sapsis and Lermusiaux (2009) for the approximation of fluid dynamic problems with random initial conditions. The DO method is reinterpreted as a Galerkin projection of the governing equations onto the tangent space along the approximate trajectory to the manifold M_S , given by the collection of all functions which can be expressed as a sum of S linearly independent deterministic modes combined with S linearly independent stochastic modes. Depending on the parametrization of the tangent space, one obtains a set of nonlinear differential equations, suitable for numerical integration, for both the coefficients and the basis functions of the approximate solution. By formalizing the DLR variational principle for parabolic PDEs with random parameters we establish a precise link with similar techniques developed in different contexts such as the Multi-Configuration Time-Dependent Hartree method in quantum dynamics and the Dynamical Low-Rank approximation in the finite dimensional setting. By the use of curvature estimates for the approximation manifold M_S , we derive a theoretical bound for the approximation error of the S-terms DO solution by the corresponding S-terms best approximation at each time instant. The bound is applicable for full rank DLR approximate solutions on the largest time interval in which the best S-terms approximation is continuously differentiable in time. Secondly, we focus on parabolic equations, especially incompressible Navier-Stokes equations, with random Dirichlet boundary conditions and we propose a DLR technique which allows for the strong imposition of such boundary conditions. We show that the DLR variational principle can be set in the constrained manifold of all S rank random fields with a prescribed value on the boundary, expressed in low-rank format, with rank M smaller than S. We characterize the tangent space to the constrained manifold by means of the Dual Dynamically Orthogonal formulation, in which the stochastic modes are kept orthonormal and the deterministic modes satisfy suitable boundary conditions, consistent with the original problem. The same formulation is also used to conveniently include the incompressibility constraint when dealing with incompressible Navier-Stokes equations with random parameters. Finally, we extend the DLR approach for the approximation of wave equations with random parameters. We propose the Symplectic DO method, according to which the governing equation is rewritten in Hamiltonian form and the approximate solution is sought in the low dimensional manifold of all complex-valued random fields with fixed rank. Recast in the real setting, the approximate solution is expanded over a set of a few dynamical symplectic deterministic modes and satisfies the symplectic projection of the Hamiltonian system into the tangent space of the approximation manifold along the trajectory.

EPFL2017

Chargement

Symplectic Model-Reduction with a Weighted Inner Product

Jan Sickmann Hesthaven, Babak Maboudi Afkham

In the recent years, considerable attention has been paid to preserving structures and invariants in reduced basis methods, in order to enhance the stability and robustness of the reduced system. In the context of Hamiltonian systems, symplectic model reduction seeks to construct a reduced system that preserves the symplectic symmetry of Hamiltonian systems. However, symplectic methods are based on the standard Euclidean inner products and are not suitable for problems equipped with a more general inner product. In this paper we generalize symplectic model reduction to allow for the norms and inner products that are most appropriate to the problem while preserving the symplectic symmetry of the Hamiltonian systems. To construct a reduced basis and accelerate the evaluation of nonlinear terms, a greedy generation of a symplectic basis is proposed. Furthermore, it is shown that the greedy approach yields a norm bounded reduced basis. The accuracy and the stability of this model reduction technique is illustrated through the development of reduced models for a vibrating elastic beam and the sine-Gordon equation.

2018

Chargement

Physics-informed machine learning for reduced-order modeling of nonlinear problems

Jan Sickmann Hesthaven, Qian Wang

2020

EPFL2017