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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
|
// @HEADER
// ************************************************************************
//
// Intrepid2 Package
// Copyright (2007) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Kyungjoo Kim (kyukim@sandia.gov),
// Mauro Perego (mperego@sandia.gov), or
// Nate Roberts (nvrober@sandia.gov)
//
// ************************************************************************
// @HEADER
/** \file IntegratedLegendreTests.cpp
\brief Tests to verify various implementations of integrated Legendre polynomials.
\author Created by N.V. Roberts.
*/
#include "Teuchos_UnitTestHarness.hpp"
#include "Intrepid2_Polynomials.hpp"
#include "Intrepid2_TestUtils.hpp"
#include "Kokkos_Core.hpp"
namespace
{
using namespace Intrepid2;
// x and t values used across these tests
std::vector<double> t_values = {{0.0, 0.2, 0.4, 0.6, 0.8, 1.0}};
std::vector<double> x_values = {{-1.0,-0.5,-1.0/3.0,0.0,1.0/3.0,0.50,1.0}};
using DeviceType = DefaultTestDeviceType;
using ExecutionSpace = typename DeviceType::execution_space;
void testIntegratedLegendreTwoPathsMatch(const int polyOrder, const double tol, Teuchos::FancyOStream &out, bool &success)
{
Kokkos::View<double*,DeviceType> integrated_legendre_values("integrated legendre values",polyOrder+1);
Kokkos::View<double*,DeviceType> shifted_scaled_legendre_values("shifted scaled legendre values",polyOrder+1);
Kokkos::View<double*,DeviceType> integrated_legendre_values_second_path("integrated legendre values (second path)",polyOrder+1);
for (auto x : x_values)
{
for (auto t : t_values)
{
using Intrepid2::Polynomials::shiftedScaledIntegratedLegendreValues;
using Intrepid2::Polynomials::shiftedScaledLegendreValues;
// wrap invocation in parallel_for just to ensure execution on device (for CUDA)
auto policy = Kokkos::RangePolicy<>(ExecutionSpace(),0,1);
Kokkos::parallel_for(policy, KOKKOS_LAMBDA(const int dummy_index)
{
shiftedScaledIntegratedLegendreValues(integrated_legendre_values, polyOrder, x, t);
shiftedScaledLegendreValues(shifted_scaled_legendre_values, polyOrder, x, t);
shiftedScaledIntegratedLegendreValues(integrated_legendre_values_second_path, shifted_scaled_legendre_values, polyOrder, x, t);
});
auto integrated_legendre_values_host = getHostCopy(integrated_legendre_values);
auto shifted_scaled_legendre_values_host = getHostCopy(shifted_scaled_legendre_values);
auto integrated_legendre_values_second_path_host = getHostCopy(integrated_legendre_values_second_path);
for (int i=0; i<=polyOrder; i++)
{
bool valuesAreBothSmall = valuesAreSmall(integrated_legendre_values_second_path_host(i), integrated_legendre_values_host(i), tol);
if (! valuesAreBothSmall)
{
if (! approximatelyEqual(integrated_legendre_values_second_path_host(i), integrated_legendre_values_host(i), tol) )
{
out << "for polyOrder " << i << ", x = " << x << ", t = " << t << ": ";
out << integrated_legendre_values_second_path_host(i) << " != " << integrated_legendre_values_host(i);
out << " (diff = " << abs(integrated_legendre_values_second_path_host(i) - integrated_legendre_values_host(i));
out << "; tol = " << tol << ")\n";
success = false;
}
}
}
}
}
}
void testIntegratedLegendre_dtTwoPathsMatch(const int polyOrder, const double tol, Teuchos::FancyOStream &out, bool &success)
{
Kokkos::View<double*,DeviceType> integrated_legendre_values_dt("d/dt(integrated legendre) values",polyOrder+1);
Kokkos::View<double*,DeviceType> shifted_scaled_legendre_values("shifted scaled legendre values",polyOrder+1);
Kokkos::View<double*,DeviceType> integrated_legendre_values_dt_second_path("d/dt(integrated legendre) values (second path)",polyOrder+1);
for (auto x : x_values)
{
for (auto t : t_values)
{
using Intrepid2::Polynomials::shiftedScaledIntegratedLegendreValues_dt;
using Intrepid2::Polynomials::shiftedScaledLegendreValues;
// wrap invocation in parallel_for just to ensure execution on device (for CUDA)
auto policy = Kokkos::RangePolicy<>(ExecutionSpace(),0,1);
Kokkos::parallel_for(policy, KOKKOS_LAMBDA(const int dummy_index)
{
shiftedScaledIntegratedLegendreValues_dt(integrated_legendre_values_dt, polyOrder, x, t);
shiftedScaledLegendreValues(shifted_scaled_legendre_values, polyOrder, x, t);
shiftedScaledIntegratedLegendreValues_dt(integrated_legendre_values_dt_second_path, shifted_scaled_legendre_values, polyOrder, x, t);
});
auto integrated_legendre_values_dt_host = getHostCopy(integrated_legendre_values_dt);
auto integrated_legendre_values_dt_second_path_host = getHostCopy(integrated_legendre_values_dt_second_path);
for (int i=0; i<=polyOrder; i++)
{
bool valuesAreBothSmall = valuesAreSmall(integrated_legendre_values_dt_second_path_host(i), integrated_legendre_values_dt_host(i), tol);
if (!valuesAreBothSmall)
{
if (! approximatelyEqual(integrated_legendre_values_dt_second_path_host(i), integrated_legendre_values_dt_host(i), tol) )
{
out << "for polyOrder " << i << ", x = " << x << ", t = " << t << ": ";
out << integrated_legendre_values_dt_second_path_host(i) << " != " << integrated_legendre_values_dt_host(i);
out << " (diff = " << abs(integrated_legendre_values_dt_second_path_host(i) - integrated_legendre_values_dt_host(i));
out << "; tol = " << tol << ")\n";
success = false;
}
}
}
}
}
}
void testIntegratedLegendreMatchesFormula(const int polyOrder, const double tol, Teuchos::FancyOStream &out, bool &success)
{
Kokkos::View<double*,DeviceType> integrated_legendre_values("integrated legendre values",polyOrder+1);
Kokkos::View<double*,DeviceType> shifted_scaled_legendre_values("shifted scaled legendre values",polyOrder+1);
for (auto x : x_values)
{
for (auto t : t_values)
{
using Intrepid2::Polynomials::shiftedScaledIntegratedLegendreValues;
using Intrepid2::Polynomials::shiftedScaledLegendreValues;
// wrap invocation in parallel_for just to ensure execution on device (for CUDA)
auto policy = Kokkos::RangePolicy<>(ExecutionSpace(),0,1);
Kokkos::parallel_for(policy, KOKKOS_LAMBDA(const int dummy_index)
{
shiftedScaledIntegratedLegendreValues(integrated_legendre_values, polyOrder, x, t);
shiftedScaledLegendreValues(shifted_scaled_legendre_values, polyOrder, x, t);
});
auto integrated_legendre_values_host = getHostCopy(integrated_legendre_values);
auto shifted_scaled_legendre_values_host = getHostCopy(shifted_scaled_legendre_values);
for (int i=0; i<=polyOrder; i++)
{
double L_i_actual = integrated_legendre_values_host(i);
double L_i_expected;
if (i == 0)
{
L_i_expected = 1.0;
}
else if (i == 1)
{
L_i_expected = x;
}
else
{
double i_factor = 2. * (2.* i -1.);
double P_i = shifted_scaled_legendre_values_host(i);
double P_i_minus_2 = shifted_scaled_legendre_values_host(i-2);
L_i_expected = (P_i - t * t * P_i_minus_2) / i_factor;
}
bool valuesMatch = true;
bool valuesAreBothSmall = valuesAreSmall(L_i_actual, L_i_expected, tol);
if (!valuesAreBothSmall)
{
TEUCHOS_TEST_FLOATING_EQUALITY(L_i_actual, L_i_expected, tol, out, valuesMatch);
}
if ( !valuesMatch )
{
out << "for polyOrder " << i << ", x = " << x << ", t = " << t << ": ";
out << L_i_actual << " != " << L_i_expected;
out << " (diff = " << abs(L_i_actual - L_i_expected);
out << "; tol = " << tol << ")\n";
success = false;
}
}
}
}
}
// test disabled. See note by commented-out integratedLegendreValues() in Intrepid_Polynomials.hpp.
//bool testIntegratedLegendreAgreesWithShiftedScaled(const double x, const int polyOrder, const double tol)
//{
// bool success = true;
//
// Kokkos::View<double*,DeviceType> integrated_legendre_values("integrated legendre values",polyOrder+1);
//
// using Intrepid2::PolyLib::integratedLegendreValues;
// using Intrepid2::PolyLib::shiftedScaledIntegratedLegendreValues;
// using Intrepid2::PolyLib::shiftedScaledLegendreValues;
//
// integratedLegendreValues(integrated_legendre_values, polyOrder, x);
//
// Kokkos::View<double*,DeviceType> shifted_scaled_integrated_legendre_values("shifted scaled integrated legendre values",polyOrder+1);
// using Intrepid2::PolyLib::shiftedScaledIntegratedLegendreValues;
//
// const double x_scaled = (x + 1.0) / 2.0;
// const double t = 1.0;
// shiftedScaledIntegratedLegendreValues(shifted_scaled_integrated_legendre_values, polyOrder, x_scaled, t);
//
// for (int i=0; i<=polyOrder; i++)
// {
// if (! approximatelyEqual(shifted_scaled_integrated_legendre_values(i), integrated_legendre_values(i), tol) )
// {
// success = false;
// double diff = std::abs(shifted_scaled_integrated_legendre_values(i) - integrated_legendre_values(i));
// std::cout << "FAILURE: testIntegratedLegendreAgreesWithShiftedScaled expected ";
// std::cout << shifted_scaled_integrated_legendre_values(i) << " for P_" << i << ", but got ";
// std::cout << integrated_legendre_values(i) << " (diff: " << diff << ")" << std::endl;
// }
// }
// return success;
//}
TEUCHOS_UNIT_TEST( IntegratedLegendre, TwoPathsMatch )
{
const int polyOrderMax = 10;
const double tol = TEST_TOLERANCE_TIGHT;
testIntegratedLegendreTwoPathsMatch(polyOrderMax, tol, out, success);
}
TEUCHOS_UNIT_TEST( IntegratedLegendre, dtTwoPathsMatch )
{
const int polyOrderMax = 10;
const double tol = TEST_TOLERANCE_TIGHT;
testIntegratedLegendre_dtTwoPathsMatch(polyOrderMax, tol, out, success);
}
TEUCHOS_UNIT_TEST( IntegratedLegendre, MatchesFormula )
{
const int polyOrderMax = 10;
const double tol = TEST_TOLERANCE_TIGHT;
testIntegratedLegendreMatchesFormula(polyOrderMax, tol, out, success);
}
} // namespace
|
