Related papers: An efficient algorithm for accelerating the conver…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
Soft-Collinear Effective theory is used to perform threshold resummation for W and Z production at large transverse momentum to next-to-next-to-leading logarithmic accuracy including matching to next-to-leading fixed-order results. The…
The well-known expressions for the Green's functions for the Helmholtz equation in polar coordinates with Dirichlet and Neumann boundary conditions are transformed. The slowly converging double series describing these Green's functions are…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for…
We present a numerical algorithm for evaluating the Boltzmann collision operator with $O(N^2)$ operations based on high order discontinuous Galerkin discretizations in the velocity variable. To formulate the approach, Galerkin projection of…
In semiclassical theories for chaotic systems such as Gutzwiller's periodic orbit theory the energy eigenvalues and resonances are obtained as poles of a non-convergent series g(w)=sum_n A_n exp(i s_n w). We present a general method for the…
The Kaczmarz algorithm is a popular solver for overdetermined linear systems due to its simplicity and speed. In this paper, we propose a modification that speeds up the convergence of the randomized Kaczmarz algorithm for systems of linear…
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…
In this paper, some new results are reported for the study of Riemann zeta function $\zeta(s)$ in the critical strip $0<Re(s)<1$, such as $\zeta(s)$ expressed in a generalized Euler product only involving prime numbers. Particularly, some…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
A stochastic iterative algorithm approximating second-order information using von Neumann series is discussed. We present convergence guarantees for strongly-convex and smooth functions. Our analysis is much simpler in contrast to a similar…
Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
Summations and relations involving the Hurwitz and Riemann zeta-functions are extended first to Barnes zeta-functions and then to zeta-functions of general type. The analysis is motivated by the evaluation of determinants on spheres which…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
A minimal requirement for simulating multi-scale systems is to reproduce the statistical behavior of the slow variables. In particular, a good numerical method should accurately aproximate the probability density function of the…
This study presents explicit evaluations of the series \begin{equation*} \sum_{k=1}^\infty \frac{H_{k/n}^{(p)}}{k^q} \quad \text{and} \quad \sum_{k=1}^\infty \frac{(-1)^k H_{k/2n}^{(p)}}{k^q}, \quad p,q,n \in \mathbb{Z}_{\ge 1},\; q \ne 1,…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…