Related papers: Numerical Evaluation of Harmonic Polylogarithms
Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…
The explicit formulas expressing harmonic sums via alternating Euler sums (colored multiple zeta values) are given, and some explicit evaluations are given as applications.
We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…
Hedges' unbiased estimator g* has been broadly used in statistics. We propose a sequence of polynomials to better approximate the multiplicative correction factor of g* by incorporating analytic estimations to the ratio of gamma functions.
In order to perform numerical studies of long-term stability in nonlinear Hamiltonian systems, one needs a numerical integration algorithm which is symplectic. Further, this algorithm should be fast and accurate. In this paper, we propose…
Multiple harmonic sums are iterated generalizations of harmonic sums. Recently Dilcher has considered congruences involving q-analogs of these sums in depth one. In this paper we shall study the homogeneous case for arbitrary depth by using…
Spaces of harmonic functions in upper half-space with controlled growth near the boundary are described in terms of multiresolution approximations. The results are applied to prove the law of the iterated logarithm for the oscillation of…
We define a parametric variant of generalized Euler sums and construct contour integration to give some explicit evaluations of these parametric Euler sums. In particular, we establish several explicit formulas of (Hurwitz) zeta functions,…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
The upcoming operation regimes of the Large Hadron Collider are going to place stronger requirements on the rejection of particles originating from pileup, i.e. from interactions between other protons. For this reason, particle weighting…
We describe a method for deriving logarithmic corrections in the mass ratio to the S-level of a hydrogen-like atom. With this method, a number of new corrections of this type are calculated analitically for the first time.
In these introductory lectures we discuss classes of presently known nested sums, associated iterated integrals, and special constants which hierarchically appear in the evaluation of massless and massive Feynman diagrams at higher loops.…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to…
It's well known that multiple polylogarithms give rise to good unipotent variations of mixed Hodge-Tate structures. In this paper we shall {\em explicitly} determine these structures related to multiple logarithms and some other multiple…
Spherical Harmonic Gaussian type orbitals and Slater functions can be expressed using spherical coordinates or a linear combinations of the appropriate Cartesian functions. General expressions for the transformation coefficients between the…
We estimate the nuclear polarizability correction to atomic transition frequencies in various helium isotopes. This effect is non-negligible for high precision tests of quantum electrodynamics or accurate determination of the nuclear charge…
Calculating the values of nuclear correlation functions is computationally intensive due to the fact that the number of terms in a nuclear wave function scales exponentially with atomic number. To speed up this computation, we represent a…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
Efficient fourth order symplectic integrators are proposed for numerical integration of separable Hamiltonian systems H(p,q)=T(p)+V(q). Symmetric splitting coefficients with five to nine stages are obtained by higher order decomposition of…