1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/* Library libcerf:
* Compute complex error functions, based on a new implementation of
* Faddeeva's w_of_z. Also provide Dawson and Voigt functions.
*
* File tabulate.c:
* Tabulate outcomes. Also used to generate test cases.
*
* Copyright:
* (C) 2022 Forschungszentrum Jülich GmbH
*
* Licence:
* Public domain.
*
* Author:
* Joachim Wuttke, Forschungszentrum Jülich, 2022
*
* Website:
* http://apps.jcns.fz-juelich.de/libcerf
*/
#include "cerf.h"
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
static const double R6[6] = { 1.0, 1.5, 2.2, 3.3, 4.7, 6.8 };
void tabulate(double x) {
printf( " RTEST(result, 1e-13, im_w_of_x(%24.15e), %24.15e);\n", x, im_w_of_x(x) );
}
int main()
{
tabulate(0);
printf("\n // rough logarithmic grid\n");
for (int i=-275; i<=275; i += 50) {
double x = pow(10., i);
tabulate(-x);
tabulate(x);
}
printf("\n // medium logarithmic grid\n");
for (int i=-15; i<=15; i += 2) {
double x = pow(10., i);
tabulate(-x);
tabulate(x);
}
printf("\n // fine logarithmic grid\n");
for (int i=-3; i<=3; ++i) {
for (int j=0; j<6; ++j) {
double x = pow(10., i) * R6[j];
tabulate(-x);
tabulate(x);
}
}
printf("\n // integer steps for 100/(1+x) to test each Chebychev polynomial\n");
for (int i=0; i<=101; ++i) {
printf(" // i=%i\n", i);
tabulate(100./(i+1e-13) - 1);
tabulate(100./(i+.5) - 1);
tabulate(100./(i+1-1e-13) - 1);
}
return 0;
}
|
