|
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
|
|
MPI or more generally message passing is not obsolete but rather the only complete solution!
|
|
Higher level systems DAGH and especially HPF 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
|
This is a SINGLE file Containing all Foils in nonIMAGE (i.e. HTML) form
This contains all WebWisdom links preceded by those referenced in this foilset
This contains an Index of Foilset Suitable for Printing (There is no easy way of Printing
all foils -- just the index)
This just contains Title of Foilset and Links
