/usr/share/pyshared/FIAT/morley.py is in python-fiat 1.0.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 | # 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 finite_element, polynomial_set, dual_set , functional
class MorleyDualSet( dual_set.DualSet ):
"""The dual basis for Lagrange elements. This class works for
simplices of any dimension. Nodes are point evaluation at
equispaced points."""
def __init__( self , ref_el ):
entity_ids = {}
nodes = []
cur = 0
# make nodes by getting points
# need to do this dimension-by-dimension, facet-by-facet
top = ref_el.get_topology()
verts = ref_el.get_vertices()
sd = ref_el.get_spatial_dimension()
if sd != 2:
raise Exception, "Illegal spatial dimension"
pd = functional.PointDerivative
# vertex point evaluations
entity_ids[0] = {}
for v in sorted( top[0] ):
nodes.append( functional.PointEvaluation( ref_el , verts[v] ) )
entity_ids[0][v] = [cur]
cur += 1
# edge dof -- normal at each edge midpoint
entity_ids[1] = {}
for e in sorted( top[1] ):
pt = ref_el.make_points( 1 , e , 2 )[0]
n = functional.PointNormalDerivative( ref_el , e , pt )
nodes.append( n )
entity_ids[1][e] = [cur]
cur += 1
dual_set.DualSet.__init__( self , nodes , ref_el , entity_ids )
class Morley( finite_element.FiniteElement ):
"""The Morley finite element."""
def __init__( self , ref_el ):
poly_set = polynomial_set.ONPolynomialSet( ref_el , 2 )
dual = MorleyDualSet( ref_el )
finite_element.FiniteElement.__init__( self , poly_set , dual , 2 )
if __name__=="__main__":
import reference_element
T = reference_element.DefaultTriangle()
U = Morley( T )
Ufs = U.get_nodal_basis()
pts = T.make_lattice( 1 )
print pts
print Ufs.tabulate(pts).values()[0]
|