A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study

Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Kalman Filters, Numerical Stability, Orbit Calculation, Spacecraft Orbits, Transformations (Mathematics), Algorithms, Computerized Simulation, Covariance, Error Analysis, Linear Filters, Planetary Orbits

Scientific paper

An improved Kalman filter algorithm based on a modified Givens matrix triangularization technique is proposed for solving a nonstationary discrete-time linear filtering problem. The proposed U-D covariance factorization filter uses orthogonal transformation technique; measurement and time updating of the U-D factors involve separate application of Gentleman's fast square-root-free Givens rotations. Numerical stability and accuracy of the algorithm are compared with those of the conventional and stabilized Kalman filters and the Potter-Schmidt square-root filter, by applying these techniques to a realistic planetary navigation problem (orbit determination for the Saturn approach phase of the Mariner Jupiter-Saturn Mission, 1977). The new algorithm is shown to combine the numerical precision of square root filtering with the efficiency of the original Kalman algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1567513

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.