This paper presents a simple approach to the derivation of sensitivity measures of smoothing algorithms. It is proposed that the known sensitivity results of the Kalman filtering algorithm be utilized along with the state augmentation approach for this purpose. The sensitivity measures so obtained are easier to compute than the ones available in the literature. It is then shown that the fixed-point smoothing algorithm, derived recently by Biswas and Mahalanabis [1], [2], is less sensitive to model parameter variations than the algorithm studied by Griffin and Sage [7], [8]. The case of a satellite tracking problem is presented by way of illustrating the results.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On the Sensitivity of a Fixed-Point Smoothing Algorithm


    Beteiligte:
    Sinha, A.K. (Autor:in) / Mahalanabis, A.K. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1973-11-01


    Format / Umfang :

    1632942 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    On the sensitivity of a fixed-point smoothing algorithm

    Sinha, A. / Mahalanabis, A. | Tema Archiv | 1973


    An Approach to Fixed-Point Smoothing Problems

    Biswas, K.K. / Mahalanabis, A.K. | IEEE | 1972



    Fixed interval smoothing - Revisited

    MCREYNOLDS, STEPHEN RALPH | AIAA | 1990


    A d-step Fixed-lag Smoothing Algorithm for Markovian Switching Systems

    Pan, Q. / Jia, Y. G. / Zhang, H. C. et al. | British Library Conference Proceedings | 2002