|
Packit |
67cb25 |
#include <stdio.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_math.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_sum.h>
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
#define N 20
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
int
|
|
Packit |
67cb25 |
main (void)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
double t[N];
|
|
Packit |
67cb25 |
double sum_accel, err;
|
|
Packit |
67cb25 |
double sum = 0;
|
|
Packit |
67cb25 |
int n;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_sum_levin_u_workspace * w
|
|
Packit |
67cb25 |
= gsl_sum_levin_u_alloc (N);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const double zeta_2 = M_PI * M_PI / 6.0;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* terms for zeta(2) = \sum_{n=1}^{\infty} 1/n^2 */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (n = 0; n < N; n++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
double np1 = n + 1.0;
|
|
Packit |
67cb25 |
t[n] = 1.0 / (np1 * np1);
|
|
Packit |
67cb25 |
sum += t[n];
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_sum_levin_u_accel (t, N, w, &sum_accel, &err;;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
printf ("term-by-term sum = % .16f using %d terms\n",
|
|
Packit |
67cb25 |
sum, N);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
printf ("term-by-term sum = % .16f using %zu terms\n",
|
|
Packit |
67cb25 |
w->sum_plain, w->terms_used);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
printf ("exact value = % .16f\n", zeta_2);
|
|
Packit |
67cb25 |
printf ("accelerated sum = % .16f using %zu terms\n",
|
|
Packit |
67cb25 |
sum_accel, w->terms_used);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
printf ("estimated error = % .16f\n", err);
|
|
Packit |
67cb25 |
printf ("actual error = % .16f\n",
|
|
Packit |
67cb25 |
sum_accel - zeta_2);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
gsl_sum_levin_u_free (w);
|
|
Packit |
67cb25 |
return 0;
|
|
Packit |
67cb25 |
}
|