Related papers: An efficient algorithm for accelerating the conver…
Fourier acceleration is a technique used in Hybrid Monte Carlo simulations to decrease the autocorrelation between subsequent field configurations in the generated ensemble. It has been shown, in the perturbative limit, to eliminate the…
In this paper, we propose a new non-monotone conjugate gradient method for solving unconstrained nonlinear optimization problems. We first modify the non-monotone line search method by introducing a new trigonometric function to calculate…
In this paper, we extend the main results of a 2024 \emph{Advances in Applied Mathematics} paper \cite{XuZhao2021c} about Ap\'{e}ry-type series involving central binomial coefficients and the multiple ($t-$)harmonic sums to parametric…
A $q$-analogue of the Hurwitz zeta-function is introduced through considerations on the spectral zeta-function of quantum group $SU_{q}(2)$, and its analytic aspects are studied via the Euler-MacLaurin summation formula. Asymptotic formulas…
We present a message-passing based parallel version of the Space Saving algorithm designed to solve the $k$--majority problem. The algorithm determines in parallel frequent items, i.e., those whose frequency is greater than a given…
This paper investigates the convergence of the randomized Kaczmarz algorithm for the problem of phase retrieval of complex-valued objects. While this algorithm has been studied for the real-valued case}, its generalization to the…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
In this work we derive a functional equation in terms of the Hurwitz-Lerch zeta function along with definite integrals in terms of the incomplete gamma and Hurwitz-Lerch zeta functions. The method used in these derivations is contour…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
We define a generalized class of modified zeta series transformations generating the partial sums of the Hurwitz zeta function and series expansions of the Lerch transcendent function. The new transformation coefficients we define within…
In this paper, we investigate the parity of three class of Hurwitz-type cyclotomic Euler sums using the methods of contour integration and residue computation, and derive explicit parity formulas for linear, quadratic, and some higher-order…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
We suggest a time-effective algorithm to calculate tight focusing of a collimated continuous-wave laser beam with an arbitrary cross-section light vector distribution by a high-aperture microscope objective into a planar microcavity. This…
Computationally efficient classification system architecture is proposed. It utilizes fast tensor-vector multiplication algorithm to apply linear operators upon input signals . The approach is applicable to wide variety of recognition…
The harmonic numbers and higher-order harmonic numbers appear frequently in several areas which are related to combinatorial identities, many expressions involving special functions in analytic number theory, and analysis of algorithms. The…
Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of…
We give explicit expressions (or at least an algorithm of obtaining such expressions) of the coefficients of the Laurent series expansions of the Euler-Zagier multiple zeta-functions at any integer points. The main tools are the…