Related papers: Numerical Evaluation of Harmonic Polylogarithms
We present a simple representation for analytically continued nested harmonic sums for the arbitrary complex argument. This representation can be obtained for a wide range of nested harmonic sums from a precomputed database for the pole…
Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…
We show that a polynomial H(N) of degree N of a harmonic oscillator hamiltonian allows us to devise a fully solvable continuous quantum system for which the first N discrete energy eigenvalues can be chosen at will. In general such a choice…
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…
We give explicit evaluations of the linear and non-linear Euler sums of hyperharmonic numbers $h_{n}^{\left( r\right) }$ with reciprocal binomial coefficients. These evaluations enable us to extend closed form formula of Euler sums of…
A convenient way to calculate $N$-particle quantum partition functions is by confining the particles in a weak harmonic potential instead of using a finite box or periodic boundary conditions. There is, however, a slightly different…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
In this paper we presents an algorithm for finding a solution of the linear nonhomogeneous quaternionic-valued differential equations. Moveover, several examples shows the feasibility of our algorithm.
We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process…
Motivated by Wilmshurst's conjecture, we investigate the zeros of harmonic polynomials. We utilize a certified counting approach which is a combination of two methods from numerical algebraic geometry: numerical polynomial homotopy…
Numerically estimating the integral of functions in high dimensional spaces is a non-trivial task. A oft-encountered example is the calculation of the marginal likelihood in Bayesian inference, in a context where a sampling algorithm such…
We present an algorithm for the numerical evaluation of elliptic multiple polylogarithms for arbitrary arguments and to arbitrary precision. The cornerstone of our approach is a procedure to obtain a convergent $q$-series representation of…
We present a semi-numerical method to compute one-loop corrections to multi-leg processes. We apply the method to the study of Higgs plus four parton and six gluon amplitudes.
We present a semi-numerical algorithm to calculate one-loop virtual corrections to scattering amplitudes. The divergences of the loop amplitudes are regulated using dimensional regularization. We treat in detail the case of amplitudes with…
Shift of higher harmonic peak in the spectrum of synchrotron radiation with increasing energy of the radiating particle is investigated by numerical method. Calculations were carried out for the range till 100 harmonics for all polarization…
We use the Hellman-Feynman (HF) and Hypervirial (HV) theorems, to calculate the perturbative coefficients of the eigenenergies formal series, in the case of the Coulomb potential with a radial linear term and the radial quartic anharmonic…
Using heuristic arguments alone, based on the properties of the wavefunctions, we obtain the energy eigenvalues and the corresponding eigenfunctions of the one-dimensional harmonic oscillator. This approach is considerably simpler and is…
The harmonic Lagrange top is the Lagrange top plus a quadratic (harmonic) potential term. We describe the top in the space fixed frame using a global description with a Poisson structure on $T^*S^3$. This global description naturally leads…
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
A numerical method to build an orthonormal basis of properly symmetrized hyperspherical harmonic functions is developed. As a part of it, refined algorithms for calculating the transformation coefficients between hyperspherical harmonics…