jaxsgp4: GPU-accelerated mega-constellation propagation with batch parallelism
Charlotte Priestley, Will Handley

TL;DR
The paper presents jaxsgp4, a GPU-accelerated, highly parallel implementation of the SGP4 orbital propagation algorithm that significantly outperforms traditional methods, enabling rapid large-constellation simulations.
Contribution
It introduces jaxsgp4, a novel JAX-based, GPU-optimized SGP4 implementation that achieves massive speedups and supports large-scale satellite constellation propagation.
Findings
Propagates 9,341 Starlink satellites in under 4 ms on a single GPU.
Achieves a 1500x speedup over traditional C++ implementations.
Uses 32-bit precision to balance accuracy and performance.
Abstract
As the population of anthropogenic space objects transitions from sparse clusters to mega-constellations exceeding 100,000 satellites, traditional orbital propagation techniques face a critical bottleneck. Standard CPU-bound implementations of the Simplified General Perturbations 4 (SGP4) algorithm are less well suited to handle the requisite scale of collision avoidance and Space Situational Awareness (SSA) tasks. This paper introduces \texttt{jaxsgp4}, an open-source high-performance reimplementation of SGP4 utilising the \texttt{JAX} library. \texttt{JAX} has gained traction in the landscape of computational research, offering an easy mechanism for Just-In-Time (JIT) compilation, automatic vectorisation and automatic optimisation of code for CPU, GPU and TPU hardware modalities. By refactoring the algorithm into a pure functional paradigm, we leverage these transformations to execute…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
