z-logo
open-access-imgOpen Access
Visualization of higher order finite elements.
Author(s) -
David Thompson,
Philippe Pébaÿ,
Richard Crawford,
Rahul Khardekar
Publication year - 2004
Language(s) - English
Resource type - Reports
DOI - 10.2172/919127
Subject(s) - finite element method , mathematics , mathematical analysis , domain (mathematical analysis) , partition (number theory) , space (punctuation) , boundary value problem , boundary (topology) , geometry , combinatorics , physics , computer science , thermodynamics , operating system
Finite element meshes are used to approximate the solution to some differential equation when no exact solution exists. A finite element mesh consists of many small (but finite, not infinitesimal or differential) regions of space that partition the problem domain, {Omega}. Each region, or element, or cell has an associated polynomial map, {Phi}, that converts the coordinates of any point, x = ( x y z ), in the element into another value, f(x), that is an approximate solution to the differential equation, as in Figure 1(a). This representation works quite well for axis-aligned regions of space, but when there are curved boundaries on the problem domain, {Omega}, it becomes algorithmically much more difficult to define {Phi} in terms of x. Rather, we define an archetypal element in a new coordinate space, r = ( r s t ), which has a simple, axis-aligned boundary (see Figure 1(b)) and place two maps onto our archetypal element

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom