Solution methods of plants location dynamic problems in continuous-time

Author(s):  
Alexander P. Uzdemir
2009 ◽  
pp. 104-122 ◽  
Author(s):  
Mitsuo Yoshida ◽  
Takehiro Mori

Global stability analysis for complex-valued artificial recurrent neural networks seems to be one of yet-unchallenged topics in information science. This chapter presents global stability conditions for discrete-time and continuous- time complex-valued recurrent neural networks, which are regarded as nonlinear dynamical systems. Global asymptotic stability conditions for these networks are derived by way of suitable choices of activation functions. According to these stability conditions, there are classes of discrete-time and continuous-time complex-valued recurrent neural networks whose equilibrium point is globally asymptotically stable. Furthermore, the conditions are shown to be successfully applicable to solving convex programming problems, for which real field solution methods are generally tedious.


Author(s):  
Linzhang Lu ◽  
C. E. M. Pearce

AbstractWe give a simple and transparent proof for the square-root method of solving the continuous-time algebraic Riccati equation. We examine some benefits of combining the square-root method with other solution methods. The iterative square-root method is also discussed. Finally, paradigm numerical examples are given to compare the square-root method with the Schur method.


2007 ◽  
Vol 44 (02) ◽  
pp. 285-294 ◽  
Author(s):  
Qihe Tang

We study the tail behavior of discounted aggregate claims in a continuous-time renewal model. For the case of Pareto-type claims, we establish a tail asymptotic formula, which holds uniformly in time.


2018 ◽  
Vol 23 (4) ◽  
pp. 774-799 ◽  
Author(s):  
Charles C. Driver ◽  
Manuel C. Voelkle

IEE Review ◽  
1991 ◽  
Vol 37 (6) ◽  
pp. 228
Author(s):  
Stephen Barnett

Sign in / Sign up

Export Citation Format

Share Document