Related papers: Parameter optimization in differential geometry ba…
A strategy to construct physics-based local surrogate models for parametric Stokes flows and coupled Stokes-Darcy systems is presented. The methodology relies on the proper generalized decomposition (PGD) method to reduce the dimensionality…
We develop, analyze, and experimentally explore residual-based loss functions for machine learning of parameter-to-solution maps in the context of parameter-dependent families of partial differential equations (PDEs). Our primary concern is…
The development and application of the Discontinuous Galerkin (DG) method have attracted great attention in computational fluid dynamics (CFD) com- munity in the past decades. The underlying reason for such an intensive investigation is due…
This paper constitutes our initial effort in developing sparse grid discontinuous Galerkin (DG) methods for high-dimensional partial differential equations (PDEs). Over the past few decades, DG methods have gained popularity in many…
We explore how neural differential equations (NDEs) may be trained on highly resolved fluid-dynamical models of unresolved scales providing an ideal framework for data-driven parameterizations in climate models. NDEs overcome some of the…
Domain Generalization (DG) is a critical area that focuses on developing models capable of performing well on data from unseen distributions, which is essential for real-world applications. Existing approaches primarily concentrate on…
For the purpose of finding benchmark quality solutions to time dependent Sn transport problems, we develop a numerical method in a Discontinuous Galerkin (DG) framework that utilizes time dependent cell edges, which we call a moving mesh,…
The DG algorithm is a powerful method for solving pdes, especially for evolution equations in conservation form. Since the algorithm involves integration over volume elements, it is not immediately obvious that it will generalize easily to…
The accurate numerical simulation of turbulent incompressible flows is a challenging topic in computational fluid dynamics. For discretisation methods to be robust in the under-resolved regime, mass conservation as well as energy stability…
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
Differential equation models are crucial to scientific processes. The values of model parameters are important for analyzing the behaviour of solutions. A parameter is called globally identifiable if its value can be uniquely determined…
In this paper we propose a new spatially high order accurate semi-implicit discontinuous Galerkin (DG) method for the solution of the two dimensional incompressible Navier-Stokes equations on staggered unstructured curved meshes. While the…
We propose a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrained convex quadratic programming [J.J. Mor\'e and G.…
In this work we apply the Deep Galerkin Method (DGM) described in Sirignano and Spiliopoulos (2018) to solve a number of partial differential equations that arise in quantitative finance applications including option pricing, optimal…
We propose an arbitrarily high-order globally divergence-free entropy stable nodal discontinuous Galerkin (DG) method to directly solve the conservative form of the ideal MHD equations using appropriate quadrature rules. The method ensures…
We study Hibridizable Discontinuous Galerkin (HDG) discretizations for a class of non-linear interior elliptic boundary value problems posed in curved domains where both the source term and the diffusion coefficient are non-linear. We…
Many applications require minimizing a family of optimization problems indexed by some hyperparameter $\lambda \in \Lambda$ to obtain an entire solution path. Traditional approaches proceed by discretizing $\Lambda$ and solving a series of…
We present a well-balanced nodal discontinuous Galerkin (DG) scheme for compressible Euler equations with gravity. The DG scheme makes use of discontinuous Lagrange basis functions supported at Gauss-Lobatto-Legendre (GLL) nodes together…
Using gradient descent (GD) with fixed or decaying step-size is a standard practice in unconstrained optimization problems. However, when the loss function is only locally convex, such a step-size schedule artificially slows GD down as it…
This paper presents a general description of a parameter estimation inverse problem for systems governed by nonlinear differential equations. The inverse problem is presented using optimal control tools with state constraints, where the…