We describe basic physics and computational features of Binary Black Collision Grand Challenge |
We show a simple finite difference is complicated by
|
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 |
001 Goals of the Alliance 002 Computational Infrastructure 003 Memory requirements 004 Memory requirements (contiued) 005 ADM Equations 006 ADM Equations (continued) 007 ADM Equations (continued) 008 Causual Differencing 009 Causual Differencing (continued) 010 Apparent Horizon boundary Conditions 011 Computational components/modules 012 HPF and HPF2 013 DAGH 014 DAGH (continued) 015 DAGH (continued) 016 DAGH (continued) 017 Conversion of an existing Fortran 90 implementation to DAGH 018 F90 to DAGH: communication 019 F90 to DAGH: Passing data 020 Automatic translation 021 IMPLEMENTATION 022 IMPLEMENTATION 023 IMPLEMENTATION 024 1. Linear waves 025 2. Finding the Apparent Horizon 026 3a. Black Holes (Inner Boundary Condition 027 Inner Boundary condition (continued) 028 Inner Boundary Conditions (continued) 029 Inner Boundary Conditions (continued) 030 Inner Boundary Conditions (continued) 031 Inner Boundary Condition. Variable stencil size 032 3b. Moving Inner Boundary (A Moving Hole) 033 Moving Hole (Continued) 034 Moving Hole (continued) 035 4. Linear wave problem with matching outer boundary condition for gravitational wave extraction. 036 Matching interior and exterior evolution 037 5. Support for (parallel) AMR