Related papers: Numerical methods and arbitrary-precision computat…
We applied the method of finite-part integration [Galapon E.A Proc.R.Soc A 473, 20160567(2017)] to evaluate in closed-form the exact one-loop integral representations of the Heisenberg-Euler Lagrangian from QED for a constant electric field…
For transcendental functions that solve non-linear $q$-difference equations, the best descriptions available are the ones obtained by expansion near critical points at the origin and infinity. We describe such solutions of a $q$-discrete…
If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution,…
We present a unified treatment of the Fourier spectra of spherically symmetric nonlocal diffusion operators. We develop numerical and analytical results for the class of kernels with weak algebraic singularity as the distance between source…
In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincar{\'e}-type expansions for large values of the argument $z$ and uniform…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
In basic computational physics classes, students often raise the question of how to compute a number that exceeds the numerical limit of the machine. While technique of avoiding overflow/underflow has practical application in the electrical…
The Euler product formula relates Dirichlet $L(s,\chi)$ functions to an infinite product over primes, and is known to be valid for $\Re (s) >1$, where it converges absolutely. We provide arguments that the formula is actually valid for $\Re…
At the negative integers, there is a simple relation between the Lerch $\Phi$ function and the polylogarithm. Starting from that relation and a formula for the polylogarithm at the negative integers known from the literature, we can deduce…
A procedure is suggested for testing the resolution and comparing the relative accuracy of numerical schemes for integration of the incompressible Euler equations.
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
We use an iteration procedure propped up by a a classical form of the maximum principle to show the existence of solutions to a nonlinear Poisson equation with Dirichlet boundary conditions. These methods can be applied to the case of…
The asymptotic expansion of digamma function is a starting point for the derivation of approximants for harmonic sums or Euler-Mascheroni constant. It is usual to derive such approximations as values of logarithmic function, which leads to…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu…
In a previous paper it was shown that the Forward Euler method applied to differential inclusions where the right-hand side is a Lipschitz continuous set-valued function with uniformly bounded, compact values, converges with rate one. The…
In this paper, we formulate a new \emph{multiple-correction method}. The goal is to accelerate the rate of convergence. In particular, we construct some sequences to approximate the Euler-Mascheroni and Landau constants, which are faster…