Premium
Permutation rules for simplex finite elements
Author(s) -
Silvester Peter P.
Publication year - 1982
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620180810
Subject(s) - simplex , permutation (music) , combinatorics , partial permutation , tetrahedron , mathematics , homogeneous space , permutation matrix , interpolation (computer graphics) , order (exchange) , generalized permutation matrix , cyclic permutation , discrete mathematics , computer science , symmetric group , geometry , physics , artificial intelligence , finance , circulant matrix , acoustics , economics , motion (physics)
Abstract Simplicial finite elements have many symmetries, which are commonly exploited in programs to save computing time and storage. All possible permutations of the interpolation functions of an N‐simplex can be expressed in terms of N basic permutation operations. The relevant permutation matrices are given for triangles up to order 20 and tetrahedra up to order 10.