Related papers: Numerical Evaluation of Harmonic Polylogarithms
Extraction of harmonics of a given order from real trigonometric polynomials (signals) is one of the main problems in harmonic analysis. It has many applications in physics, radio and electrical engineering, in particular, in filtration of…
A generalization of a recently introduced recursive numerical method for the exact evaluation of integrals of regular solid harmonics and their normal derivatives over simplex elements in $\mathbb{R}^3$ is presented. The original Quadrature…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
This article presents a high-order accurate numerical method for the evaluation of singular volume integral operators, with attention focused on operators associated with the Poisson and Helmholtz equations in two dimensions. Following the…
The method of geometric harmonics is adapted to the situation of incomplete data by means of the iterated geometric harmonics (IGH) scheme. The method is tested on natural and synthetic data sets with 50--500 data points and dimensionality…
In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations…
In the present paper, we introduce the concept of harmonic Tutte polynomials of matroids and discuss some of their properties. In particular, we generalize Greene's theorem, thereby expressing harmonic weight enumerators of codes as…
We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
The goal of the load flow study is to ensure that electrical power is delivered efficiently and reliably to end-users while maintaining the stability and security of the power system. Newton-Raphson is a numerical method used widely for…
An improved algorithm to evaluate the nonrelativistic three-electron Hylleraas-Configuration Interaction (Hy-CI) kinetic energy integrals over Slater orbitals and the Hamiltonian in Hylleraas coordinates is shown. The resulting analytical…