-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathpwl_interp_2d_prb.cpp
246 lines (211 loc) · 4.61 KB
/
pwl_interp_2d_prb.cpp
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
# include <cstdlib>
# include <iostream>
# include <iomanip>
# include <cmath>
# include <ctime>
# include <cstring>
using namespace std;
# include "pwl_interp_2d.hpp"
# include "test_interp_2d.hpp"
# include "r8lib.hpp"
int main ( );
void test01 ( int prob, int n );
//****************************************************************************80
int main ( )
//****************************************************************************80
//
// Purpose:
//
// MAIN is the main program for PWL_INTERP_2D_PRB.
//
// Discussion:
//
// PWL_INTERP_2D_TEST tests the PWL_INTERP_2D library.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 15 October 2012
//
// Author:
//
// John Burkardt
//
{
int i;
int n;
int n_test[5] = { 2, 3, 4, 5, 9 };
int n_test_num = 5;
int prob;
int prob_num;
timestamp ( );
cout << "\n";
cout << "PWL_INTERP_2D_TEST:\n";
cout << " C++ version\n";
cout << " Test the PWL_INTERP_2D library.\n";
cout << " The R8LIB library is needed.\n";
cout << " The test needs the TEST_INTERP_2D library.\n";
prob_num = f00_num ( );
//
// Numerical tests.
//
for ( prob = 1; prob <= prob_num; prob++ )
{
for ( i = 0; i < n_test_num; i++ )
{
n = n_test[i];
test01 ( prob, n );
}
}
//
// Terminate.
//
cout << "\n";
cout << "PWL_INTERP_2D_TEST:\n";
cout << " Normal end of execution.\n";
cout << "\n";
timestamp ( );
return 0;
}
//****************************************************************************80
void test01 ( int prob, int n )
//****************************************************************************80
//
// Purpose:
//
// PWL_INTERP_2D_TEST01 tests PWL_INTERP_2D.
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 15 October 2012
//
// Author:
//
// John Burkardt
//
// Parameters:
//
// Input, int PROB, the problem number.
//
// Input, int N, the grid size in each dimension.
//
{
double app_error;
int i;
int ij;
double int_error;
int j;
int nd;
int ni;
int nxd;
int nyd;
double *xd;
double *xd_1d;
double *xi;
double *xi_1d;
double *yd;
double *yd_1d;
double *yi;
double *yi_1d;
double *zd;
double *zdm;
double *zi;
nxd = n;
nyd = n;
cout << "\n";
cout << "PWL_INTERP_2D_TEST01:\n";
cout << " Interpolate data from TEST_INTERP_2D problem # " << prob << "\n";
cout << " Using polynomial interpolant of product degree " << nxd << " x " << nyd << "\n";
nd = nxd * nyd;
cout << " Number of data points = " << nd << "\n";
xd_1d = r8vec_linspace_new ( nxd, 0.0, 1.0 );
yd_1d = r8vec_linspace_new ( nyd, 0.0, 1.0 );
xd = new double[nxd*nyd];
yd = new double[nxd*nyd];
zd = new double[nxd*nyd];
ij = 0;
for ( j = 0; j < nyd; j++ )
{
for ( i = 0; i < nxd; i++ )
{
xd[ij] = xd_1d[i];
yd[ij] = yd_1d[j];
ij = ij + 1;
}
}
f00_f0 ( prob, nd, xd, yd, zd );
if ( nd <= 20 )
{
r8vec3_print ( nd, xd, yd, zd, " X, Y, Z data:" );
}
//
// #1: Does interpolant match function at data points?
//
ni = nd;
xi = r8vec_copy_new ( ni, xd );
yi = r8vec_copy_new ( ni, yd );
zi = pwl_interp_2d ( nxd, nyd, xd_1d, yd_1d, zd, ni, xi, yi );
if ( ni <= 20 )
{
r8vec3_print ( ni, xi, yi, zi, " X, Y, Z interpolation:" );
}
int_error = r8vec_norm_affine ( ni, zi, zd ) / ( double ) ( ni );
cout << "\n";
cout << " RMS data interpolation error = " << int_error << "\n";
delete [] xi;
delete [] yi;
delete [] zi;
//
// #2: Does interpolant approximate data at midpoints?
//
if ( 1 < nd )
{
xi_1d = new double[nxd-1];
yi_1d = new double[nyd-1];
for ( i = 0; i < nxd - 1; i++ )
{
xi_1d[i] = 0.5 * ( xd_1d[i] + xd_1d[i+1] );
}
for ( i = 0; i < nyd - 1; i++ )
{
yi_1d[i] = 0.5 * ( yd_1d[i] + yd_1d[i+1] );
}
ni = ( nxd - 1 ) * ( nyd - 1 );
xi = new double[ni];
yi = new double[ni];
zdm = new double[ni];
ij = 0;
for ( j = 0; j < nyd - 1; j++ )
{
for ( i = 0; i < nxd - 1; i++ )
{
xi[ij] = xi_1d[i];
yi[ij] = yi_1d[j];
ij = ij + 1;
}
}
f00_f0 ( prob, ni, xi, yi, zdm );
zi = pwl_interp_2d ( nxd, nyd, xd_1d, yd_1d, zd, ni, xi, yi );
app_error = r8vec_norm_affine ( ni, zi, zdm ) / ( double ) ( ni );
cout << " RMS data approximation error = " << app_error << "\n";
delete [] xi;
delete [] xi_1d;
delete [] yi;
delete [] yi_1d;
delete [] zdm;
delete [] zi;
}
delete [] xd;
delete [] xd_1d;
delete [] yd;
delete [] yd_1d;
delete [] zd;
return;
}