Related papers: An efficient algorithm for accelerating the conver…
We study the incomplete Mellin transformation of the fractional part and the related log-sine function when composed by an affine complex map. We evaluate the corresponding integral in two different ways which yields equalities with series…
We extend the Faulhaber formula to the whole complex plane, obtaining an expression that fully resembles the Euler-Maclaurin summation formula, only it's exact. Thereafter, an expression for the generalized harmonic progressions valid in…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
The author derives new family of series representations for the values of the Riemann Zeta function $\zeta(s)$ at positive odd integers. For $n\in\mathbb{N}$, each of these series representing $\zeta(2n+1)$ converges remarkably rapidly with…
Relying on the Hurwitz formula, we find sums of the series over sine and cosine functions through the Hurwitz zeta function. Using another summation formula for these trigonometric series, we find finite sums of some series over the Riemann…
A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…
For Hurwitz Zeta function,we consider its Taylor series expansion about various points as an analytic function of second variable in appropriate discs.We show that these Taylor are all polynomials in second variable for a non positive…
The Uzawa algorithm is an iterative method for the solution of saddle-point problems, which arise in many applications, including fluid dynamics. Viewing the Uzawa algorithm as a fixed- point iteration, we explore the use of Anderson…
The generalized Stieltjes constants $\gamma\_n(v)$ are, up to a simple scaling factor, the Laurent series coefficients of the Hurwitz zeta function $\zeta(s,v)$ about its unique pole $s = 1$. In this work, we devise an efficient algorithm…
For $\chi_k$ a self$-$dual primitive Dirichlet character mod $k$ several reduced identities of Dirichlet $L-$functions $L_k(s):=L(s,\chi_k)$, expressed as linear combinations of Hurwitz $\zeta$ functions, are found for $s=2,3$ and some…
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 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$…
The Epstein zeta function generalizes the Riemann zeta function to oscillatory lattice sums in higher dimensions. Beyond its numerous applications in pure mathematics, it has recently been identified as a key component in simulating exotic…
A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…
This paper describes a practical methodology for computing the Hardy function Z(t), using just O(((t/epsilon)^(1/3))*(log(t))^(2+o(1)))) standard computational operations, to a tolerance of epsilon in the relative error. The methodology is…
Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We…
Fast convergent, accurate, computationally efficient, parallelizable, and robust matrix inversion and parameter estimation algorithms are required in many time-critical and accuracy-critical applications such as system identification,…
We introduce a new technique for evaluation of series with zeta coefficients and also for evaluation of certain integrals involving the logGamma function. This technique is based on Hankel integral representations of the Hurwitz zeta, the…
In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…