Related papers: Explicit error bound of the fast multipole method …
In this work, we consider the numerical solution of an initial boundary value problem for the distributed order time fractional diffusion equation. The model arises in the mathematical modeling of ultra-slow diffusion processes observed in…
We introduce the Fast Free Memory method (FFM), a new fast method for the numerical evaluation of convolution products. Inheriting from the Fast Multipole Method, the FFM is a descent-only and kernel-independent algorithm. We give the…
In the author's previous paper (Zhang et al. 2022), exponential convergence was proved for the perfectly matched layers (PML) approximation of scattering problems with periodic surfaces in 2D. However, due to the overlapping of…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
This paper proposes a novel method, Explicit Flow Matching (ExFM), for training and analyzing flow-based generative models. ExFM leverages a theoretically grounded loss function, ExFM loss (a tractable form of Flow Matching (FM) loss), to…
In this paper, we present a fast multipole method (FMM) for solving the two-dimensional Laplace equation in a half-plane with Robin boundary conditions. The method is based on a novel expansion theory for the reaction component of the…
In this paper, we consider the obstacle scattering problem for biharmonic equations with a Dirichlet boundary condition in both two and three dimensions. Some basic properties are first derived for the biharmonic scattering solutions, which…
Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of an exact real with value + error pair of floating-point numbers. Normally, value + error sum…
The multiple-Dirichlet-to-Neumann (multiple-DtN) non-reflecting boundary condition is adapted to acoustic scattering from obstacles embedded in the half-plane. The multiple-DtN map is coupled with the method of images as an alternative…
We introduce the multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficient $a=\exp(Z)$ where $Z$ is a Gaussian random field defined by an infinite series expansion $Z(\boldsymbol{y}) =…
Computing at the exascale level is expected to be affected by a significantly higher rate of faults, due to increased component counts as well as power considerations. Therefore, current day numerical algorithms need to be reexamined as to…
We consider second-order PDE problems set in unbounded domains and discretized by Lagrange finite elements on a finite mesh, thus introducing an artificial boundary in the discretization. Specifically, we consider the reaction diffusion…
The paper develops an explicit a priori error estimate for finite element solution to nonhomogeneous Neumann problems. For this purpose, the hypercircle equation over finite element spaces is constructed and the explicit upper bound of the…
This article devotes to developing robust but simple correction techniques and efficient algorithms for a class of second-order time stepping methods, namely the shifted fractional trapezoidal rule (SFTR), for subdiffusion problems to…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
This paper proposes a fast time-domain boundary element method (TDBEM) to solve three-dimensional transient electromagnetic scattering problems regarding perfectly electric conductors in the classical marching-on-in-time manner. The…
We consider a finite volume scheme with two-point flux approximation (TPFA) to approximate a Laplace problem when the solution exhibits no more regularity than belonging to $H^1_0(\Omega)$. We establish in this case some error bounds for…
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…
Diffusion probabilistic models (DPMs), while effective in generating high-quality samples, often suffer from high computational costs due to their iterative sampling process. To address this, we propose an enhanced ODE-based sampling method…
Bayesian procedures designed to quantify truncation errors in perturbative calculations of quantum chromodynamics observables are adapted to expansions in effective field theory (EFT). In the Bayesian approach, such truncation errors are…