Finite precision computation of the polylogarithm function for complex parameters and arguments
From MaRDI portal
Cites work
- An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions
- An efficient algorithm for the Hurwitz zeta and related functions
- Complex Zeros of the Jonquiere or Polylogarithm Function
- Computation and theory of Mordell-Tornheim-Witten sums. II.
- Crandall's computation of the incomplete gamma function and the Hurwitz zeta function, with applications to Dirichlet \(L\)-series
- HARMONIC POLYLOGARITHMS
- scientific article; zbMATH DE number 3728625 (Why is no real title available?)
- scientific article; zbMATH DE number 1944619 (Why is no real title available?)
- scientific article; zbMATH DE number 849972 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3406034 (Why is no real title available?)
- Julia: a fresh approach to numerical computing
- Nielsen’s Generalized Polylogarithms
- Note on the Bose-Einstein Integral Functions
- Numerical evaluation of the dilogarithm of complex argument
- On function sum theorems connected with the series \(\sum_{n=1}^{\infty} \frac {x^n}{n^2}\).
- On polylogarithms
- On the computation of generalized Fermi-Dirac and Bose-Einstein integrals
- On the numerical calculation of polylogarithms
- The Dilogarithm Function
- The dilogarithm function for complex argument
- The Dilogarithm Function of a Real Argument
- The polylogarithm in algebraic number fields
This page was built for publication: Finite precision computation of the polylogarithm function for complex parameters and arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314275)
