Related papers: Fast Ramanujan-type Series for Logarithms. Part I

Compression techniques that support fast random access are a core component of any information system. Current state-of-the-art methods group documents into fixed-sized blocks and compress each block with a general-purpose adaptive…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

Proving linear inequalities and identities of Shannon's information measures, possibly with linear constraints on the information measures, is an important problem in information theory. For this purpose, ITIP and other variant algorithms…

The Gauss hypergeometric function ${}_2F_1(a,b,c;z)$ can be computed by using the power series in powers of $z, z/(z-1), 1-z, 1/z, 1/(1-z),(z-1)/z$. With these expansions ${}_2F_1(a,b,c;z)$ is not completely computable for all complex…

This paper is concerned with the exact solution of mixed-integer programs (MIPs) over the rational numbers, i.e., without any roundoff errors and error tolerances. Here, one computational bottleneck that should be avoided whenever possible…

We give an elementary proof of some identities that express the squares of Riemann zeta function at integer points in terms of the series involving hyperbolic functions, digamma function, Bernoulli numbers etc. In this version, inaccuracies…

A tutorial on what later became to be known as WZ theory, as well as a motivated account of the seminal Gosper algorithm.

We consider the well-studied Robust $(k, z)$-Clustering problem, which generalizes the classic $k$-Median, $k$-Means, and $k$-Center problems. Given a constant $z\ge 1$, the input to Robust $(k, z)$-Clustering is a set $P$ of $n$ weighted…

By employing the classical tools from the theory of $q$-series and theta functions, new fascinating identities on different continued fractions can be achieved. In this article, we use the product expansion of Jacobi's theta function to…

Efficient Latin hypercube designs (LHDs), including maximin distance LHDs, maximum projection LHDs and orthogonal LHDs, are widely used in computer experiments. It is challenging to construct such designs with flexible sizes, especially for…

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra…

Applications in machine learning and data mining require computing pairwise Lp distances in a data matrix A. For massive high-dimensional data, computing all pairwise distances of A can be infeasible. In fact, even storing A or all pairwise…

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…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

This paper is the third in a series exploring Frobenius's method for $A$-hypergeometric systems. Frobenius's method is a classical technique for constructing logarithmic series solutions of differential equations by perturbing exponents of…

This paper develops a new class of algorithms for general linear systems and eigenvalue problems. These algorithms apply fast randomized sketching to accelerate subspace projection methods, such as GMRES and Rayleigh--Ritz. This approach…

We develop a new real-variable method for weighted $L^p$ estimates. The method is applied to the study of weighted $W^{1, 2}$ estimates in Lipschitz domains for weak solutions of second-order elliptic systems in divergence form with bounded…

Based on the notion of Stark units we present a new approach that obtains refinements of log-algebraic identities for Anderson t-modules. As a consequence, we establish a generalization of Chang's theorem on logarithmic interpretations for…

In this article using the theory of Eisenstein series, we give rise to the complete evaluation of two Gauss hypergeometric functions. Moreover we evaluate the modulus of each of these functions and the values of the functions in terms of…