Abstract. We consider a numerical scheme for Hamilton–Jacobi equations based on a direct discretization of the Lax–Oleinik semi–group. We prove that this method is convergent...
We further study the properties of the back and forth error compensation and correction (BFECC) method for advection equations such as those related to the level set method and fo...
We find the weak rate of convergence of the spatially semidiscrete finite element approximation of the nonlinear stochastic heat equation. Both multiplicative and additive noise ...
We study analytical properties of the Toro-Titarev solver for generalized Riemann problems (GRPs), which is the heart of the flux computation in ADER generalized Godunov schemes. ...
Abstract. The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial ...
Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zim...