Related papers: A linear implicit finite difference discretization…
For a generic discrete-time algorithm (DTA): $z^+=g(z,s)$, where $s$ is the step size, Lu (Math. Program., 194(1):1061--1112, 2022) proposed an $O(s^r)$-resolution ordinary differential equation (ODE) framework based on the backward error…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
To solve the Dirac equation with the finite difference method, one has to face up to the spurious-state problem due to the fermion doubling problem when using the conventional central difference formula to calculate the first-order…
An $hp$-discontinuous Galerkin (DG) method is applied to a class of second order linear hyperbolic integro-differential equations. Based on the analysis of an expanded mixed type Ritz-Volterra projection, {\it a priori} $hp$-error estimates…
In this paper, we consider a new approach for semi-discretization in time and spatial discretization of a class of semi-linear stochastic partial differential equations (SPDEs) with multiplicative noise. The drift term of the SPDEs is only…
Conventional finite-difference schemes for solving partial differential equations are based on approximating derivatives by finite-differences. In this work, an alternative theory is proposed which view finite-difference schemes as…
We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption…
In this paper, we propose and analyze an explicit time-stepping scheme for a spatial discretization of stochastic Cahn--Hilliard equation with additive noise. The fully discrete approximation combines a spectral Galerkin method in space…
We derive optimal order a posteriori error estimates in the $L^\infty(L^2)$ and $L^1(L^2)$-norms for the fully discrete approximations of time fractional parabolic differential equations. For the discretization in time, we use the $L1$…
A reaction-diffusion problem with a Caputo time derivative is considered. An integral discretization scheme on a graded mesh along with a decomposition of the exact solution is proposed. The truncation error estimate of the discretization…
We study stochastic optimization from a joint continuous-discrete point of view. Starting from a second-order stochastic differential equation interpreted as a noisy accelerated gradient flow, we discretize the dynamics by a fully implicit…
In this paper we consider discrete gradient methods for approximating the solution and preserving a first integral (also called a constant of motion) of autonomous ordinary differential equations. We prove under mild conditions for a large…
This paper introduces a fast and numerically stable algorithm for the solution of fourth-order linear boundary value problems on an interval. This type of equation arises in a variety of settings in physics and signal processing. Our method…
In this paper we prove optimal error estimates for {solutions with natural regularity} of the equations describing the unsteady motion of incompressible shear-thinning fluids. We consider a full space-time semi-implicit scheme for the…
The locally modified finite element method, which is introduced in [Frei, Richter: SINUM 52(2014), p. 2315-2334], is a simple fitted finite element method that is able to resolve weak discontinuities in interface problems. The method is…
Discrete gradient methods are a class of numerical integrators producing solutions with exact preservation of first integrals of ordinary differential equations. In this paper, we apply order theory combined with the symmetrized Itoh--Abe…
A semilinear initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. For L1-type discretizations of this…
Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…
We compute the rate of convergence of forward, backward and central finite difference $\theta$-schemes for linear PDEs with an arbitrary odd order spatial derivative term. We prove convergence of the first or second order for smooth and…
For a singular integral equation on an interval of the real line, we study the behavior of the error of a delta-delta discretization. We show that the convergence is non-uniform, between order $O(h^{2})$ in the interior of the interval and…