DeepAI AI Chat
Log In Sign Up

Tesselating a Pascal-like tetrahedron for the subdivision of high order tetrahedral finite elements

by   Mark W. Lohry, et al.

Three-dimensional N^th order nodal Lagrangian tetrahedral finite elements (P_N elements) can be generated using Pascal's tetrahedron ℋ where each node in 3D element space corresponds to an entry in ℋ. For the purposes of visualization and post-processing, it is desirable to "subdivide" these high-order tetrahedral elements into sub-tetrahedra which cover the whole space without intersections and without introducing new exterior edges or vertices. That is, the exterior triangulation of the element should be congruent with the "natural" triangulation of the 2D Pascal's triangle. This work attempts to describe that process of subdivision for arbitrary N.


Spurious solutions for high order curl problems

We investigate numerical solutions of high order curl problems with vari...

Local Fourier Analysis of P-Multigrid for High-Order Finite Element Operators

Multigrid methods are popular for solving linear systems derived from di...

Complete Pascal Interpolation Scheme For Approximating The Geometry Of A Quadrilateral Element

This paper applies a complete parametric set for approximating the geome...

Geometry Mapping, Complete Pascal Scheme versus Standard Bilinear Approach

This paper presents a complete Pascal interpolation scheme for use in th...

A variational approach to high-order r-adaptation

A variational framework, initially developed for high-order mesh optimis...

Portable high-order finite element kernels I: Streaming Operations

This paper is devoted to the development of highly efficient kernels per...