 Gaussian sum truncation bound

For $b>0$ and a nonnegative integer $N$, define the symmetric partial sum and its positive remainder bySuccessive omitted terms have ratio $e^{-\pi b(2n+1)}\le e^{-\pi b(2N+3)}$ for $n\ge N+1$. Bounding them by a geometric series givesConsequently the physical approximation to $S(a)$ has error at most $B_N(a)$, while the dual approximation $a^{-1/2}{S}_N(1/a)$ has error at most $a^{-1/2}{B}_N(1/a)$. The prefactor must be included when setting an absolute error tolerance.

For a truncation error below $10^{-12}$, at $a=0.04$ the physical side first passes this bound with $N=15$: $31$ lattice points give $B_{15}(0.04)<2.172\times 10^{-14}$, whereas $N=14$ gives $B_{14}(0.04)>10^{-12}$. The dual side needs only $k=0$. At $a=25$ the physical side needs only $n=0$, whereas the dual side first passes the bound with $N=14$: $29$ lattice points give $25^{-1/2}{B}_{14}(0.04)<2.146\times 10^{-13}$. These counts measure symmetric lattice terms; using the even function symmetry reduces the distinct exponential function evaluations to $N+1$. Truncation bounds do not include rounding error in a numerical implementation.