The N-body problem in classical physics, is the calculation of force ofgravitational attraction of heavenly bodies towards each other. Solving this problem for many heavenly bodies has always posed a challenge to phy...The N-body problem in classical physics, is the calculation of force ofgravitational attraction of heavenly bodies towards each other. Solving this problem for many heavenly bodies has always posed a challenge to physicists andmathematicians. Large number of bodies, huge masses, long distances and exponentially increasing number of equations of motion of the bodies have been themajor hurdles in solving this problem for large and complex galaxies. Adventof high performance computational machines have mitigated the problem to muchextent, but still for large number of bodies it consumes huge amount of resourcesand days for computation. Conventional algorithms have been able to reduce thecomputational complexity from O n2 ð Þ to O nlogn ð Þ by splitting the space into atree or mesh network, researchers are still looking for improvements. In thisresearch work we propose a novel solution to N-body problem inspired by metaheuristics algorithms. The proposed algorithm is simulated for various time periods of selected heavenly bodies and analyzed for speed and accuracy. Theresults are compared with that of conventional algorithms. The outcomes showabout 50% time saving with almost no loss in accuracy. The proposed approachbeing a metaheuristics optimization technique, attempts to find optimal solution tothe problem, searching the entire space in a unique and efficient manner in a verylimited amount of time.展开更多
基金This research study has been supported by National Center in Big Data and Cloud Computing,NED University of Engincering and Technology,Karachi,Pakistan.
文摘The N-body problem in classical physics, is the calculation of force ofgravitational attraction of heavenly bodies towards each other. Solving this problem for many heavenly bodies has always posed a challenge to physicists andmathematicians. Large number of bodies, huge masses, long distances and exponentially increasing number of equations of motion of the bodies have been themajor hurdles in solving this problem for large and complex galaxies. Adventof high performance computational machines have mitigated the problem to muchextent, but still for large number of bodies it consumes huge amount of resourcesand days for computation. Conventional algorithms have been able to reduce thecomputational complexity from O n2 ð Þ to O nlogn ð Þ by splitting the space into atree or mesh network, researchers are still looking for improvements. In thisresearch work we propose a novel solution to N-body problem inspired by metaheuristics algorithms. The proposed algorithm is simulated for various time periods of selected heavenly bodies and analyzed for speed and accuracy. Theresults are compared with that of conventional algorithms. The outcomes showabout 50% time saving with almost no loss in accuracy. The proposed approachbeing a metaheuristics optimization technique, attempts to find optimal solution tothe problem, searching the entire space in a unique and efficient manner in a verylimited amount of time.
