相关论文: A new variational principle for the Euclidean dist…

Efficient simulation of the Navier-Stokes equations for fluid flow is a long standing problem in applied mathematics, for which state-of-the-art methods require large compute resources. In this work, we propose a data-driven approach that…

We propose a linear finite-element discretization of Dirichlet problems for static Hamilton-Jacobi equations on unstructured triangulations. The discretization is based on simplified localized Dirichlet problems that are solved by a local…

This manuscript is dedicated to the numerical approximation of super-linear slow-fast stochastic differential equations (SFSDEs). Borrowing the heterogeneous multiscale idea, we propose an explicit multiscale Euler-Maruyama scheme suitable…

A new computational algorithm, the discrete singular convolution (DSC), is introduced for computational electromagnetics. The basic philosophy behind the DSC algorithm for the approximation of functions and their derivatives is studied.…

The l1/l2 ratio regularization function has shown good performance for retrieving sparse signals in a number of recent works, in the context of blind deconvolution. Indeed, it benefits from a scale invariance property much desirable in the…

We build a simple and general class of finite difference schemes for first order Hamilton-Jacobi (HJ) Partial Differential Equations. These filtered schemes are convergent to the unique viscosity solution of the equation. The schemes are…

We consider the fundamental task of optimising a real-valued function defined in a potentially high-dimensional Euclidean space, such as the loss function in many machine-learning tasks or the logarithm of the probability distribution in…

This paper presents a new finite difference algorithm for solving the 2D one-way wave equation with a preliminary approximation of a pseudo-differential operator by a system of partial differential equations. As opposed to the existing…

We prove a global fractional differentiability result via the fractional Caccioppoli-type estimate for solutions to nonlinear elliptic problems with measure data. This work is in fact inspired by the recent paper [B. Avelin, T. Kuusi, G.…

A unified explicit form for difference formulas to approximate the fractional and classical derivatives is presented. The formula gives finite difference approximations for any classical derivatives with a desired order of accuracy at nodal…

We propose a novel approach to numerically approximate McKean-Vlasov stochastic differential equations (MV-SDE) using stochastic gradient descent (SGD) while avoiding the use of interacting particle systems (IPS) {and the associated…

This paper aims to investigate the numerical approximation of semilinear non-autonomous stochastic partial differential equations (SPDEs) driven by multiplicative or additive noise. Such equations are more realistic than autonomous SPDEs…

This paper presents a directional proximal point method (DPPM) to derive the minimum of any C1-smooth function f. The proposed method requires a function persistent a local convex segment along the descent direction at any non-critical…

Here we consider the following fractional Hamiltonian system \begin{equation*} \begin{cases} \begin{aligned} (-\Delta)^{s} u&=H_v(u,v) \;\;&&\text{in}~\Omega,\\ (-\Delta)^{s} v&=H_u(u,v) &&\text{in}~\Omega,\\ u &= v = 0 &&\text{in} ~…

A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…

We consider the stochastic Cahn-Hilliard equation driven by additive Gaussian noise in a convex domain with polygonal boundary in dimension $d\le 3$. We discretize the equation using a standard finite element method in space and a fully…

In this paper we consider convergence rate problems for stochastic strongly-convex optimization in the non-Euclidean sense with a constraint set over a time-varying multi-agent network. We propose two efficient non-Euclidean stochastic…

An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…

We introduce generalised finite difference methods for solving fully nonlinear elliptic partial differential equations. Methods are based on piecewise Cartesian meshes augmented by additional points along the boundary. This allows for…

In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this…