Related papers: An efficient algorithm for accelerating the conver…
In this paper, we study some Euler-Ap\'ery-type series which involve central binomial coefficients and (generalized) harmonic numbers. In particular, we establish elegant explicit formulas of some series by iterated integrals and…
Optimization problems with access to only zeroth-order information of the objective function on Riemannian manifolds arise in various applications, spanning from statistical learning to robot learning. While various zeroth-order algorithms…
This paper evaluates algorithms for classification and outlier detection accuracies in temporal data. We focus on algorithms that train and classify rapidly and can be used for systems that need to incorporate new data regularly. Hence, we…
Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative result that simplecticity may not be attained by any…
We generalize the Brouwer-Zimmermann algorithm, which is the most efficient general algorithm for computing the minimum distance of a random linear code, to the case of generalized Hamming weights. We also adapt this algorithm to compute…
We present an efficient multi-accuracy algorithm for the computations of a set of special functions of a complex argument, z=x+iy. These functions include the complex probability function w(z), and closely related functions such as the…
We discuss a generalization of the Cohn-Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn-Umans…
By reducing optimization to a sequence of smaller subproblems, working set algorithms achieve fast convergence times for many machine learning problems. Despite such performance, working set implementations often resort to heuristics to…
For Hurwitz zeta function, we obtain power series expression in second variable for its higher order derivatives (with respect to first variable) at non-positive integer arguments and consequently obtain rapidly decreasing series expression…
In this paper we extend the Zeta function regularization technique, which gives a meaningful solution to divergent power series, in order to assign finite values to divergent integral of certain transcendental functions $f(x)$. The…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
We consider a generalized Mathieu series where the summands of the classical Mathieu series are multiplied by powers of a complex number. The Mellin transform of this series can be expressed by the polylogarithm or the Hurwitz zeta…
Nonlinear acceleration algorithms improve the performance of iterative methods, such as gradient descent, using the information contained in past iterates. However, their efficiency is still not entirely understood even in the quadratic…
Multicurrent correlators associated to KP $\tau$-functions of hypergeometric type are used as generating functions for weighted Hurwitz numbers. These are expressed as formal Taylor series and used to compute generic, simple, rational and…
Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that…
An efficient procedure for the computation of $Li_{s}(z)$ where $s<0$ is here presented. We started with Polylogarithm $Li_{s}(z)$ where $s<0$. The summation of $n^{s}z^{n}$ is evaluated using a new method. An assumption is made that the…
The Hurwitz-type Euler zeta function is defined as a deformation of the Hurwitz zeta function: \begin{equation*} \zeta_E(s,x)=\sum_{n=0}^\infty\frac{(-1)^n}{(n+x)^s}. \end{equation*} In this paper, by using the method of Fourier expansions,…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
In this manuscript, the authors derive closed formula for definite integrals of combinations of powers and logarithmic functions of complicated arguments and express these integrals in terms of the Hurwitz zeta. These derivations are then…
Since the popularization of the Stiefel manifold for numerical applications in 1998 in a seminal paper from Edelman et al., it has been exhibited to be a key to solve many problems from optimization, statistics and machine learning. In…