Riemann-Siegel Theta Function Approximation

marcusmath
Messages
16
Reaction score
0
This is my first post on the physicsforums so go easy on me :)

I am writing a simple program to generate the zero's of the Riemann zeta function accurately.
However I need the first say, ten terms of the theta function
\theta\left(x\right) = arg\left(\Gamma\left(\frac{2ix+1}{4}\right)\right)-\frac{xln\pi}{2}
to get an acceptably accurate answer.

Wikipedia gives an approximation here;
http://en.wikipedia.org/wiki/Riemann%E2%80%93Siegel_theta_function"
but I need a larger expansion of the series
I tried to get MATLAB to generate the terms but am having no luck,

The algorithm is basically using Siegels Z-function and detecting a change of sign.
However, as the language I am using (a very basic pseudocode) is incapable of calculating the gamma function, I need the theta function to be expanded in the way it has been on the wiki page but with more terms so the algorithm can calculate the value approximately.

Sorry if this doesn't really make sense, but I am hoping someone here can help.
Thankyou
 
Last edited by a moderator:
Physics news on Phys.org
The expansion you need is derived by expanding the gamma function as a power series and then doing some monotonous algebra. To implement it on the computer, I'd skip that step altogether and calculate the gamma directly using Stirling's series, and then plug the result into the expression for theta. You can find the expansion of gamma in Edwards "Riemann's zeta function", page 109:

http://books.google.com/books?id=5u...lient=firefox-a&pg=PA109#v=onepage&q=&f=false

Note the difference in notation:

\Pi(s-1) = \Gamma(s)

B's are Bernoulli's numbers.
 
Thank you so much, Stirling's series is just what I needed :)
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top