 |
|
|
|
|
 |
|
|
Algebraic Construction of Smooth Interpolants on Polygonal Domains
|
|
|
|
|
|
| Organization: | Columbia University |
| Organization: | Columbia University |
| Department: | Department of Civil Engineering and Engineering Mechanics |
|
|
|
|
|
|
2003 International Mathematica Symposium
|
|
|
|
|
|
Imperial College, London
|
|
|
|
|
|
Given a set of vertices for a convex or concave polygon, a smooth and bounded interpolant (valid in the interior of the domain) may be constructed in an explicit algebraic form. Rational polynomial interpolants are suitable for convex polygons; the present treatment addresses concave domains. To resolve the concavity, square roots appear in the numerator and denominator of the rational interpolant. Finite element text books do not generally discuss tessellation into concave domains. Procedural programming languages, which are predominantly used in conventional finite elements, pose formidable challenges to the implementation of abstract geometrical constructs necessary to address convexity issues. Concepts of projective geometry are utilized within Mathematica in symbolic form to yield shape functions on concave polygons.
|
|
|
|
|
|
|
|
|
|
|
|
algebraic construction, concave, convex, polygons
|
|
|
|
|
|
|
|
For the newest resources, visit Wolfram Repositories and Archives »
