Numerical methods and programming
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Num. Meth. Prog.: Year: Volume: Issue: Page: Find

 Num. Meth. Prog., 2010, Volume 11, Issue 2, Pages 168–175 (Mi vmp307)

Âû÷èñëèòåëüíûå ìåòîäû è ïðèëîæåíèÿ

A parallel algorithm for solving the gravitational physics problems based on domain decomposition

E. A. Kuksheva, V. N. Snytnikov

Boreskov Institute of Catalysis SB RAS, Novosibirsk

Abstract: A parallel algorithm for solving the unsteady 3D problems of collisionless dynamics in the case of more than $10^9$ bodies in a self-consistent gravitational field in Cartesian coordinates is proposed. The algorithm is based on the computational domain decomposition method. The parallel code that implements this algorithm can be used to perform computations on grids of more than $1000^3$ nodes. Some results of supercomputer simulation obtained by the code are discussed.

Keywords: mathematical simulation; supercomputer; parallel programming; astrophysics.

Full text: PDF file (768 kB)
UDC: 519.632.4

Citation: E. A. Kuksheva, V. N. Snytnikov, “A parallel algorithm for solving the gravitational physics problems based on domain decomposition”, Num. Meth. Prog., 11:2 (2010), 168–175

Citation in format AMSBIB
\Bibitem{KukSny10} \by E.~A.~Kuksheva, V.~N.~Snytnikov \paper A parallel algorithm for solving the gravitational physics problems based on domain decomposition \jour Num. Meth. Prog. \yr 2010 \vol 11 \issue 2 \pages 168--175 \mathnet{http://mi.mathnet.ru/vmp307}