Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  autoregressive processes
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
EN
The mean return time of a discrete Markov chain to a point x is the reciprocal of the invariant probability π(x). We revisit this classical theme to investigate certain exit times for stochastic difference equations of autoregressive type. More specifically, we will discuss the asymptotics, as 0, of the first time that the n-dimensional process ...[wzór] (where ξ1, ξ2, . . . is a sequence of i.i.d. random n-vectors) leaves a given neighborhood of the fixed point of the contraction f.
EN
This paper deals with prediction of controlled autoregressive processes with additive white Gaussian noise and random coefficients adapted to an observation process. Our aim is twofold. We begin by extending to the standard Kalman predictor a result of Chen et al. (1989) on the optimality of the standard Kalman filter when applied to linear stochastic processes with almost surely finite random coefficients. We then show on an example how some particular nonlinear autoregressive processes can be embedded in these linear processes with random coefficients. Such nonlinear processes can then benefit from this optimal prediction, which is not provided by the usual extended Kalman predictor.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.