Related papers: A CWENO large time-step scheme for Hamilton--Jacob…
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such…
For linear and fully non-linear diffusion equations of Bellman-Isaacs type, we introduce a class of approximation schemes based on differencing and interpolation. As opposed to classical numerical methods, these schemes work for general…
A computationally efficient high-order solver is developed to compute the wall distances by solving the relevant partial differential equations, namely: Eikonal, Hamilton-Jacobi (HJ) and Poisson equations. In contrast to the upwind schemes…
We present a coordinate-free approach for constructing approximate first integrals of generalized slow-fast Hamiltonian systems, based on the global averaging method on parameter-dependent phase spaces with $\mathbb{S}^1 -$symmetry.…
We introduce efficient numerical methods for generic HJM equations of interest rate theory by means of high-order weak approximation schemes. These schemes allow for QMC implementations due to the relatively low dimensional integration…
We consider a semi-Lagrangian scheme for solving the minimum time problem, with a given target, and the associated eikonal type equation. We first use a discrete time deterministic optimal control problem interpretation of the time…
In this paper, we consider the task of efficiently computing the numerical solution of evolutionary complex Ginzburg--Landau equations on Cartesian product domains with homogeneous Dirichlet/Neumann or periodic boundary conditions. To this…
The solution of large systems of nonlinear differential equations is needed for many applications in science and engineering. In this study, we present three main improvements to existing quantum algorithms based on the Carleman…
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…
We develop a discrete analogue of Hamilton-Jacobi theory in the framework of discrete Hamiltonian mechanics. The resulting discrete Hamilton-Jacobi equation is discrete only in time. We describe a discrete analogue of Jacobi's solution and…
In this paper, we propose a high order conservative semi-Lagrangian scheme (SL) for the ellipsoidal BGK model of the Boltzmann transport equation. To avoid the time step restriction induced by the convection term, we adopt the…
We investigate high-order finite difference schemes for the Hamilton-Jacobi equation continuum limit of nondominated sorting. Nondominated sorting is an algorithm for sorting points in Euclidean space into layers by repeatedly removing…
A novel central weighted essentially non-oscillatory (central WENO; CWENO)-type scheme for the construction of high-resolution approximations to discontinuous solutions to hyperbolic systems of conservation laws is presented. This procedure…
In this work, we propose a numerical approach for simulations of large deformations of interfaces in a level set framework. To obtain a fast and viable numerical solution in both time and space, temporal discretization is based on the…
This work focuses on learning non-canonical Hamiltonian dynamics from data, where long-term predictions require the preservation of structure both in the learned model and in numerical schemes. Previous research focused on either facet,…
We examine the performance of various time propagation schemes using a one-dimensional model of the hydrogen atom. In this model the exact Coulomb potential is replaced by a soft-core interaction. The model has been shown to be a reasonable…
We develop a numerical scheme for solving the advection equation of $\mathbb{S}^2$-valued functions of real variables, which models the time-evolution of a $\mathbb{S}^2$-valued mapping on the real line by a known velocity field. The idea…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
An advantageous feature of piecewise constant policy timestepping for Hamilton-Jacobi-Bellman (HJB) equations is that different linear approximation schemes, and indeed different meshes, can be used for the resulting linear equations for…
We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…