Recursive algorithm for fast GNSS orbit fitting

Gaussian elimination is an efficient and numerically stable algorithm for estimating parameters and their precision. However, before estimating the parameters, it is often prudent to perform statistical tests to achieve the best fitting model. We use Gaussian elimination to select the best fitting model among candidate models. A succinct relationship between the weighted sum of squared residuals and the previous one is revealed by a volume formula. For quick parameter estimation and determination of weighted sum of squared residuals, a recursive elimination algorithm is proposed in the context of Gaussian elimination. In order to improve the model selection efficiency, the parameter estimation and the determination of the weighted sum of squared residuals are carried out in parallel using the proposed recursive elimination algorithm in which the improvement at each recursive stage is judged by the Bayesian information criterion. Ultimately, the computational complexity and numerical stability of the recursive elimination proposed are briefly discussed, and a GNSS orbit interpolation example is used to verify the results. It shows that the proposed recursive elimination algorithm inherits the numerical stability of the Gaussian elimination, and this algorithm can be used to examine the gain from the newly introduced parameter, dynamically assess the fitting model, and fix the optimal model efficiently. The optimal fitting model with the lowest information is very close to the real situation verified by checkpoints.