Current State:
- Working program:
- adaptively polygonizes a parametric curve to minimize open angle between two consecutive line segments, takes the midpoint between two current points to make comparison of angle..
- using a galerkin finite element method, computes general relativistic initial data for axisymmetric spacetime using the above curve as a generator for a marginally trapped surface of revolution.
- uses bisection method to find point on the actual parametric curve that is closest to a given boundary point on the approximating polygon
- Parameters:
- theta0 = opening angle criteria, the closer this is to pi or 180 degrees, the more accurate the approximating polygon will be.
- hmax = "maximum size" of a given finite element, problems occur if this is taken too small
- grade = maximum ratio of the areas of two adjacent elements
- rmax = radius at which the discretization truncates spacetime.
- Interface:
- program is called either from the command line (usage statement is included) or from a perl script which reads a config file and reads the above parameters.
- Specification of curve:
- Curve is written as a parametric curve and a shell script is called to compile a binary file which has a variable maximal radius and discretication.
- Available curves:
- So far, superellipses, squares with rounded corners, and rippled circles have been tested.
|
