ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1809.00301
99
7
v1v2v3 (latest)

Stable approximation schemes for optimal filters

2 September 2018
Dan Crisan
A. López-Yela
Joaquín Míguez
ArXiv (abs)PDFHTML
Abstract

A stable filter has the property that it asymptotically `forgets' initial perturbations. As a result of this property, it is possible to construct approximations of such filters whose errors remain small in time, in other words approximations that are uniformly convergent in the time variable. As uniform approximations are ideal from a practical perspective, finding criteria for filter stability has been the subject of many papers. In this paper we seek to construct approximate filters that stay close to a given (possibly) unstable filter. Such filters are obtained through a general truncation scheme and, under certain constraints, are stable. The construction enables us to give a characterisation of the topological properties of the set of optimal filters. In particular, we introduce a natural topology on this set, under which the subset of stable filters is dense.

View on arXiv
Comments on this paper