相关论文: Deep Hilbert--Galerkin Methods for Infinite-Dimens…

Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…

Correlated with the trend of increasing degrees of freedom in robotic systems is a similar trend of rising interest in Spatio-Temporal systems described by Partial Differential Equations (PDEs) among the robotics and control communities.…

We present a fully iterative adaptive algorithm for the numerical minimization of strongly convex energy functionals in Hilbert spaces. The proposed approach, which we first present in abstract form, generates a hierarchical sequence of…

The first super-convergent hybridisable discontinuous Galerkin (HDG) method for linear elastic problems capable of using the same degree of approximation for both the primal and mixed variables is presented. The key feature of the method is…

Within the framework of parameter dependent PDEs, we develop a constructive approach based on Deep Neural Networks for the efficient approximation of the parameter-to-solution map. The research is motivated by the limitations and drawbacks…

The approximation capabilities of Deep Q-Networks (DQNs) are commonly justified by general Universal Approximation Theorems (UATs) that do not leverage the intrinsic structural properties of the optimal Q-function, the solution to a Bellman…

We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element…

We present approximation results and numerical experiments for the use of randomized neural networks within physics-informed extreme learning machines to efficiently solve high-dimensional PDEs, demonstrating both high accuracy and low…

We deal with a class of semilinear parabolic PDEs on the space of continuous functions that arise, for example, as Kolmogorov equations associated to the infinite-dimensional lifting of path-dependent SDEs. We investigate existence of…

Developing algorithms for solving high-dimensional partial differential equations (PDEs) has been an exceedingly difficult task for a long time, due to the notoriously difficult problem known as the "curse of dimensionality". This paper…

High-order Discontinuous Galerkin Spectral Element Methods (DGSEM) provide excellent accuracy for complex flow simulations, but their computational cost increases sharply with higher polynomial orders. %that provide very accurate solutions.…

We here consider optimal control problems governed by nonlinear stochastic equations on a Hilbert space H with nonconvex payoff, which is rewritten as a deterministic optimal control problem governed by a Kolmogorov equation in H. We prove…

We propose two algorithms for the solution of the optimal control of ergodic McKean-Vlasov dynamics. Both algorithms are based on approximations of the theoretical solutions by neural networks, the latter being characterized by their…

In this paper we consider the numerical approximation of infinite horizon problems via the dynamic programming approach. The value function of the problem solves a Hamilton-Jacobi-Bellman (HJB) equation that is approximated by a fully…

Universal approximation theorems establish the expressive capacity of neural network architectures. For dynamical systems, existing results are limited to finite time horizons or systems with a globally stable equilibrium, leaving…

We study a fourth-order div problem and its approximation by the discontinuous Petrov-Galerkin method with optimal test functions. We present two variants, based on first and second-order systems. In both cases we prove well-posedness of…

In this two-part study, we develop a general theory of the so-called exact augmented Lagrangians for constrained optimization problems in Hilbert spaces. In contrast to traditional nonsmooth exact penalty functions, these augmented…

We study linear and nonlinear PDEs defined on the space of $\mathcal{P}(\mathbb{T}^d)$ over the flat torus $\mathbb{T}^d$, equipped with the Dirichlet-Ferguson measure $\mathcal{D}$. We first develop an analytic framework based on the…

The method of generalized Hamilton-Jacobi-Bellman equations (GHJB) is a powerful way of creating near-optimal controllers by learning. It is based on the fact that if we have a feedback controller, and we learn to compute the gradient…

We present two effective methods for solving high-dimensional partial differential equations (PDE) based on randomized neural networks. Motivated by the universal approximation property of this type of networks, both methods extend the…