A new algorithm for optimal interpolation of discrete-time stationary processes

Author(s):  
Michele Pavon

2015 ◽  
Vol 36 (6) ◽  
pp. 783-796 ◽  
Author(s):  
M. Azimmohseni ◽  
A. R. Soltani ◽  
M. Khalafi


Integers ◽  
2009 ◽  
Vol 9 (2) ◽  
Author(s):  
Paul Shaman

AbstractThe Levinson–Durbin recursion is used to construct the coefficients which define the minimum mean square error predictor of a new observation for a discrete time, second-order stationary stochastic process. As the sample size varies, the coefficients determine what is called a Levinson–Durbin sequence. A generalized Levinson–Durbin sequence is also defined, and we note that binomial coefficients constitute a special case of such a sequence. Generalized Levinson–Durbin sequences obey formulas which generalize relations satisfied by binomial coefficients. Some of these results are extended to vector stationary processes.





1997 ◽  
Vol 34 (3) ◽  
pp. 657-670 ◽  
Author(s):  
R. J. Martin ◽  
A. M. Walker

It is becoming increasingly recognized that some long series of data can be adequately and parsimoniously modelled by stationary processes with long-range dependence. Some new discrete-time models for long-range dependence or slow decay, defined by their correlation structures, are discussed. The exact power-law correlation structure is examined in detail.



2018 ◽  
Vol 97 (4) ◽  
Author(s):  
Markus Nyberg ◽  
Ludvig Lizana


1997 ◽  
Vol 34 (03) ◽  
pp. 657-670 ◽  
Author(s):  
R. J. Martin ◽  
A. M. Walker

It is becoming increasingly recognized that some long series of data can be adequately and parsimoniously modelled by stationary processes with long-range dependence. Some new discrete-time models for long-range dependence or slow decay, defined by their correlation structures, are discussed. The exact power-law correlation structure is examined in detail.





Sign in / Sign up

Export Citation Format

Share Document