|
|
![]() ![]() ![]() ![]() ![]() ![]() |
This page serves as an overview for the Finite Element
Method Code. The code is based on the the work of Micheal Gibbons and
Arjun Raj's finite element method for the Sierpinski Gasket, and Kevin
Coletta's code for irregular decompositions. Both of their websites
serve as a fine starting point for learning the code, but this one is
designed to be self-sufficient The coding was done in Maple 7, a high-level mathematics program, and Maple is required to run it. However, at some point, most of this will be transported into C++, allowing anyone to use the code, as well as gain much-needed speed. I have divided the overview into the following links: Short Tutorial on Using the Finite Element Method How the Internal Data Structures Work Outline on the Use of Individual Functions
|