blob: 334dc9f6bfa0238d6edcf5f83d78618ef70b5cbd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
This directory contains top-level routines to find the apparent horizon
and interface with the rest of Cactus.
The main source files in this directory are as follows:
README.parallel
design notes for the parallel/multiprocessor algorithms
and data structures
driver.hh
overall header file for routines in this directory
state.cc
state information (data structures) kept across Cactus scheduler calls
setup.cc # sees CCTK_ARGUMENTS, CCTK_PARAMETERS
this is called from the scheduler to setup our data structures
find_horizons.cc # sees CCTK_ARGUMENTS, CCTK_PARAMETERS
this is called from the scheduler to find the apparent horizon(s)
in a slice
initial_guess.cc
this sets up the initial guess(es) for the horizon position(s)
Newton.cc # sees cGH (for interprocessor broadcasts)
# uses CCTK_ReduceLocArrayToArray1D() for
# interprocessor broadcast/synchronization
this solves the Theta(h) = 0 equations by Newton's method
io.cc
I/O routines
ellipsoid.maple
this is a Maple script to compute the intersection of a given
ray with an ellipsoid; this is used in setting up the initial guess
ellipsoid.c
this is the Maple-generated code from "ellipsoid.maple"
ellipsoid.log
this is the standard output from running "ellipsoid.maple"
|
