1,727 research outputs found
Acceleration Methods for Series: A Probabilistic Perspective
We introduce a probabilistic perspective to the problem of accelerating the convergence of a wide class of series, paying special attention to the computation of the coefficients, preferably in a recursive way. This approach is mainly based on a differentiation formula for the negative binomial process which extends the classical Euler’s transformation. We illustrate the method by providing fast computations of the logarithm and the alternating zeta functions, as well as various real constants expressed as sums of series, such as Catalan, Stieltjes, and Euler–Mascheroni constants
A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree polynomial in operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency and numerical stability. Since the algorithm evaluates a Legendre expansion at an Chebyshev grid as an intermediate step, it also provides a fast transform between Legendre coefficients and values on a Chebyshev grid
- …