Name
Abstract | ||
|---|---|---|
We show that the dilogarithm has at most one zero on each branch, that each zero is close to a root of unity, and that they may be found to any precision with Newton's method. This work is motivated by applications to the asymptotics of coefficients in partial fraction decompositions considered by Rademacher. We also survey what is known about zeros of polylogarithms in general. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1090/mcom/3065 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
Dilogarithm zeros,Newton's method,polylogarithms | Algebra,Mathematical analysis,Root of unity,Partial fraction decomposition,Asymptotic analysis,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 302 | 0025-5718 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cormac O'Sullivan | 1 | 1 | 0.75 |