Reachable Set Analysis for Dynamic Neural Networks with Polytopic Uncertainties
|
|
- Belinda Mathews
- 6 years ago
- Views:
Transcription
1 Commun. Theor. Phys. 57 (2012) Vol. 57, No. 5, May 15, 2012 Reachable Set Analysis for Dynamic Neural Networks with Polytopic Uncertainties ZUO Zhi-Qiang ( ãö), CHEN Yin-Ping (í ), an WANG Yi-Jing ( è ) Tianjin Key Laboratory of Process Measurement an Control, School of Electrical Engineering an Automation, Tianjin University, Tianjin , China (Receive November 7, 2011; revise manuscript receive December 22, 2011) Abstract n this paper, the reachable set estimation problem is stuie for a class of ynamic neural networks subject to polytopic uncertainties. The problem aresse here is to fin a set as small as possible to boun the states starting from the origin by inputs with peak values. The maximal Lyapunov functional is propose to erive a sufficient conition for the existence of a non-ellipsoial boun to estimate the states of neural networks. t is theoretically shown that this metho is superior to the traitional one base on the common Lyapunov function. Finally, two examples illustrate the avantages of our propose result. PACS numbers: i Key wors: neural networks, reachable set, polytopic uncertainties, maximal Lyapunov functional 1 ntrouction Dynamic neural networks analysis has attracte the increasing attention of researchers in the past ecaes ue to the successful applications in solving pattern recognition, associative memory, optimization problem, ientification an control, static image processing. Different kins of neural networks moels have been propose an stuie. To mention a few, we refer to [1] [3] references therein. Up to now, most works on ynamic neural networks have focuse on the stability analysis problem an a lot of results have been reporte for ifferent kins of neural networks, see, for example Refs. [4] [10]. Since neural networks can be viewe as a special class of nonlinear ynamic systems, many concepts originally appeare in control theory have been introuce to analyze the neural networks, such as, controllability, [11 12] state estimation, [13 15] input-tostate stability (SS), [16 17] passivity, [18 19] an so on. On the other han, uncertainties are inevitably encountere in practice. Generally speaking, there are mainly two kins of uncertainties, namely, the normboune uncertainty an the polytopic ones. t is well known the existence of uncertainty may lea to instability of neural networks. Therefore, much attention is evote to robust stability analysis of neural networks, for instance Refs. [20] [22]. As we known, the common Lyapunov function can lea to easily tractable matrix inequalities or linear matrix inequalities conitions. However, it probably yiels conservative evaluation of stability an performance. For example, systems with polytopic uncertainties may be stable without having a common Lyapunov function. As an important approach for state estimation an parameter estimation in control theory, a lot of works have been evote to the reachable set bouning, for example Refs. [23] [25]. All the above results on reachable set estimation are expresse in the form of ellipsoi. f there are polytopic uncertainties for systems, the common Lyapunov function has to be use for all the vertices of the polytope. To the best of our knowlege, there is no ocument available concerning reachable set estimation for uncertain neural networks, which motivates our stuy. n this paper, we evelop the reachable set bouning for ynamic neural networks subject to both polytopic uncertainties an boune peak inputs. We propose a maximal Lyapunov functional, which is obtaine by taking pointwise maximum over a family of Lyapunov functionals, to erive a tighter non-ellipsoial boun of the reachable sets. This metho shows great avantages over the traitional one base on common Lyapunov function. Finally, two numerical examples are provie to illustrate the usefulness of our theoretical results. Notations The notations use throughout the paper are stanar. R n enotes the n-imensional Eucliean space. The superscript T enotes matrix transposition, an an 0 enote the ientity an zero matrix with appropriate imension. The notation P > 0 (P 0) means that P is symmetric an positive efinite (positive semi-efinite). Co{ } enotes a convex hull. iag{l 1, l 2,...,l n } stans for a iagonal matrix with iagonal elements being the scalars l 1, l 2,...,l n. The symmetric terms in a symmetric matrix are enote by. Matri- Supporte by the National Natural Science Founation of China uner Grant Nos , , , , Program for New Century Excellent Talents in University uner Grant No. NCET , an the nepenent nnovation Founation of Tianjin University Corresponing author, zqzuo@tju.eu.cn c 2011 Chinese Physical Society an OP Publishing Lt
2 No. 5 Communications in Theoretical Physics 905 ces, if not explicitly state, are assume to have compatible imensions. For a matrix P > 0, enote E(P, 1) : = {x R n : x T Px 1}. For a general Lyapunov function V, enote its 1-level set as L V : = {x R n : V (x) 1}. 2 Problem Formulation an Preliminaries Consier the following ynamic neural networks ẋ(t) = Cx(t) + Af(x(t)) + J(t), (1) where x(t) = [x 1 (t) x 2 (t) x n (t)] T R n is the state vector of the neural networks. C = iag{c 1, c 2,...,c n } is a constant iagonal matrix with c i > 0; f(x(t)) = [f 1 (x 1 (t)), f 2 (x 2 (t)),..., f n (x n (t))] T R n is the activation of neurons. A = (a ij ) n n is the connection weight matrix; J(t) represents external inputs with the form J T (t)j(t). (2) Furthermore, the activation function f i ( ) (i = 1, 2,...,n) is assume to satisfy the following conition 0 f i(s 1 ) f i (s 2 ) s 1 s 2 l i, (3) for any s 1, s 2 R, s 1 s 2, where l i > 0 (i = 1, 2,...,n) are positive scalars. Matrices C, A are uncertain but belong to a given polytope Φ = [C A], (4) Φ = θ i Φ i, θ i 0, θ i = 1, (5) where the N vertices of the polytope are escribe by Φ i = [C i A i ], (i = 1, 2,..., N). By (3), it is easy to see f j (x j (t))[f j (x j (t)) l j x j (t)] 0 (j = 1, 2,..., n). (6) From the above inequality (6), for any non-negative iagonal matrix H = iag{h 1, h 2,..., h n }, the following conition hols n 2 h j f j (x j (t))[l j x j (t) f j (x j (t))] 0, j=1 which can be rewritten as 2[x T (t)lhf(x(t)) f T (x(t))hf(x(t))] 0. (7) n this paper, we will construct a function which is the maximum of a family of Lyapunov functions. Each Lyapunov function correspons to a vertex of the polytope (i.e., Φ i ). Given a family of matrices P j > 0, (j = 1, 2,..., N), the pointwise maximum quaratic function is efine as V max = max{x T P j x}. The 1-level set of V max is enote as L Vmax : = {x R n : V max 1}. Since V max is strict convex an not ifferentiable everywhere, we introuce the efinitions of subgraient an subifferential to characterize the behavior at nonifferentiable points. Let g : R n R be a real-value convex function in R n, a vector v is calle a subgraient at a point x 0 if g(x) g(x 0 ) v T (x x 0 ), x R n. The set of all subgraients at x 0 is calle the subifferential at x 0 an is enote as f(x 0 ). The function f(x) is ifferentiable at x 0 if an only if the subifferential is mae up of only one point, which is the erivative at x 0. Consier x 0 R n. Suppose that there exists an integer s (1 < s N) such that V max (x 0 ) = x T 0 P jx 0 for j = 1,...,s an V max (x 0 ) > x T 0 P j x 0 for j > s. Base on the results in [26], we have the following properties: (i) for a vector ζ R n, the irectional erivative of V max at x 0 along ζ is ζ V max (x 0 ) = lim t 0 + V max (x 0 + tζ) V max (x 0 ) t = max ξ V max(x 0) {ξt ζ} ; (ii) V max (x 0 ) = Co{2P j x 0, j = 1,...,s}. The following lemma is an extension of the reachable set estimation for ynamic systems to that for neural networks (1). Lemma [27] Let V be a Lyapunov function for neural networks (1). f V (x) + αv (x) α J T (t)j(t) 0, t then we have V (x) 1. 3 Main Results Theorem 1 f there exist matrices P j > 0 with compatible imensions, a non-negative iagonal matrix H, an scalars α > 0, β ij 0 for all i, j = 1, 2,..., N such that Γ = Γ 11 P j A i + LH P j 2H 0 α Γ 11 = P j C i Ci T P j + αp j + β ij (P j P i ), < 0, (8) then for all the amissible polytopic uncertainties, the intersection of a family of ellipsois, i.e., E(P j, 1) (9) j=1, 2,..., N is a set which bouns the reachable set of neural networks (1), where E(P j, 1) = {x R n : x T P j x 1}. Proof Given a family of matrices P j > 0, the pointwise maximum Lyapunov functional is chosen as where V max (x) = max{v j (x)}, j = 1, 2,...,N, (10) For x 0, we efine V j (x) = x T (t)p j x(t). N max (x) : = {j {1, 2,..., N} : V j (x) = V max (x)}.
3 906 Communications in Theoretical Physics Vol. 57 t follows that V j (x) < V max if j / N max (x). Without loss of generality, we assume that N max (x) = {1, 2,..., n 1 } for some integer n 1 N. Here n 1 is the number of ellipsois E(P j, 1) s intersecte at x. Therefore, V j (x) = V max (x) for j n 1 an V j (x) < V max (x) for j > n 1. Now we know x T (P j P i )x 0, j n 1, i {1, 2,..., N}. (11) To better illustrate the thoughts of our proof, we efine a set Υ j = {x R n : V j (x) V i (x), i j}, an consier two ifferent cases for x. (i) f x Υ j \ i =j Υ i (i.e., x is ifferentiable), then where V max = x T (t)p j x(t), t V max + αv max α J T (t)j(t) ζ T (t) ζ T (t) = [ x T (t) f T (x(t)) J T (t) ]. f (8) is satisfie, then using convexity property, we have: t V max + αv max α J T (t)j(t) β ij x T (P i P j )x 0. The last inequality hols because x T (P i P j )x 0 if x Υ j \ i =j Υ i. This implies that V max 1 by Lemma 1. (ii) f x n1 j=1 Υ j\ N j=n Υ 1+1 j, it is clear that x belongs to the intersection of Υ j s (j = 1, 2,...,n 1). This means that x is nonifferentiable. As a result, V max = x T P j x, j N max (x) an V max = Co{2P j x : j N max (x)}. Therefore, provie that (8) is met, we obtain ẋv max (x) + αv max (x) α J T (t)j(t) max β ij x T (P i P j )x. j N max(x) Note that (11) is satisfie in such a case. Therefore we can raw the conclusion that V max 1. t is easy to see that L Vmax is the intersection of the ellipsois E(P j, 1) s. This point can be verifie as follows. On the one han, if x belongs to the intersection of E(P j, 1) s, then x belongs to any ellipsoi E(P j, 1), j = 1, 2,..., N. Therefore, x belongs to L Vmax. On the other han, we suppose that x L Vmax. Since V max = max{x T P j x}, it is obvious that x T P j x 1 for all j = 1, 2,..., N. This implies that x belongs to the intersection of E(P j, 1) s. Remark 1 We have constructe a function which is the maximum of a family of Lyapunov functions in Theorem 1. t V max = 2 x T (t)p j ẋ(t) Then we have = 2 x(t) T P j [ Cx(t) + Af(x(t)) + J(t)] 2x T (t)p j [ Cx(t) + Af(x(t)) + J(t)] + 2 [ x T (t)lhf(x(t)) f T (x(t))hf(x(t))]. (12) P j C C T P j + αp j P j A + LH P j 2H 0 α ζ(t), (13) t is well known that the common Lyapunov function will lea to easily tractable matrix inequality conitions an simplify computational issues even though it may bring conservatism to some extent. Remark 2 The neural networks with polytopic uncertainties of the form (4) an (5) is consiere in this paper. Both the maximum Lyapunov functional propose in (11) an the common Lyapunov function can be use to boun all the states starting from the origin. As for the robust boune uncertainties (i.e. norm-boune uncertainties), the neural networks can be presente by ẋ(t) = [C + C(t)]x(t) + [A + A(t)]f(x(t)) + J(t) with the parameter uncertainties C(t), A(t) which are normboune an satisfy [ C(t) A(t)] = DF(t)[E 1 E 2 ], where D, E 1, an E 2 are known constant real matrices an F(t) is an unknown matrix function with Lebesgue measurable elements an such that F T (t)f(t). For this case, we can only apply the common Lyapunov function to erive the reachable set of the networks. By setting P j = P, β ij = 0, (i, j = 1, 2,...,N), we can easily obtain the ellipsoial boun of a reachable set for neural network (1) by using the common Lyapunov function. Theorem 1 reuces to a simple form of set reachable criterion. Corollary 1 f there exists a matrix P > 0 with compatible imension, a non-negative iagonal matrix H, an a scalar α > 0 such that PC i Ci TP + αp PA i + LH P 2H 0 α < 0, (14) then for all the amissible polytopic uncertainties, the ellipsoi E(P, 1) = {x R n : x T Px 1}
4 No. 5 Communications in Theoretical Physics 907 is a set which bouns the reachable set of neural networks (1). Remark 3 As can be seen from Corollary 1, the conition obtaine by common Lyapunov function is a special case for that by maximal Lyapunov one. Therefore, we can expect that a tighter bouning set can be obtaine by using the maximal functional approach. However, the better result is achieve at the cost of a bigger computational complexity. Therefore, there is a traeoff between better performance an less computational buren for solving such a problem. n orer to fin the smallest boun for the reachable set of neural network (1), one may propose a simple optimization problem. That is, maximize δ subject to δ P j which can be transforme to the following optimization problem: minimize δ ( δ = 1/δ), [ ] δ (a) 0, s.t. P j (15) (b) (8) or (14). 4 llustrative Examples n this section, two numerical examples are provie to show the effectiveness of the metho evelope in this paper. Example 1 Consier the neural networks (1) with parameters [ ] C =, ρ [ ] A =, L = iag{3, 4}, ρ where ρ is a scalar parameter satisfying ρ 0.3 an = 2. Note that the uncertainty polytope in this case possesses N = 2 vertices with [ ] [ ] C 1 =, C 2 =, [ A 1 = ], A 2 = [ ] By solving the optimization problems (15), the resulting δ s for ifferent values of α are liste in Table 1. t is verifie that the maximal Lyapunov functional metho yiels much tighter bouns than the common Lyapunov approach. We cannot fin any feasible solution when α is larger than by using the common Lyapunov metho. The reachable set correspons to the system is epicte in Fig. 1. As we can see from the figure, the shae area compute by Theorem 1 is much tighter than the ellipsoi obtaine by the common Lyapunov metho. Table 1 The resulting δ for ifferent α of Example 1. α Corollary Theorem function. However, we can get the result of δ = by Theorem 1. Therefore, for this example, the maximal Lyapunov functional leas to a wier application range comparing with the common Lyapunov one. Fig. 1 The bouning reachable sets compute by ifferent methos for α = 0.3. Example 2 Consier the polytopic uncertain neural networks (1) with parameters: [ ] A =, ρ [ ] C =, L = iag{3, 4}, ρ where ρ 0.3, = 2. t is verifie that there is no feasible solution using the metho of common Lyapunov 5 Conclusion The reachable set bouning for neural networks in the presence of polytopic uncertainties is consiere in this paper. By utilizing the maximal Lyapunov functional approach, we have erive a sufficient conition which results in a non-ellipsoial set to boun all the states of the neural networks starting from the origin by inputs with peak values. Since there exist some nonifferentiable points, the sub-graient an sub-ifferential concepts have been introuce to characterize the behavior at non-ifferentiable points. Our results have emonstrate much flexibility an less conservatism compare with the common Lyapunov function. The simulation illustrates the valiness an merit of the propose metho. The future work in this eneavor will focus on the following issues. First, reachable set estimation for uncertain neural networks with time elay. Time elay is not
5 908 Communications in Theoretical Physics Vol. 57 involve in this paper, however, it inevitably occurs in the practical application. Secon, some more complcate neural network moels can be consiere, for instance, networks of hogkin-huxley neurons, [28] scale-free Hopfiel neural network. [29] References [1] J. Cao an J. Wang, EEE Trans. Circuits Syst. 52 (2005) 417. [2] L.O. Chua an L. Yang, EEE Trans. Circuits an Syst. 35 (1988) [3] Z. Wang, Y. Liu, M. Li, an X. Liu, EEE Trans. Neural Netw. 17 (2006) 814. [4] J. Cao an J. Wang, EEE Trans. Circuits Syst. 52 (2005) 920. [5] T. Ensari an S. Arik, EEE Trans. Autom. Control 50 (2005) [6] Y. He, M. Wu, an J. She, EEE Trans. Circuits Syst. 53 (2006) 553. [7] H. Shao, EEE Trans. Neural Netw. 19 (2008) [8] S. Xu, J. Lam, D.W.C. Ho, an Y. Zou, EEE Trans. Syst. Man, Cybern. B Cybern. 35 (2005) [9] Z. Zeng, J. Wang, an X. Liao, EEE Trans. Circuits Syst. 50 (2003) [10] Z. Zuo, C. Yang, an Y. Wang, EEE Trans. Neural Netw. 21 (2010) 339. [11] E. Sontag an H. Sussmann, Syst. Contr. Lett. 30 (1997) 177. [12] E. Sontag an Y. Qian, Syst. Contr. Lett. 36 (1999) 121. [13] Y. He, Q.G. Wang, M. Wu, an C. Lin, EEE Trans. Neural Netw. 17 (2006) [14] Z. Wang, D.W.C. Ho, an X. Liu, EEE Trans. Neural Netw. 16 (2005) 279. [15] Z. Wang, Y. Liu, an X. Liu, Neural Networks 22 (2009) 41. [16] E.N. Sanchez an J.P. Perez, EEE Trans. Circuits Syst. 46 (1999) [17] E.N. Sanchez, J.P. Perez, EEE Trans. Syst., Man, Cybern. A, Syst., Humans 33 (2003) 532. [18] H. Li, H. Gao, an P. Shi, EEE Trans. Neural Netw. 21 (2010) [19] S. Xu, W. Zheng, an Y. Zou, EEE Trans. Circuits Syst. 56 (2009) 325. [20] C. Li an X. Liao, EEE Trans. Circuits Syst. 53 (2006) [21] N. Ozcan an S. Arik, EEE Trans. Circuits Syst. 53 (2006) 166. [22] Z. Zuo an Y. Wang, ET Control Theory Appl. 1 (2007) 387. [23] J. Abegor, K. Nagpal, an K. Poolla, nt. J. Robust an Nonlin. 6 (1996) 899. [24] C. Durieu, E. Walter, an B. Polyak, J. Optimiz. Theory Appl. 111 (2001) 273. [25] A. Kurzhanskiy an P. Varaiya, EEE Trans. Autom. Control 52 (2007) 26. [26] S. Boy, Lecture Notes for Convex Optimization, [27] S. Boy, L. El Ghaoui, E. Feron, an V. Balakrishnan, Linear Matrix nequalities in System an Control Theory, SAM Stuies in Appl. Mathematics, Philaelphia (1994). [28] J. Ma, L. Yang, Y. Wu, an C. Zhang, Commun. Theor. Phys. 54 (2010) 583. [29] W. Chang, Commun. Theor. Phys. 53 (2010) 195.
Exponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity
Preprints of the 9th Worl Congress The International Feeration of Automatic Control Cape Town, South Africa. August -9, Exponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity Zhengqiang
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationAdaptive Gain-Scheduled H Control of Linear Parameter-Varying Systems with Time-Delayed Elements
Aaptive Gain-Scheule H Control of Linear Parameter-Varying Systems with ime-delaye Elements Yoshihiko Miyasato he Institute of Statistical Mathematics 4-6-7 Minami-Azabu, Minato-ku, okyo 6-8569, Japan
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationGeneralized-Type Synchronization of Hyperchaotic Oscillators Using a Vector Signal
Commun. Theor. Phys. (Beijing, China) 44 (25) pp. 72 78 c International Acaemic Publishers Vol. 44, No. 1, July 15, 25 Generalize-Type Synchronization of Hyperchaotic Oscillators Using a Vector Signal
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationResults on stability of linear systems with time varying delay
IET Control Theory & Applications Brief Paper Results on stability of linear systems with time varying delay ISSN 75-8644 Received on 8th June 206 Revised st September 206 Accepted on 20th September 206
More informationConnections Between Duality in Control Theory and
Connections Between Duality in Control heory an Convex Optimization V. Balakrishnan 1 an L. Vanenberghe 2 Abstract Several important problems in control theory can be reformulate as convex optimization
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationCriteria for Global Stability of Coupled Systems with Application to Robust Output Feedback Design for Active Surge Control
Criteria for Global Stability of Couple Systems with Application to Robust Output Feeback Design for Active Surge Control Shiriaev, Anton; Johansson, Rolf; Robertsson, Aners; Freiovich, Leoni 9 Link to
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationGLOBAL SOLUTIONS FOR 2D COUPLED BURGERS-COMPLEX-GINZBURG-LANDAU EQUATIONS
Electronic Journal of Differential Equations, Vol. 015 015), No. 99, pp. 1 14. ISSN: 107-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu ftp eje.math.txstate.eu GLOBAL SOLUTIONS FOR D COUPLED
More informationChaos, Solitons and Fractals
Chaos, Solitons an Fractals xxx (00) xxx xxx Contents lists available at ScienceDirect Chaos, Solitons an Fractals journal homepage: www.elsevier.com/locate/chaos Impulsive stability of chaotic systems
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationSlide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13)
Slie10 Haykin Chapter 14: Neuroynamics (3r E. Chapter 13) CPSC 636-600 Instructor: Yoonsuck Choe Spring 2012 Neural Networks with Temporal Behavior Inclusion of feeback gives temporal characteristics to
More informationA global Implicit Function Theorem without initial point and its applications to control of non-affine systems of high dimensions
J. Math. Anal. Appl. 313 (2006) 251 261 www.elsevier.com/locate/jmaa A global Implicit Function Theorem without initial point an its applications to control of non-affine systems of high imensions Weinian
More informationMulti-agent Systems Reaching Optimal Consensus with Time-varying Communication Graphs
Preprints of the 8th IFAC Worl Congress Multi-agent Systems Reaching Optimal Consensus with Time-varying Communication Graphs Guoong Shi ACCESS Linnaeus Centre, School of Electrical Engineering, Royal
More informationStability region estimation for systems with unmodeled dynamics
Stability region estimation for systems with unmoele ynamics Ufuk Topcu, Anrew Packar, Peter Seiler, an Gary Balas Abstract We propose a metho to compute invariant subsets of the robust region-of-attraction
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationAn LMI Approach to Guaranteed Cost Control for Uncertain Delay Systems
IEEE RASACIOS O CIRCUIS AD SYSEMS I: FUDAMEAL HEORY AD APPLICAIOS, VOL 5, O 6, JUE 23 795 An LMI Approach to Guarantee Cost Control for Uncertain Delay Systems Hiroaki Mukaiani he notations use in this
More informationNecessary and sufficient conditions for analysis and synthesis of markov jump linear systems with incomplete transition descriptions
Title Necessary an sufficient conitions for analysis an synthesis of markov jump linear systems with incomplete transition escriptions Author(s) Zhang, L; Lam, J Citation Ieee Transactions On Automatic
More informationINVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN INTEGRAL OVERDETERMINATION CONDITION
Electronic Journal of Differential Equations, Vol. 216 (216), No. 138, pp. 1 7. ISSN: 172-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu INVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN
More informationSYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is
SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. Uniqueness for solutions of ifferential equations. We consier the system of ifferential equations given by x = v( x), () t with a given initial conition
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More information. ISSN (print), (online) International Journal of Nonlinear Science Vol.6(2008) No.3,pp
. ISSN 1749-3889 (print), 1749-3897 (online) International Journal of Nonlinear Science Vol.6(8) No.3,pp.195-1 A Bouneness Criterion for Fourth Orer Nonlinear Orinary Differential Equations with Delay
More informationStabilization of Interconnected Systems with Decentralized State and/or Output Feedback
Stabilization of Interconnecte Systems with Decentralize State an/or Output Feeback Parisses Constantinos Department of Electrical Engineering, Technology Eucational Institute of Western Maceonia, Greece,
More informationNonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain
Nonlinear Aaptive Ship Course Tracking Control Base on Backstepping an Nussbaum Gain Jialu Du, Chen Guo Abstract A nonlinear aaptive controller combining aaptive Backstepping algorithm with Nussbaum gain
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationAll s Well That Ends Well: Supplementary Proofs
All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee
More informationA DELAY-DEPENDENT APPROACH TO DESIGN STATE ESTIMATOR FOR DISCRETE STOCHASTIC RECURRENT NEURAL NETWORK WITH INTERVAL TIME-VARYING DELAYS
ICIC Express Letters ICIC International c 2009 ISSN 1881-80X Volume, Number (A), September 2009 pp. 5 70 A DELAY-DEPENDENT APPROACH TO DESIGN STATE ESTIMATOR FOR DISCRETE STOCHASTIC RECURRENT NEURAL NETWORK
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationA nonlinear inverse problem of the Korteweg-de Vries equation
Bull. Math. Sci. https://oi.org/0.007/s3373-08-025- A nonlinear inverse problem of the Korteweg-e Vries equation Shengqi Lu Miaochao Chen 2 Qilin Liu 3 Receive: 0 March 207 / Revise: 30 April 208 / Accepte:
More informationMinimum-time constrained velocity planning
7th Meiterranean Conference on Control & Automation Makeonia Palace, Thessaloniki, Greece June 4-6, 9 Minimum-time constraine velocity planning Gabriele Lini, Luca Consolini, Aurelio Piazzi Università
More informationθ x = f ( x,t) could be written as
9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationApproximate reduction of dynamic systems
Systems & Control Letters 57 2008 538 545 www.elsevier.com/locate/sysconle Approximate reuction of ynamic systems Paulo Tabuaa a,, Aaron D. Ames b, Agung Julius c, George J. Pappas c a Department of Electrical
More informationTRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS
TRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS Francesco Bullo Richar M. Murray Control an Dynamical Systems California Institute of Technology Pasaena, CA 91125 Fax : + 1-818-796-8914 email
More informationRemote Preparation of Multipartite Equatorial Entangled States in High Dimensions with Three Parties
Commun. Theor. Phys. (Beiing, China) 51 (2009) pp. 641 647 c Chinese Physical Society an IOP Publishing Lt Vol. 51, No. 4, April 15, 2009 Remote Preparation of Multipartite Equatorial Entangle States in
More informationDissipative numerical methods for the Hunter-Saxton equation
Dissipative numerical methos for the Hunter-Saton equation Yan Xu an Chi-Wang Shu Abstract In this paper, we present further evelopment of the local iscontinuous Galerkin (LDG) metho esigne in [] an a
More informationLecture 10: October 30, 2017
Information an Coing Theory Autumn 2017 Lecturer: Mahur Tulsiani Lecture 10: October 30, 2017 1 I-Projections an applications In this lecture, we will talk more about fining the istribution in a set Π
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
More informationBEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi
BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationDelay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays
Delay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays Yong He, Min Wu, Jin-Hua She Abstract This paper deals with the problem of the delay-dependent stability of linear systems
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationOptimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations
Optimize Schwarz Methos with the Yin-Yang Gri for Shallow Water Equations Abessama Qaouri Recherche en prévision numérique, Atmospheric Science an Technology Directorate, Environment Canaa, Dorval, Québec,
More informationNetwork Synchronization With Nonlinear Dynamics and Switching Interactions
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 61, NO. 10, OCTOBER 2016 3103 Network Synchronization With Nonlinear Dynamics an Switching Interactions Tao Yang, Ziyang Meng, Guoong Shi, Yiguang Hong, an
More informationAPPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France
APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation
More informationOn the number of isolated eigenvalues of a pair of particles in a quantum wire
On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in
More informationDissipativity for dual linear differential inclusions through conjugate storage functions
43r IEEE Conference on Decision an Control December 4-7, 24 Atlantis, Paraise Islan, Bahamas WeC24 Dissipativity for ual linear ifferential inclusions through conjugate storage functions Rafal Goebel,
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationDelay-Dependent Exponential Stability of Linear Systems with Fast Time-Varying Delay
International Mathematical Forum, 4, 2009, no. 39, 1939-1947 Delay-Dependent Exponential Stability of Linear Systems with Fast Time-Varying Delay Le Van Hien Department of Mathematics Hanoi National University
More informationImproved delay-dependent globally asymptotic stability of delayed uncertain recurrent neural networks with Markovian jumping parameters
Improved delay-dependent globally asymptotic stability of delayed uncertain recurrent neural networks with Markovian jumping parameters Ji Yan( 籍艳 ) and Cui Bao-Tong( 崔宝同 ) School of Communication and
More informationJ. Electrical Systems 11-4 (2015): Regular paper
Chuansheng ang,*, Hongwei iu, Yuehong Dai Regular paper Robust Optimal Control of Chaos in Permanent Magnet Synchronous Motor with Unknown Parameters JES Journal of Electrical Systems his paper focuses
More informationOptimal Estimation for Continuous-Time Systems With Delayed Measurements
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 51, NO. 5, MAY 2006 823 satisfies Lipschitz conition. Base on the result on the existence an uniqueness of solution to CSSP, necessary an sufficient conitions
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationSeparation Principle for a Class of Nonlinear Feedback Systems Augmented with Observers
Proceeings of the 17th Worl Congress The International Feeration of Automatic Control Separation Principle for a Class of Nonlinear Feeback Systems Augmente with Observers A. Shiriaev, R. Johansson A.
More informationSINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
Communications on Stochastic Analysis Vol. 2, No. 2 (28) 289-36 Serials Publications www.serialspublications.com SINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationA new four-dimensional chaotic system
Chin. Phys. B Vol. 19 No. 12 2010) 120510 A new four-imensional chaotic system Chen Yong ) a)b) an Yang Yun-Qing ) a) a) Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai
More informationIndirect Adaptive Fuzzy and Impulsive Control of Nonlinear Systems
International Journal of Automation an Computing 7(4), November 200, 484-49 DOI: 0007/s633-00-053-7 Inirect Aaptive Fuzzy an Impulsive Control of Nonlinear Systems Hai-Bo Jiang School of Mathematics, Yancheng
More informationExistence of equilibria in articulated bearings in presence of cavity
J. Math. Anal. Appl. 335 2007) 841 859 www.elsevier.com/locate/jmaa Existence of equilibria in articulate bearings in presence of cavity G. Buscaglia a, I. Ciuperca b, I. Hafii c,m.jai c, a Centro Atómico
More informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
More informationDamage identification based on incomplete modal data and constrained nonlinear multivariable function
Journal of Physics: Conference Series PAPER OPEN ACCESS Damage ientification base on incomplete moal ata an constraine nonlinear multivariable function To cite this article: S S Kourehli 215 J. Phys.:
More informationWUCHEN LI AND STANLEY OSHER
CONSTRAINED DYNAMICAL OPTIMAL TRANSPORT AND ITS LAGRANGIAN FORMULATION WUCHEN LI AND STANLEY OSHER Abstract. We propose ynamical optimal transport (OT) problems constraine in a parameterize probability
More informationHyperbolic Moment Equations Using Quadrature-Based Projection Methods
Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationPolynomial Inclusion Functions
Polynomial Inclusion Functions E. e Weert, E. van Kampen, Q. P. Chu, an J. A. Muler Delft University of Technology, Faculty of Aerospace Engineering, Control an Simulation Division E.eWeert@TUDelft.nl
More informationContinuous observer design for nonlinear systems with sampled and delayed output measurements
Preprints of th9th Worl Congress The International Feeration of Automatic Control Continuous observer esign for nonlinear systems with sample an elaye output measurements Daoyuan Zhang Yanjun Shen Xiaohua
More informationStable and compact finite difference schemes
Center for Turbulence Research Annual Research Briefs 2006 2 Stable an compact finite ifference schemes By K. Mattsson, M. Svär AND M. Shoeybi. Motivation an objectives Compact secon erivatives have long
More informationarxiv: v2 [math.dg] 16 Dec 2014
A ONOTONICITY FORULA AND TYPE-II SINGULARITIES FOR THE EAN CURVATURE FLOW arxiv:1312.4775v2 [math.dg] 16 Dec 2014 YONGBING ZHANG Abstract. In this paper, we introuce a monotonicity formula for the mean
More informationEXACT TRAVELING WAVE SOLUTIONS FOR A NEW NON-LINEAR HEAT TRANSFER EQUATION
THERMAL SCIENCE, Year 017, Vol. 1, No. 4, pp. 1833-1838 1833 EXACT TRAVELING WAVE SOLUTIONS FOR A NEW NON-LINEAR HEAT TRANSFER EQUATION by Feng GAO a,b, Xiao-Jun YANG a,b,* c, an Yu-Feng ZHANG a School
More informationThe canonical controllers and regular interconnection
Systems & Control Letters ( www.elsevier.com/locate/sysconle The canonical controllers an regular interconnection A.A. Julius a,, J.C. Willems b, M.N. Belur c, H.L. Trentelman a Department of Applie Mathematics,
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationarxiv:physics/ v2 [physics.ed-ph] 23 Sep 2003
Mass reistribution in variable mass systems Célia A. e Sousa an Vítor H. Rorigues Departamento e Física a Universiae e Coimbra, P-3004-516 Coimbra, Portugal arxiv:physics/0211075v2 [physics.e-ph] 23 Sep
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationLecture 1b. Differential operators and orthogonal coordinates. Partial derivatives. Divergence and divergence theorem. Gradient. A y. + A y y dy. 1b.
b. Partial erivatives Lecture b Differential operators an orthogonal coorinates Recall from our calculus courses that the erivative of a function can be efine as f ()=lim 0 or using the central ifference
More informationECE 422 Power System Operations & Planning 7 Transient Stability
ECE 4 Power System Operations & Planning 7 Transient Stability Spring 5 Instructor: Kai Sun References Saaat s Chapter.5 ~. EPRI Tutorial s Chapter 7 Kunur s Chapter 3 Transient Stability The ability of
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationApproximate Reduction of Dynamical Systems
Proceeings of the 4th IEEE Conference on Decision & Control Manchester Gran Hyatt Hotel San Diego, CA, USA, December 3-, 6 FrIP.7 Approximate Reuction of Dynamical Systems Paulo Tabuaa, Aaron D. Ames,
More informationDelay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delays
International Journal of Automation and Computing 7(2), May 2010, 224-229 DOI: 10.1007/s11633-010-0224-2 Delay-dependent Stability Analysis for Markovian Jump Systems with Interval Time-varying-delays
More informationEquations of lines in
Roberto s Notes on Linear Algebra Chapter 6: Lines, planes an other straight objects Section 1 Equations of lines in What ou nee to know alrea: The ot prouct. The corresponence between equations an graphs.
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationHyperbolic Systems of Equations Posed on Erroneous Curved Domains
Hyperbolic Systems of Equations Pose on Erroneous Curve Domains Jan Norström a, Samira Nikkar b a Department of Mathematics, Computational Mathematics, Linköping University, SE-58 83 Linköping, Sween (
More informationSTABILITY ANALYSIS FOR SYSTEMS WITH LARGE DELAY PERIOD: A SWITCHING METHOD. Received March 2011; revised July 2011
International Journal of Innovative Computing, Information and Control ICIC International c 2012 ISSN 1349-4198 Volume 8, Number 6, June 2012 pp. 4235 4247 STABILITY ANALYSIS FOR SYSTEMS WITH LARGE DELAY
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More information2 GUANGYU LI AND FABIO A. MILNER The coefficient a will be assume to be positive, boune, boune away from zero, an inepenent of t; c will be assume con
A MIXED FINITE ELEMENT METHOD FOR A THIRD ORDER PARTIAL DIFFERENTIAL EQUATION G. Li 1 an F. A. Milner 2 A mixe finite element metho is escribe for a thir orer partial ifferential equation. The metho can
More informationResearch Article Delay-Dependent Exponential Stability for Discrete-Time BAM Neural Networks with Time-Varying Delays
Discrete Dynamics in Nature and Society Volume 2008, Article ID 421614, 14 pages doi:10.1155/2008/421614 Research Article Delay-Dependent Exponential Stability for Discrete-Time BAM Neural Networks with
More information