Download presentation

Presentation is loading. Please wait.

Published byMiguel Groomes Modified over 2 years ago

1
Honor Thesis Presentation Mike Bantegui, Hofstra University Advisor: Dr. Xiang Fu, Hofstra University EFFICIENT SOLUTION OF THE N-BODY PROBLEM

2
OUTLINE The N-Body Problem Computational challenges Results Existing work IGS Framework Extensions

3
THE N-BODY PROBLEM

4
THE N-BODY PROBLEM CONT. Must integrate 3N coupled nonlinear second order ordinary differential equations Not analytically possible except for N = 2 Must resort to numerical methods

5
CANDIDATE NUMERICAL SOLUTION

6
FORCE EVALUATION STEP

7
EXAMPLE FORCE EVALUATION

8
TIME COMPLEXITY

9
ISSUES WITH CANDIDATE SOLUTION

10
“GEOMETRIC TRICK” FOR PARALLELIZATION

13
TIME COMPLEXITY OF GEOMETRIC TRICK

14
ISSUES WITH GEOMETRIC TRICK

15
NAÏVE FORCE EVALUATION SPEEDUP

16
HANDLING CLOSE ENCOUNTERS

17
A MORE EFFICIENT WAY OF EVALUATING FORCE

18
EXAMPLE OF CLUSTERING BODIES

19
HIERARCHICAL FORCE EVALUATION Apply the clustering principle recursively Consider sub-clusters within a cluster Refine force evaluation via sub-clusters instead of main cluster

20
CLUSTERING ALGORITHM Node Cluster(bodies, min_bound, max_bound) If bodies.size == 0 return null if bodies.size == 1 return node containing body Collect bodies into spatial groups For each group Cluster(group.bodies, group.min_bound, group.max_bound) Compute first order multipole expansion, passing up tree return node containing groups

21
METHODS OF SPATIAL SUBDIVISION

22
FORCE EVALUATION ALGORITHM TreeWalk(body) For each branch in the tree If branch is leaf If branch.body != body Compute force of branch.body on body Else Compute distance between branch and body If body is well separated from cluster Compute force of branch on body Else branch.TreeWalk(body)

23
FORCE EVALUATION ALGORITHM, CONT

24
SEPARATION CRITERIA

25
TIME COMPLEXITY OF TREE WALK

26
OVERVIEW OF HIERARCHICAL ALGORITHM

27
PARALLELIZING TREE METHODS

28
SCALING TO LARGE N, OCTREE

29
SCALING TO LARGE N, KD-TREE

30
SCALING TO LARGE N, BRUTE FORCE

31
BRUTE FORCE VS TREE METHODS

32
ENERGY ERRORS

33
ENERGY ERRORS CONT.

34
RELATED WORK nbody1 – nbody6, Sverre Aarseth ACS toolkit, Jun Makino and Piet Hut Grav-Sim, Mark Ridler Gravit, Gerald Kaszuba et al.

35
THE PROPOSED FRAMEWORK Component based Interactive Gravitational Simulator CoreIGS – Core simulation library CmdIGS – Command line driven interface VisIGS – Interactive visualizer

36
SOFTWARE ARCHITECTURE

37
PROJECT STATS Open Source – Available at IGS.codeplex.com 3 + years development 5670 lines of code 65. cpp,.h files 107 subversion revisions 8 development iterations Many failures before success!

38
EXTENSIONS

39
CONCLUSIONS Tree methods very efficient Performance vs. Accuracy tradeoff possible Extremely parallelizable Accurate, real-time simulations possible on commodity hardware

40
ACKNOWLEDGEMENTS Dr. Xiang Fu for advisement and helpful discussions Dr. Gerda Kamberova for helpful comments on the paper Lukasz Bator for many discussions on algorithmic efficiency

41
THANK YOU FOR COMING! Any questions?

Similar presentations

OK

Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction Ananth Grama, Purdue University Vivek Sarin, Texas A&M University Hemant.

Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction Ananth Grama, Purdue University Vivek Sarin, Texas A&M University Hemant.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on advertisement of honda city Ppt on idiopathic thrombocytopenia purpura treatment Ppt on home automation using mobile communication Ppt on carburetor parts Ppt on op amp circuits applications Ppt on taj mahal conservation Ppt on forward contracts Free download ppt on green revolution Ppt on condition based maintenance definition Ppt on amplitude shift keying experiment