A computational aspect of real-time estimation is considered, in which the estimation algorithm to be used has the standard optimal Kalman filtering structure, but the actual inverse matrix within the Kalman gain is replaced by an expedient approximation at each instant. In real-time applications, most Kalman filtering schemes are approximate to a degree as a consequence of numerical roundoff matrix inversion. The convergence properties and error estimates of such schemes are obtained to provide a theoretical basis for gauging the utility of using the above approximations of the Kalman gain matrix at each time instant. A new exponentially convergent scheme is also suggested for approximating the inverse matrix within the Kalman gain. Conditions are determined under which online approximate matrix inversion can be eliminated as the cause of Kalman filter divergence in real-time implementations.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Convergence analysis for inexact mechanization of Kalman filtering


    Contributors:


    Publication date :

    1992-07-01


    Size :

    696056 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Adaptive Hybrid Standard/Unscented Kalman Filtering Mechanization for GPS/MEMS IMU Integration

    An, D. / Liccardo, D. / Rios, J. et al. | British Library Conference Proceedings | 2006



    Kalman filter mechanization in INS/seeker fusion and observability analysis

    Ben-Ishai, A. / Reiner, J. / Rotstein, H. | AIAA | 2001



    Mechanization

    Williams, C.C. | Engineering Index Backfile | 1929