A conjugate gradient algorithm for the astrometric core solution of Gaia
Alex Bombrun (1), Lennart Lindegren (2), David Hobbs (2), Berry Holl, (2), Uwe Lammers (3), Ulrich Bastian (1) ((1) ARI, Heidelberg, Germany,, (2) Lund Observatory, Sweden, (3) ESAC, Madrid, Germany)

TL;DR
This paper introduces a conjugate gradient algorithm for Gaia's astrometric data processing, demonstrating faster convergence and improved accuracy over previous methods within the AGIS framework.
Contribution
It adapts and implements a conjugate gradient algorithm for Gaia's astrometric core solution, showing significant efficiency and accuracy improvements over simple iteration methods.
Findings
CG converges up to four times faster than SI.
CG effectively dampens spatially correlated errors.
Solutions are consistent with rigorous least-squares estimation.
Abstract
The ESA space astrometry mission Gaia, planned to be launched in 2013, has been designed to make angular measurements on a global scale with micro-arcsecond accuracy. A key component of the data processing for Gaia is the astrometric core solution, which must implement an efficient and accurate numerical algorithm to solve the resulting, extremely large least-squares problem. The Astrometric Global Iterative Solution (AGIS) is a framework that allows to implement a range of different iterative solution schemes suitable for a scanning astrometric satellite. In order to find a computationally efficient and numerically accurate iteration scheme for the astrometric solution, compatible with the AGIS framework, we study an adaptation of the classical conjugate gradient (CG) algorithm, and compare it to the so-called simple iteration (SI) scheme that was previously known to converge for this…
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.
