Related papers: New Approximation method for the computation of pa…
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…
We formulate a parametrized uniformly absolutely globally convergent series of $\zeta$(s) denoted by Z(s, x). When expressed in closed form, it is given by Z(s, x) = (s -- 1)$\zeta$(s) + 1 x Li s z z -- 1 dz, where Li s (x) is the…
We give expressions for all generalized polylogarithms up to weight four in terms of the functions log, $\text{Li}_n$, and $\text{Li}_{2,2}$, valid for arbitrary complex variables. Furthermore we provide algorithms for manipulation and…
Special functions like the polygamma, Hurwitz zeta, and Lerch zeta functions have sporadically been connected with the nth derivatives of trigonometric functions. We show the polylogarithm $\text{Li}_s(z)$, a function of complex argument…
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate…
The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let $n$ denote the size of the array. Simple $O(n\log n)$ algorithms are known for this problem. We develop a polylogarithmic time randomized…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
Given a multiset $X=\{x_1,..., x_n\}$ of real numbers, the {\it floating-point set summation} problem asks for $S_n=x_1+...+x_n$. Let $E^*_n$ denote the minimum worst-case error over all possible orderings of evaluating $S_n$. We prove that…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the Subset Sum problem asks to determine whether there exists a subset of $S$ that sums up to $t$. The current best deterministic algorithm, by Koiliaris and Xu…
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l…
We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…
The paper revisits the robust $s$-$t$ path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with $n$ vertices and $k$ distinct cost functions (scenarios) defined over edges,…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…
Lee, in a series of papers, described a unified formulation of the statistical thermodynamics of ideal quantum gases in terms of the polylogarithm functions, $\textup{Li}_{s} (z)$. It is aimed here to investigate the functions…
We use visible point vector identities to examine polylogarithms in the neighbourhood of the Riemann zeta function zeroes. New formulas limiting to the trivial zeroes and to the critical line on the zeta function are given. Similar results…