The Reproducing Kernel Element Method is a numerical technique that combines finite element and meshless methods to construct shape functions of arbitrary order and continuity, yet retains the Kronecker-d property. Central to constructing these shape functions is the construction of global partition polynomials on an element. This dissertation shows that asymmetric interpolations may arise due to such things as changes in the local to global
node numbering and that may adversely affect the interpolation capability of the method. This issue arises due to the use in previous formulations of incomplete polynomials that are subsequently non-affine invariant. This dissertation lays out the new framework for generating general, symmetric, truly minimal and complete affine invariant global partition polynomials for triangular and tetrahedral elements. It is shown that this new class of
reproducing kernel element solves the asymmetry issue that affected previous developed elements. The interpolation capabilities of this new class of reproducing kernel elements is studied in problems of surface representations and in solving problems of bending of thin plates using a Galerkin approach. Optimal convergence rates were observed in the solution
of Kirchhoff plate problems with rectangular domains. Furthermore, it is shown that the new proposed two-dimensional elements out perform the previous elements with the addition of only a few internal degrees of freedom.
| Identifer | oai:union.ndltd.org:USF/oai:scholarcommons.usf.edu:etd-4371 |
| Date | 01 January 2011 |
| Creators | Juha, Mario Jesus |
| Publisher | Scholar Commons |
| Source Sets | University of South Flordia |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Graduate Theses and Dissertations |
| Rights | default |
Page generated in 0.0019 seconds