On recovering missing values for sequences in a pathwise setting
Abstract
The paper suggests a frequency criterion of error-free recoverability of a missing value for sequences, i.e. discrete time processes, in a pathwise setting without probabilistic assumptions. The paper establishes error-free recoverability for classes of square-summable sequences with Z-transform vanishing at isolated points with a mild rate; the case of non-summable sequences is not excluded. The transfer functions for recovering algorithm are presented explicitly. Some robustness with respect to noise contamination is established for the suggested recovering algorithm.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.