/usr/lib/python2.7/dist-packages/FIAT/nedelec.py is in python-fiat 1.3.0-1.
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 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 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 | # Copyright (C) 2008 Robert C. Kirby (Texas Tech University)
#
# This file is part of FIAT.
#
# FIAT is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# FIAT is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public License
# along with FIAT. If not, see <http://www.gnu.org/licenses/>.
import polynomial_set, expansions, quadrature, numpy, dual_set, \
finite_element, functional
from functools import reduce
def NedelecSpace2D( ref_el , k ):
"""Constructs a basis for the 2d H(curl) space of the first kind
which is (P_k)^2 + P_k rot( x )"""
sd = ref_el.get_spatial_dimension()
if sd != 2:
raise Exception("NedelecSpace2D requires 2d reference element")
vec_Pkp1 = polynomial_set.ONPolynomialSet( ref_el , k+1 , (sd,) )
dimPkp1 = expansions.polynomial_dimension( ref_el , k+1 )
dimPk = expansions.polynomial_dimension( ref_el , k )
dimPkm1 = expansions.polynomial_dimension( ref_el , k-1 )
vec_Pk_indices = reduce( lambda a,b: a+b , \
[ list(range(i*dimPkp1,i*dimPkp1+dimPk)) \
for i in range(sd) ] )
vec_Pk_from_Pkp1 = vec_Pkp1.take( vec_Pk_indices )
Pkp1 = polynomial_set.ONPolynomialSet( ref_el , k + 1 )
PkH = Pkp1.take( list(range(dimPkm1,dimPk)) )
Q = quadrature.make_quadrature( ref_el , 2 * k + 2 )
Qpts = numpy.array( Q.get_points() )
Qwts = numpy.array( Q.get_weights() )
zero_index = tuple( [ 0 for i in range(sd) ] )
PkH_at_Qpts = PkH.tabulate( Qpts )[zero_index]
Pkp1_at_Qpts = Pkp1.tabulate( Qpts )[zero_index]
PkH_crossx_coeffs = numpy.zeros( (PkH.get_num_members() , \
sd, \
Pkp1.get_num_members()) , "d" )
def rot_x_foo( a ):
if a == 0:
return 1,1.0
elif a == 1:
return 0,-1.0
for i in range( PkH.get_num_members() ):
for j in range( sd ):
(ind,sign) = rot_x_foo( j )
for k in range( Pkp1.get_num_members() ):
PkH_crossx_coeffs[i,j,k] = sign * sum( Qwts * PkH_at_Qpts[i,:] * Qpts[:,ind] * Pkp1_at_Qpts[k,:] )
# for l in range( len( Qpts ) ):
# PkH_crossx_coeffs[i,j,k] += Qwts[ l ] \
# * PkH_at_Qpts[i,l] \
# * Qpts[l][ind] \
# * Pkp1_at_Qpts[k,l] \
# * sign
PkHcrossx = polynomial_set.PolynomialSet( ref_el , \
k + 1 , \
k + 1 , \
vec_Pkp1.get_expansion_set() , \
PkH_crossx_coeffs , \
vec_Pkp1.get_dmats() )
return polynomial_set.polynomial_set_union_normalized( vec_Pk_from_Pkp1 , \
PkHcrossx )
def NedelecSpace3D( ref_el , k ):
"""Constructs a nodal basis for the 3d first-kind Nedelec space"""
sd = ref_el.get_spatial_dimension()
if sd != 3:
raise Exception("NedelecSpace3D requires 3d reference element")
vec_Pkp1 = polynomial_set.ONPolynomialSet( ref_el , k + 1 , \
(sd,) )
dimPkp1 = expansions.polynomial_dimension( ref_el , k + 1 )
dimPk = expansions.polynomial_dimension( ref_el , k )
if k > 0:
dimPkm1 = expansions.polynomial_dimension( ref_el , k - 1 )
else:
dimPkm1 = 0
vec_Pk_indices = reduce( lambda a,b: a + b , \
[ list(range( i * dimPkp1 , i * dimPkp1+dimPk)) \
for i in range(sd) ] )
vec_Pk = vec_Pkp1.take( vec_Pk_indices )
vec_Pke_indices = reduce( lambda a,b : a + b , \
[ list(range(i*dimPkp1+dimPkm1,i*dimPkp1+dimPk)) \
for i in range(sd) ] )
vec_Pke = vec_Pkp1.take( vec_Pke_indices )
Pkp1 = polynomial_set.ONPolynomialSet( ref_el , k + 1 )
Q = quadrature.make_quadrature( ref_el , 2 * ( k + 1 ) )
Qpts = numpy.array(Q.get_points())
Qwts = numpy.array(Q.get_weights())
zero_index = tuple( [ 0 for i in range(sd) ] )
PkCrossXcoeffs = numpy.zeros( (vec_Pke.get_num_members() , \
sd , \
Pkp1.get_num_members()) , "d" )
Pke_qpts = vec_Pke.tabulate( Qpts )[zero_index]
Pkp1_at_Qpts = Pkp1.tabulate( Qpts )[ zero_index ]
import time
t = time.time()
for i in range( vec_Pke.get_num_members() ):
for j in range( sd ): # vector components
qwts_cur_bf_val = ( Qpts[:,(j+2)%3]*Pke_qpts[i,(j+1)%3,:] \
- Qpts[:,(j+1)%3] * Pke_qpts[i,(j+2)%3,:] ) * Qwts
PkCrossXcoeffs[i,j,:] = numpy.dot( Pkp1_at_Qpts , qwts_cur_bf_val )
# for k in range( Pkp1.get_num_members() ):
# PkCrossXcoeffs[i,j,k] = sum( Qwts * cur_bf_val * Pkp1_at_Qpts[k,:] )
# for l in range( len( Qpts ) ):
# cur_bf_val = Qpts[l][(j+2)%3] \
# * Pke_qpts[i,(j+1)%3,l] \
# - Qpts[l][(j+1)%3] \
# * Pke_qpts[i,(j+2)%3,l]
# PkCrossXcoeffs[i,j,k] += Qwts[l] \
# * cur_bf_val \
# * Pkp1_at_Qpts[k,l]
PkCrossX = polynomial_set.PolynomialSet( ref_el , \
k + 1 , \
k + 1 , \
vec_Pkp1.get_expansion_set() , \
PkCrossXcoeffs , \
vec_Pkp1.get_dmats() )
return polynomial_set.polynomial_set_union_normalized( vec_Pk , \
PkCrossX )
class NedelecDual2D( dual_set.DualSet ):
"""Dual basis for first-kind Nedelec in 2d """
def __init__( self , ref_el , degree ):
sd = ref_el.get_spatial_dimension()
if sd != 2:
raise Exception("Nedelec2D only works on triangles")
nodes = []
t = ref_el.get_topology()
num_edges = len( t[1] )
# edge tangents
for i in range( num_edges ):
pts_cur = ref_el.make_points( 1 , i , degree + 2 )
for j in range( len( pts_cur ) ):
pt_cur = pts_cur[j]
f = functional.PointEdgeTangentEvaluation( ref_el , \
i , pt_cur )
nodes.append( f )
# internal moments
if degree > 0:
Q = quadrature.make_quadrature( ref_el , 2 * ( degree + 1 ) )
qpts = Q.get_points()
Pkm1 = polynomial_set.ONPolynomialSet( ref_el , degree - 1 )
zero_index = tuple( [ 0 for i in range( sd ) ] )
Pkm1_at_qpts = Pkm1.tabulate( qpts )[ zero_index ]
for d in range( sd ):
for i in range( Pkm1_at_qpts.shape[0] ):
phi_cur = Pkm1_at_qpts[i,:]
l_cur = functional.IntegralMoment( ref_el , Q , \
phi_cur , (d,) )
nodes.append( l_cur )
entity_ids = {}
# set to empty
for i in range( sd + 1 ):
entity_ids[i] = {}
for j in range( len( t[i] ) ):
entity_ids[i][j] = []
cur = 0
# edges
num_edge_pts = len( ref_el.make_points( 1 , 0 , degree + 2 ) )
for i in range( len( t[1] ) ):
entity_ids[1][i] = list(range( cur , cur + num_edge_pts))
cur += num_edge_pts
# moments against P_{degree-1} internally, if degree > 0
if degree > 0:
num_internal_dof = sd * Pkm1_at_qpts.shape[0]
entity_ids[2][0] = list(range( cur , cur + num_internal_dof))
dual_set.DualSet.__init__( self , nodes , ref_el , entity_ids )
class NedelecDual3D( dual_set.DualSet ):
"""Dual basis for first-kind Nedelec in 3d """
def __init__( self , ref_el , degree ):
sd = ref_el.get_spatial_dimension()
if sd != 3:
raise Exception("NedelecDual3D only works on tetrahedra")
nodes = []
t = ref_el.get_topology()
# how many edges
num_edges = len( t[1] )
for i in range( num_edges ):
# points to specify P_k on each edge
pts_cur = ref_el.make_points( 1 , i , degree + 2 )
for j in range( len( pts_cur ) ):
pt_cur = pts_cur[j]
f = functional.PointEdgeTangentEvaluation( ref_el , \
i , pt_cur )
nodes.append( f )
if degree > 0: # face tangents
num_faces = len( t[2] )
for i in range( num_faces ): # loop over faces
pts_cur = ref_el.make_points( 2 , i , degree + 2 )
for j in range( len( pts_cur ) ): # loop over points
pt_cur = pts_cur[j]
for k in range(2): # loop over tangents
f = functional.PointFaceTangentEvaluation( ref_el , \
i , k , \
pt_cur )
nodes.append( f )
if degree > 1: # internal moments
Q = quadrature.make_quadrature( ref_el , 2 * ( degree + 1 ) )
qpts = Q.get_points()
Pkm2 = polynomial_set.ONPolynomialSet( ref_el , degree - 2 )
zero_index = tuple( [ 0 for i in range( sd ) ] )
Pkm2_at_qpts = Pkm2.tabulate( qpts )[ zero_index ]
for d in range( sd ):
for i in range( Pkm2_at_qpts.shape[0] ):
phi_cur = Pkm2_at_qpts[i,:]
f = functional.IntegralMoment( ref_el , Q , \
phi_cur , (d,) )
nodes.append( f )
entity_ids = {}
# set to empty
for i in range( sd + 1 ):
entity_ids[i] = {}
for j in range( len( t[i] ) ):
entity_ids[i][j] = []
cur = 0
# edge dof
num_pts_per_edge = len( ref_el.make_points( 1 , 0 , degree + 2 ) )
for i in range( len( t[1] ) ):
entity_ids[1][i] = list(range( cur , cur + num_pts_per_edge))
cur += num_pts_per_edge
# face dof
if degree > 0:
num_pts_per_face = len( ref_el.make_points( 2 , 0 , degree + 2 ) )
for i in range( len( t[2] ) ):
entity_ids[2][i] = list(range( cur , cur + 2 * num_pts_per_face))
cur += 2 * num_pts_per_face
if degree > 1:
num_internal_dof = Pkm2_at_qpts.shape[0] * sd
entity_ids[3][0] = list(range( cur , cur + num_internal_dof))
dual_set.DualSet.__init__( self , nodes , ref_el , entity_ids )
class Nedelec( finite_element.FiniteElement ):
"""Nedelec finite element"""
def __init__( self , ref_el , q ):
degree = q - 1
if ref_el.get_spatial_dimension() == 3:
poly_set = NedelecSpace3D( ref_el , degree )
dual = NedelecDual3D( ref_el , degree )
elif ref_el.get_spatial_dimension() == 2:
poly_set = NedelecSpace2D( ref_el , degree )
dual = NedelecDual2D( ref_el , degree)
else:
raise Exception("Not implemented")
finite_element.FiniteElement.__init__( self , poly_set , dual , degree,
mapping="covariant piola")
if __name__ == "__main__":
from . import reference_element
T = reference_element.DefaultTriangle( )
sd = T.get_spatial_dimension()
for k in range( 1 ):
N = Nedelec( T , k )
Nfs = N.get_nodal_basis()
pts = T.make_lattice( 1 )
vals = Nfs.tabulate( pts , 1 )
for foo in sorted( vals ):
print(foo)
print(vals[foo])
|