We describe basic physics and computational features of Binary Black Collision Grand Challenge |
We show a simple finite difference is complicated by
|
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 |
001 HPF & DAGH usage in the Binary Black Hole Grand Challenge 002 Goals of the Alliance 003 Computational Infrastructure 004 ADM Equations 005 ADM Equations continued 006 Causal Differencing 007 Causal Differencing continued 008 Apparent Horizon boundary conditions 009 Difficulties of the BBH Problem 010 DAGH System 011 Parallel Execution in DAGH 012 Parallel Execution in DAGH continued 013 Implementation 014 Sample of HPF and DAGH code 015 Linear Waves 016 Black holes (Inner boundary condition) 017 Black holes continued 018 Linear wave problem with outer boundary condition 019 Moving Inner boundary 020 Moving Inner boundary continued 021 Finding the Apparent Horizon 022 Elliptic Problem for the shift