Discrete-time noise-tolerant Z-type model for online solving nonlinear time-varying equations in the presence of noises

2022 ◽  
Vol 403 ◽  
pp. 113824
Author(s):  
Zhongbo Sun ◽  
Yongbai Liu ◽  
Gang Wang ◽  
Yufeng Lian ◽  
Keping Liu ◽  
...  
2009 ◽  
Vol 34 (12) ◽  
pp. 1529-1533 ◽  
Author(s):  
Mai-Ying ZHONG ◽  
Shuai LIU ◽  
Hui-Hong ZHAO

Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 99-125
Author(s):  
Edward W. Kamen

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z−i by time functions, which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of zi at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.


2013 ◽  
Vol 9 ◽  
pp. 27-41 ◽  
Author(s):  
Adam Czornik ◽  
Michał Niezabitowski

Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.


Sign in / Sign up

Export Citation Format

Share Document