Related papers: Nonsmooth data error estimates for exponential Run…
In view of training increasingly complex learning architectures, we establish a nonsmooth implicit function theorem with an operational calculus. Our result applies to most practical problems (i.e., definable problems) provided that a…
In this work, we introduce high-order Basis-Update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators extend the BUG integrator to arbitrary…
In this paper, the weak convergence about the discretization error of stochastic iterated integrals in the Skorohod sense are studied, while the integrands and integrators of iterated integrals are supposed to be semimartingales with jumps.…
We propose an Exponential DG approach for numerically solving partial differential equations (PDEs). The idea is to decompose the governing PDE operators into linear (fast dynamics extracted by linearization) and nonlinear (the remaining…
A mixed accuracy framework for Runge--Kutta methods presented in [Grant, JSC 2022] has been shown to speed up the computation in diagonally implicit Runge--Kutta (DIRK) methods by using less expensive low accuracy approaches for the…
We study a variant of the Strang splitting for the time integration of the semilinear wave equation under the finite-energy condition on the torus $\mathbb{T}^3$. In the case of a cubic nonlinearity, we show almost second-order convergence…
In this paper, we present explicit and computable error bounds for the asymptotic expansions of the Hermite polynomials with Plancherel--Rotach scale. Three cases, depending on whether the scaled variable lies in the outer or oscillatory…
The paper presents a multiplicative bias reduction estimator for nonparametric regression. The approach consists to apply a multiplicative bias correction to an oversmooth pilot estimator. In Burr et al. [2010], this method has been tested…
A linear evolving surface partial differential equation is first discretized in space by an arbitrary Lagrangian Eulerian (ALE) evolving surface finite element method, and then in time either by a Runge-Kutta method, or by a backward…
We consider the numerical approximation of general semilinear parabolic stochastic partial differential equations (SPDEs) driven by additive space-time noise. In contrast to the standard time stepping methods which uses basic increments of…
We consider the initial/boundary value problem for the fractional diffusion and diffusion-wave equations involving a Caputo fractional derivative in time. We develop two "simple" fully discrete schemes based on the Galerkin finite element…
The reliability and precision of numerically solving stochastic non-Markovian equations by standard numerical codes, more specifically, with the fourth-order Runge-Kutta routine for solving differential equations, is gauged by comparing the…
We note a fact that stiff systems or differential equations that have highly oscillatory solutions cannot be solved efficiently using conventional methods. In this paper, we study two new classes of exponential Runge-Kutta (ERK) integrators…
Computer simulations in QCD are based on the discretization of the theory on a Euclidean lattice. To compute the mean value of an observable, usually the Hybrid Monte Carlo method is applied. Here equations of motion, derived from an…
Mixed precision Runge--Kutta methods have been recently developed and used for the time-evolution of partial differential equations. Two-derivative Runge--Kutta schemes may offer enhanced stability and accuracy properties compared to…
Functions that are not differentiable in the classical sense have become a central tool in modern mathematical models for imaging, inverse problems, machine learning, and optimal control of differential equations. These models are…
In two recent publications [Kov{\'a}cs, Larsson, and Mesforush, SIAM J. Numer. Anal. 49(6), 2407-2429, 2011] and [Furihata, et al., SIAM J. Numer. Anal. 56(2), 708-731, 2018], strong convergence of the semi-discrete and fully discrete…
We determine the expected error by smoothing the data locally. Then we optimize the shape of the kernel smoother to minimize the error. Because the optimal estimator depends on the unknown function, our scheme automatically adjusts to the…
Deriving analytical solutions of ordinary differential equations is usually restricted to a small subset of problems and numerical techniques are considered. Inevitably, a numerical simulation of a differential equation will then always be…
A novel symplectic integrator for Hamiltonian equations on $S_2^n \times T^{\ast} \RR^m$ is developed and studied. Partitioned Runge--Kutta methods for Hamiltonian systems on products of Hamiltionian manifolds are studied, specifically,…