Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042
00043 #include "SundanceBrickQuadrature.hpp"
00044 #include "SundanceOut.hpp"
00045 #include "SundanceGauss1D.hpp"
00046 #include "PlayaTabs.hpp"
00047
00048 using namespace Sundance;
00049 using namespace Teuchos;
00050
00051 void BrickQuadrature::getPoints(int order, Array<double>& wgt,
00052 Array<double>& x, Array<double>& y, Array<double>& z)
00053 {
00054 int p = order + 1;
00055 p = p + (p % 2);
00056 int nNodes = p / 2;
00057 Gauss1D rule(nNodes, 0.0, 1.0);
00058 Array<double> d1 = rule.nodes();
00059 Array<double> d2 = d1;
00060 Array<double> d3 = d1;
00061 Array<double> w = rule.weights();
00062 int n = rule.nPoints();
00063
00064 wgt.resize(n * n * n);
00065 x.resize(n * n * n);
00066 y.resize(n * n * n);
00067 z.resize(n * n * n);
00068
00069 int k = 0;
00070 for (int i = 0; i < n; i++)
00071 {
00072 double p = d1[i];
00073 for (int j = 0; j < n; j++)
00074 {
00075 double q = d2[j];
00076 for (int l = 0; l < n; l++, k++)
00077 {
00078 double r = d3[l];
00079 x[k] = p;
00080 y[k] = q;
00081 z[k] = r;
00082 wgt[k] = w[i] * w[j] * w[l];
00083 }
00084 }
00085 }
00086 }
00087
00088 bool BrickQuadrature::test(int p)
00089 {
00090 Array<double> w;
00091 Array<double> x;
00092 Array<double> y;
00093 Array<double> z;
00094
00095 getPoints(p, w, x, y, z);
00096 bool pass = true;
00097 for (int a = 0; a <= p; a++)
00098 {
00099 int bMax = p - a;
00100 for (int b = 0; b <= bMax; b++)
00101 {
00102 int cMax = bMax - b;
00103 for (int c = 0; c <= cMax; c++)
00104 {
00105 double sum = 0.0;
00106 for (int q = 0; q < w.length(); q++)
00107 {
00108 sum += w[q] * pow(x[q], (double) a) * pow(y[q], (double) b)
00109 * pow(z[q], (double) c);
00110 }
00111 double err = fabs(sum - exact(a, b, c));
00112 bool localPass = err < 1.0e-14;
00113 pass = pass && localPass;
00114 if (!localPass)
00115 {
00116 fprintf(
00117 stderr,
00118 "order=%d m (%d, %d, %d) q=%22.15g exact=%22.15g\n",
00119 p, a, b, c, sum, exact(a, b, c));
00120 std::cerr << "error = " << err << std::endl;
00121 }
00122 }
00123 }
00124 }
00125 return pass;
00126 }
00127
00128 double BrickQuadrature::exact(int a, int b, int c)
00129 {
00130 return 1.0 / (a + 1) / (b + 1) / (c + 1);
00131 }
00132