We describe basic physics and computational features of Binary Black Collision Grand Challenge
|
We show a simple finite difference is complicated by
-
Adaptive Mesh refinement
-
Complex inner and outer boundary conditions
-
Need for several algorithms for hyberbolic and elliptic parts of problem
|
High level systems DAGH and especially HPF1 cannot express full complexity of problem and MPI must fill in the missing parts
|
HPF2 might be able to express full problem but HPF1 misses many key capabilities
|
DAGH is more succesful than HPF1 but needs MPI for parts of problem
|
Postscript or FramemakerVersion
|
HPF Code for Linear Waves
|
Grand Challenge Alliance Home Page
|
NPAC Activity in Grand Challenge Alliance
|