/usr/include/dune/localfunctions/raviartthomas/raviartthomas0q2d/raviartthomas0q2dall.hh is in libdune-localfunctions-dev 2.2.1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | #ifndef DUNE_RT0Q2DALL_HH
#define DUNE_RT0Q2DALL_HH
#include <cstddef>
#include <vector>
#include <dune/common/fmatrix.hh>
#include <dune/localfunctions/common/localbasis.hh>
#include <dune/localfunctions/common/localkey.hh>
namespace Dune
{
/**@ingroup LocalBasisImplementation
\brief Lowest order Raviart-Thomas shape functions on the reference quadrilateral.
\tparam D Type to represent the field in the domain.
\tparam R Type to represent the field in the range.
\nosubgrouping
*/
template<class D, class R>
class RT0Q2DLocalBasis
{
public:
typedef LocalBasisTraits<D,2,Dune::FieldVector<D,2>,R,2,Dune::FieldVector<R,2>,
Dune::FieldMatrix<R,2,2> > Traits;
//! \brief Standard constructor
RT0Q2DLocalBasis ()
{
sign0 = sign1 = sign2 = sign3 = 1.0;
}
//! \brief Make set numer s, where 0<=s<16
RT0Q2DLocalBasis (unsigned int s)
{
sign0 = sign1 = sign2 = sign3 = 1.0;
if (s&1) sign0 = -1.0;
if (s&2) sign1 = -1.0;
if (s&4) sign2 = -1.0;
if (s&8) sign3 = -1.0;
}
//! \brief number of shape functions
unsigned int size () const
{
return 4;
}
//! \brief Evaluate all shape functions
inline void evaluateFunction (const typename Traits::DomainType& in,
std::vector<typename Traits::RangeType>& out) const
{
out.resize(4);
out[0][0] = sign0*(in[0]-1.0); out[0][1]=0.0;
out[1][0] = sign1*(in[0]); out[1][1]=0.0;
out[2][0] = 0.0; out[2][1]=sign2*(in[1]-1.0);
out[3][0] = 0.0; out[3][1]=sign3*(in[1]);
}
//! \brief Evaluate Jacobian of all shape functions
inline void
evaluateJacobian (const typename Traits::DomainType& in, // position
std::vector<typename Traits::JacobianType>& out) const // return value
{
out.resize(4);
out[0][0][0] = sign0; out[0][0][1] = 0;
out[0][1][0] = 0; out[0][1][1] = 0;
out[1][0][0] = sign1; out[1][0][1] = 0;
out[1][1][0] = 0; out[1][1][1] = 0;
out[2][0][0] = 0; out[2][0][1] = 0;
out[2][1][0] = 0; out[2][1][1] = sign2;
out[3][0][0] = 0; out[3][0][1] = 0;
out[3][1][0] = 0; out[3][1][1] = sign3;
}
//! \brief Polynomial order of the shape functions
unsigned int order () const
{
return 1;
}
private:
R sign0, sign1, sign2, sign3;
};
/**@ingroup LocalInterpolationImplementation
\brief Lowest order Raviart-Thomas shape functions on the reference quadrilateral.
\tparam LB corresponding LocalBasis giving traits
\nosubgrouping
*/
template<class LB>
class RT0Q2DLocalInterpolation
{
public:
//! \brief Standard constructor
RT0Q2DLocalInterpolation ()
{
sign0 = sign1 = sign2 = sign3 = 1.0;
}
//! \brief Make set numer s, where 0<=s<8
RT0Q2DLocalInterpolation (unsigned int s)
{
sign0 = sign1 = sign2 = sign3 = 1.0;
if (s&1) sign0 *= -1.0;
if (s&2) sign1 *= -1.0;
if (s&4) sign2 *= -1.0;
if (s&8) sign3 *= -1.0;
m0[0] = 0.0; m0[1] = 0.5;
m1[0] = 1.0; m1[1] = 0.5;
m2[0] = 0.5; m2[1] = 0.0;
m3[0] = 0.5; m3[1] = 1.0;
n0[0] = -1.0; n0[1] = 0.0;
n1[0] = 1.0; n1[1] = 0.0;
n2[0] = 0.0; n2[1] = -1.0;
n3[0] = 0.0; n3[1] = 1.0;
}
template<typename F, typename C>
void interpolate (const F& f, std::vector<C>& out) const
{
// f gives v*outer normal at a point on the edge!
typename F::Traits::RangeType y;
out.resize(4);
f.evaluate(m0,y); out[0] = (y[0]*n0[0]+y[1]*n0[1])*sign0;
f.evaluate(m1,y); out[1] = (y[0]*n1[0]+y[1]*n1[1])*sign1;
f.evaluate(m2,y); out[2] = (y[0]*n2[0]+y[1]*n2[1])*sign2;
f.evaluate(m3,y); out[3] = (y[0]*n3[0]+y[1]*n3[1])*sign3;
}
private:
typename LB::Traits::RangeFieldType sign0,sign1,sign2,sign3;
typename LB::Traits::DomainType m0,m1,m2,m3;
typename LB::Traits::DomainType n0,n1,n2,n3;
};
/**@ingroup LocalLayoutImplementation
\brief Layout map for RT0 elements on quadrilaterals
\nosubgrouping
\implements Dune::LocalCoefficientsVirtualImp
*/
class RT0Q2DLocalCoefficients
{
public:
//! \brief Standard constructor
RT0Q2DLocalCoefficients () : li(4)
{
for (std::size_t i=0; i<4; i++)
li[i] = LocalKey(i,1,0);
}
//! number of coefficients
std::size_t size () const
{
return 4;
}
//! get i'th index
const LocalKey& localKey (std::size_t i) const
{
return li[i];
}
private:
std::vector<LocalKey> li;
};
}
#endif
|