Search arXivSearch

arXiv · 2404.18841

Deep orthogonal decomposition: a continuously adaptive data-driven approach to model order reduction

Abstract

We develop a novel deep learning technique, termed Deep Orthogonal Decomposition (DOD), for dimensionality reduction and reduced order modeling of parameter dependent partial differential equations. The approach consists in the construction of a deep neural network model that approximates the solution manifold through a continuously adaptive local basis. In contrast to global methods, such as Principal Orthogonal Decomposition (POD), the adaptivity allows the DOD to overcome the Kolmogorov barrier, making the approach applicable to a wide spectrum of parametric problems. Furthermore, due to its hybrid linear-nonlinear nature, the DOD can accommodate both intrusive and nonintrusive techniques, providing highly interpretable latent representations and tighter control on error propagation. For this reason, the proposed approach stands out as a valuable alternative to other nonlinear techniques, such as deep autoencoders. The methodology is discussed both theoretically and practically, evaluating its performances on problems featuring nonlinear PDEs, singularities, and parametrized geometries.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicola Rares Franco, Andrea Manzoni, Paolo Zunino, Jan S. Hesthaven. 2024-05-14. Deep orthogonal decomposition: a continuously adaptive data-driven approach to model order reduction. https://arxiv.org/abs/2404.18841

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA