𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permutation rules for simplex finite elements

✍ Scribed by Peter P. Silvester


Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
266 KB
Volume
18
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Weighted quadrature rules for finite ele
✍ Saulo P. Oliveira; Alexandre L. Madureira; Frederic Valentin πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 917 KB

We discuss the numerical integration of polynomials times non-polynomial weighting functions in two dimensions arising from multiscale finite element computations. The proposed quadrature rules are significantly more accurate than standard quadratures and are better suited to existing finite element

Topological consistency rules for genera
✍ K. Preiss πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 129 KB

plotterβ€’ A record-playback facility permits small assemblies to be stored as packages on magnetic cards; large drawings may be stored on a floppy disc. A balance sheet of advantages and disadvantages is included. Mr R K Hilton had worked in the automobile, steam-turbine, glass making, cablemaking a