Kinematic GPS Batch Processing, a Source for Large Sparse Problems
In kinematic observation processing the equivalence between the state space approach (Kalman filtering plus smoothing) and the least squares approach including dynamic has been shown (Albertella et al., 2006). We will specialize the proposed batch solution (least squares including dynamic), considering the case of discrete-time linear systems with constant biases, a case of practical interest in geodetic applications. A discrete-time linear system leads often to large sparse matrices, and we need efficient matrix operation routines and efficient data structure to store them. Finally, constant biases are estimated using domain decomposition methods. Simulated and real data examples of the technique will be given for kinematic GPS data processing.
KeywordsCarrier Phase Domain Decomposition Method Integer Ambiguity Constant Bias State Space Approach
Unable to display preview. Download preview PDF.
- Kailath T., Sayed A. H., Hassibi B. (2000). Linear estimation, Prentice Hall, New Jersey.Google Scholar
- Saad Y. (2000). Iterative methods for sparse linear systems, Second edition with corrections.Google Scholar
- Teunissen P. (2001). Dynamic data processing, Delft University Press.Google Scholar
- Colomina I., Blàzquez M. (2004). A unified approach to static and dynamic modeling in photogrammetry and remote sensing, In: Altan, O. (ed.), Proceedings of the XXth ISPRS Congress, Istanbul, pp. 178–183.Google Scholar
- Albertella A., Betti B., Sansò F., Tornatore V. (2006). Real time and batch navigation solutions: alternative approaches, In: Bollettino SIFET, n. 2 – 2006.Google Scholar