arXiv Analytics

Sign in

arXiv:1610.04985 [math.PR]AbstractReferencesReviewsResources

Some extensions of linear approximation and prediction problems for stationary processes

Ildar Ibragimov, Zakhar Kabluchko, Mikhail Lifshits

Published 2016-10-17Version 1

Let $(B(t))_{t\in \Theta}$ with $\Theta={\mathbb Z}$ or $\Theta={\mathbb R}$ be a wide sense stationary process with discrete or continuous time. The classical linear prediction problem consists of finding an element in $\overline{span}\{B(s),s\le t\}$ providing the best possible mean square approximation to the variable $B(\tau)$ with $\tau>t$. In this article we investigate this and some other similar problems where, in addition to prediction quality, optimization takes into account other features of the objects we search for. One of the most motivating examples of this kind is an approximation of a stationary process $B$ by a stationary differentiable process $X$ taking into account the kinetic energy that $X$ spends in its approximation efforts.

Related articles: Most relevant | Search more
arXiv:0709.3011 [math.PR] (Published 2007-09-19, updated 2008-04-02)
Some extensions of the uncertainty principle
arXiv:1708.08492 [math.PR] (Published 2017-08-28)
Martingale approximations for random fields
arXiv:2411.09257 [math.PR] (Published 2024-11-14)
Iterated Generalized Counting Process and its Extensions