Riemann's Zeta Function - another approach (RPL)

[Paul Dale]

How does this compare to Jean-Marc Baillard's implementation of Borwein's second algorithm?

The 34S uses this algorithm. Originally in C but later in XROM. Borwein's paper includes an error term which means that for real arguments, the number of terms for a specified precision is constant & can be determined in advance. This isn't true for complex numbers, where the number of terms depends on the magnitude of the complex part.


Pauli