Mean square exponential stabilization of uncertain time‐delay stochastic systems with fractional Brownian motion

Author(s):  
Majid Parvizian ◽  
Khosro Khandani
2011 ◽  
Vol 63-64 ◽  
pp. 974-977
Author(s):  
Yun Chen ◽  
Qing Qing Li

By introducing an additional vector, a new delay-dependent controller is designed for stochastic systems with time delay in this paper. The presented controller is formulated by means of LMI, and it guarantees robust asymptotical mean-square stability of the resulting closed-loop system. Our result shows advantage over some existing ones, which is demonstrated by a numerical example.


Author(s):  
Viktor Bondarenko

Fractional Brownian motion as a method for estimating the parameters of a stochastic process by variance and one-step increment covariance is proposed and substantiated. The root-mean-square consistency of the constructed estimates has been proven. The obtained results complement and generalize the consequences of limit theorems for fractional Brownian motion, that have been proved in the number of articles. The necessity to estimate the variance is caused by the absence of a base unit of time and the estimation of the covariance allows one to determine the Hurst exponent. The established results let the known limit theorems to be used to construct goodness-of-fit criteria for the hypothesis “the observed time series is a transformation of fractional Brownian motion” and to estimate the error of optimal forecasting for time series.


2019 ◽  
Vol 24 (4) ◽  
Author(s):  
Yuliya Mishura ◽  
Sergiy Shklyar

We consider the distance between the fractional Brownian motion defined on the interval [0,1] and the space of Gaussian martingales adapted to the same filtration. As the distance between stochastic processes, we take the maximum over [0,1] of mean-square deviances between the values of the processes. The aim is to calculate the function a in the Gaussian martingale representation ∫0ta(s)dWs that minimizes this distance. So, we have the minimax problem that is solved by the methods of convex analysis. Since the minimizing function a can not be either presented analytically or calculated explicitly, we perform discretization of the problem and evaluate the discretized version of the function a numerically.


Sign in / Sign up

Export Citation Format

Share Document