A fast and simple algorithm for the computation of the Lerch transcendent

02/23/2023
by   Eleonora Denich, et al.
0

This paper deals with the computation of the Lerch transcendent by means of the Gauss-Laguerre formula. An a priori estimate of the quadrature error, that allows to compute the number of quadrature nodes necessary to achieve an arbitrary precision, is derived. Exploiting the properties of the Gauss-Laguerre rule and the error estimate, a truncated approach is also considered. The algorithm used and its Matlab implementation are reported. The numerical examples confirm the reliability of this approach.

READ FULL TEXT
research
08/02/2023

Some notes on the trapezoidal rule for Fourier type integrals

This paper deals with the error analysis of the trapezoidal rule for the...
research
01/27/2023

Error estimates for a Gaussian rule involving Bessel functions

This paper deals with the estimation of the quadrature error of a Gaussi...
research
02/12/2023

Numerical methods and arbitrary-precision computation of the Lerch transcendent

We examine the use of the Euler-Maclaurin formula and new derived unifor...
research
11/18/2022

A fast and accurate numerical approach for electromagnetic inversion

This paper deals with the solution of Maxwell's equations to model the e...
research
10/31/2010

Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

Two very fast and simple O(lg n) algorithms for individual Fibonacci num...
research
01/20/2022

An error estimate for the Gauss-Jacobi-Lobatto quadrature rule

An error estimate for the Gauss-Lobatto quadrature formula for integrati...
research
08/30/2023

A spectrum adaptive kernel polynomial method

The kernel polynomial method (KPM) is a powerful numerical method for ap...

Please sign up or login with your details

Forgot password? Click here to reset