Efficient computation of the geopotential gradient in graphic processing units

被引:0
|
作者
Rubio, Carlos [1 ]
Gonzalo, Jesus [1 ]
Siminski, Jan [2 ]
Escapa, Alberto [1 ]
机构
[1] Univ Leon, Dept Aerosp Engn, Leon, Spain
[2] European Space Operat Ctr ESA ESOC, European Space Agcy, Darmstadt, Germany
关键词
Geopotential gradient computation; LEO orbit propagation; Cunningham formulation; GPU parallelization; CUDA; ORBIT DETERMINATION; HARMONIC SYNTHESIS; MODELS; GPS;
D O I
10.1016/j.asr.2024.04.056
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Efficient computation of the geopotential gradient is essential for numerical propagators, particularly in scenarios involving low Earth orbits. Conventional geopotential calculations are based on spherical harmonics series, which become computationally demanding as the degree/order increases. This computational burden can be mitigated by means of parallelized algorithms. Additionally, certain situations lend themselves to high parallelization, such as the propagation of space debris catalogs, satellite mega -constellations, or the dispersion of particles resulting from a space collision event. This paper introduces an optimized Graphics Processing Unit (GPU) implementation designed to facilitate extensive parallelization in the geopotential gradient calculation. The formulation developed in this study is not specific to any GPU. However, to illustrate the low-level optimizations necessary for an efficient implementation, we selected the Compute Unified Device Architecture (CUDA) as the dominant and de facto standard in parallel computing. Nevertheless, most of the concepts and optimizations presented in this paper are also valid for other GPU architectures. Built upon the spherical harmonic expansion using the Cunningham formulation, which is well -suited for GPU computations, our implementation offers several variants with different tradeoffs between speed and accuracy. Besides GPU double precision, we introduced a mixed precision arithmetic -a hybrid between single and double precision- that exploits GPU capabilities with a low penalty in accuracy. The proposed algorithm was implemented as a software reusable module, and its performance was evaluated against GMAT, GODOT, and Orekit astrodynamic codes. The algorithm's accuracy in double precision is comparable to such codes. The mixed precision version showed enough accuracy for LEO satellite propagation, with around 1 m difference in four days. Testing across different CUDA architectures revealed very high speed-up factors compared to a single CPU, reaching a speed-up of 645 for the mixed precision variant and 450 for the double precision one in the propagation of about 3200 objects with a geopotential of degree/order 126 x 126 using an A100 GPU device. (c) 2024 COSPAR. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页码:332 / 347
页数:16
相关论文
共 50 条
  • [31] Unleashing the Graphic Processing Units-Based Version of NAMD
    Gonzalez, Yamandu
    Ezzatti, Pablo
    Paulino, Margot
    BIOINFORMATICS AND BIOMEDICAL ENGINEERING (IWBBIO 2016), 2016, 9656 : 639 - 650
  • [32] A generic optimization method of multivariate systems on graphic processing units
    Guohong Liao
    Zheng Gong
    Zheng Huang
    Weidong Qiu
    Soft Computing, 2018, 22 : 7857 - 7864
  • [33] Accelerated Conformational Entropy Calculations Using Graphic Processing Units
    Zhang, Qian
    Wang, Junmei
    Guerrero, Gines D.
    Cecilia, Jose M.
    Garcia, Jose M.
    Li, Youyong
    Perez-Sanchez, Horacio
    Hou, Tingjun
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2013, 53 (08) : 2057 - 2064
  • [34] Communication-Avoiding Krylov Techniques on Graphic Processing Units
    MehriDehnavi, Maryam
    El-Kurdi, Yousef
    Demmel, James
    Giannacopoulos, Dennis
    IEEE TRANSACTIONS ON MAGNETICS, 2013, 49 (05) : 1749 - 1752
  • [35] A generic optimization method of multivariate systems on graphic processing units
    Liao, Guohong
    Gong, Zheng
    Huang, Zheng
    Qiu, Weidong
    SOFT COMPUTING, 2018, 22 (23) : 7857 - 7864
  • [36] Parallel Sparse Approximate Inverse Preconditioning on Graphic Processing Units
    Dehnavi, Maryam Mehri
    Fernandez, David M.
    Gaudiot, Jean-Luc
    Giannacopoulos, Dennis D.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (09) : 1852 - 1862
  • [37] PolyFrame, Efficient Computation for 3D Graphic Statics
    Nejur, Andrei
    Akbarzadeh, Masoud
    COMPUTER-AIDED DESIGN, 2021, 134
  • [38] Communication-Computation Efficient Gradient Coding
    Ye, Min
    Abbe, Emmanuel
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [39] Efficient computation of the inverse gradient on irregular domains
    Farneback, Gunnar
    Rydell, Joakim
    Ebbers, Tino
    Andersson, Mats
    Knutsson, Hans
    2007 IEEE 11TH INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS 1-6, 2007, : 2710 - +
  • [40] Efficient gradient computation in optical system optimization
    Pflaum, Martin
    COMPUTATIONAL OPTICS 2024, 2024, 13023