Comment on "A z-Transform Discrete-Time State-Space Formulation for Aeroelastic Stability Analysis"

2009 ◽  
Vol 46 (5) ◽  
pp. 1823-1823
Author(s):  
A. Tewari
Keyword(s):  
Stability Analysis ◽  
State Space ◽  
Discrete Time ◽  
Aeroelastic Stability ◽  
Space Formulation

A z-Transform Discrete-Time State-Space Formulation for Aeroelastic Stability Analysis

2008 ◽  
Vol 45 (5) ◽  
pp. 1564-1578 ◽  
Author(s):  
Alexandre Noll Marques ◽  
Joao Luiz F. Azevedo
Keyword(s):  
Stability Analysis ◽  
State Space ◽  
Discrete Time ◽  
Aeroelastic Stability ◽  
Space Formulation

Dynamic analysis of structures with friction devices using discrete-time state-space formulation

2006 ◽  
Vol 84 (15-16) ◽  
pp. 1049-1071 ◽  
Author(s):  
Lyan-Ywan Lu ◽  
Lap-Loi Chung ◽  
Lai-Yun Wu ◽  
Ging-Long Lin
Keyword(s):  
Dynamic Analysis ◽  
State Space ◽  
Discrete Time ◽  
Space Formulation

scholarly journals Stability Analysis of the Bat Algorithm Described as a Stochastic Discrete-Time State-Space System

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Janusz Piotr Paplinski
Keyword(s):  
Stability Analysis ◽  
State Space ◽  
Discrete Time ◽  
Sufficient Conditions ◽  
Lyapunov Stability Theory ◽  
Bat Algorithm ◽  
Discrete Time System ◽  
Space System ◽  
State Matrix ◽  
State Space System

The main problem with the soft-computing algorithms is a determination of their parameters. The tuning rules are very general and need experiments during a trial and error method. The equations describing the bat algorithm have the form of difference equations, and the algorithm can be treated as a stochastic discrete-time system. The behaviour of this system depends on its dynamic and preservation stability conditions. The paper presents the stability analysis of the bat algorithm described as a stochastic discrete-time state-space system. The observability and controllability analyses were made in order to verify the correctness of the model describing the dynamic of BA. Sufficient conditions for stability are derived based on the Lyapunov stability theory. They indicate the recommended areas of the location of the parameters. The analysis of the position of eigenvalues of the state matrix shows how the different values of parameters affect the behaviour of the algorithm. They indicate the recommended area of the location of the parameters. Simulation results confirm the theory-based analysis.

Stability analysis for discrete-time fractional-order LTI state-space systems. Part II: New stability criterion for FD-based systems

2013 ◽  
Vol 61 (2) ◽  
pp. 363-370 ◽  
Author(s):  
R. Stanisławski ◽  
K.J. Latawiec
Keyword(s):  
Stability Analysis ◽  
State Space ◽  
Discrete Time ◽  
Stability Criterion ◽  
Space Systems ◽  
Fractional Difference ◽  
Sufficient Stability ◽  
State Space Systems ◽  
Finite Memory ◽  
Necessary And Sufficient

Abstract This paper presents a series of new results on the asymptotic stability of discrete-time fractional difference (FD) state space systems and their finite-memory approximations called finite FD (FFD) and normalized FFD (NFFD) systems. In Part I of the paper, new necessary and sufficient stability conditions have been given in a unified form for FD, FFD and NFFD-based systems. Part II offers a new, simple, ultimate stability criterion for FD-based systems. This gives rise to the introduction of new definitions of the so-called f-poles and f-zeros for FD-based systems, which are used in the closed-loop stability analysis for FD-based systems and, approximately, for FFD/NFFD-based ones

Sign in / Sign up

Export Citation Format

Share Document