Linear matrix inequality approach to exponential synchronization of a class of chaotic neural networks with time-varying delays

In this paper, a synchronization scheme for a class of chaotic neural networks with time-varying delays is presented. This class of chaotic neural networks covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks, and bidirectional associative memory networks. The obtained criteria are expressed in terms of linear matrix inequalities, thus they can be efficiently verified. A comparison between our results and the previous results shows that our results are less restrictive.

On stabilization for a class of nonlinear stochastic time-delay systems:a matrix inequality approach

This paper treats the feedback stabilization of nonlinear stochastic time-delay systems with state and control-dependent noise. Some locally （globally） robustly stabilizable conditions are given in terms of matrix inequalities that are independent of the delay size. When it is applied to linear stochastic time-delay systems, sufficient conditions for the state-feedback stabilization are presented via linear matrix inequalities. Several previous results are extended to more general systems with both state and control-dependent noise, and easy computation algorithms are also given.

Linear matrix inequality approach for synchronization control of fuzzy cellular neural networks with mixed time delays

Fuzzy cellular neural networks （FCNNs） are special kinds of cellular neural networks （CNNs）. Each cell in an FCNN contains fuzzy operating abilities. The entire network is governed by cellular computing laws. The design of FCNNs is based on fuzzy local rules. In this paper, a linear matrix inequality （LMI） approach for synchronization control of FCNNs with mixed delays is investigated. Mixed delays include discrete time-varying delays and unbounded distributed delays. A dynamic control scheme is proposed to achieve the synchronization between a drive network and a response network. By constructing the Lyapunov-Krasovskii functional which contains a triple-integral term and the free-weighting matrices method an improved delay-dependent stability criterion is derived in terms of LMIs. The controller can be easily obtained by solving the derived LMIs. A numerical example and its simulations are presented to illustrate the effectiveness of the proposed method.

Linear matrix inequality approach for robust stability analysis for stochastic neural networks with time-varying delay

This paper studies the problem of linear matrix inequality （LMI） approach to robust stability analysis for stochastic neural networks with a time-varying delay. By developing a delay decomposition approach, the information of the delayed plant states can be taken into full consideration. Based on the new Lyapunov-Krasovskii functional, some inequality techniques and stochastic stability theory, new delay-dependent stability criteria are obtained in terms of LMIs. The proposed results prove the less conservatism, which are realized by choosing new Lyapunov matrices in the decomposed integral intervals. Finally, numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed LMI method.

Generalizations of a Matrix Inequality

In this paper, some new generalizations of the matrix form of the Brunn-Minkowski inequality are presented.

The Generalization of a Converse of Matrix Inequality

We prove that the inequality holds, when a m × n real matrix X = (xij) whose entries are not all equal to 0 satisfies Therefore we not only generalize the results of Horst Alzer [2] from non-negative matrix to real matrix, but also complete a result of E R van Dam [1], which indicated that the best possible upper bound is equal to 1 for real matrix.

A Matrix Inequality for the Inversions of the Restrictions of a Positive Definite Hermitian Matrix

We exploit the theory of reproducing kernels to deduce a matrix inequality for the inverse of the restriction of a positive definite Hermitian matrix.

Global stabilization of linear periodically time-varying switched systems via matrix inequalities

In this paper, we address the stabilization problem for linear periodically time-varying switched systems. Using discretization technique, we derive new conditions for the global stabilizability in terms of the solution of matrix inequalities. An algorithm for finding stabilizing controller and switching strategy is presented.

On absolute stability of Lur'e control systems with multiple non-linearities using linear matrix inequalities

Necessary and suffcient conditions for the existence of a Lyapunov function in the Lur ’ e form to guarantee the absolute stability of Lur’ e control systems with multiple non-linearities are discussed in this paper. It simplifies the existence problem to one of solving a set of linear matrix inequalities (LMIs). If those LMIs are feasible, free parameters in the Lyapunov function, such as the positive definite matrix and the coefficients of the integral terms, are given by the solution of the LMIs. Otherwise, this Lyapunov function does not exist. Some sufficient conditions are also obtained for the robust absolute stability of uncertain systems. A numerical example is provided to demonstrate the effectiveness of the proposed method.

Several Generalized Matrix Versions of Kantorovich Inequalities

Kantorovich inequalities are old results. In this paper we give several Kantorovich-type matrix inequalities.

THE OPPENHEIM-TYPE INEQUALITIES FORTHE HADAMARD PRODUCT OF M-MATRIXAND POSITIVE DEFINITE MATRIX

For the lower bound about the determinant of Hadamard product of A and B, where A is a n × n real positive definite matrix and B is a n × n M-matrix, Jianzhou Liu [SLAM J. Matrix Anal. Appl., 18(2)(1997): 305-311]obtained the estimated inequality as follows det(A o B)≥a11b11 nⅡk=2(bkk detAk/detAk-1+detBk/detBk-1(k-1Ei=1 aikaki/aii))=Ln(A,B),where Ak is kth order sequential principal sub-matrix of A. We establish an improved lower bound of the form Yn(A,B)=a11baa nⅡk=2(bkk detAk/detAk-1+akk detBk/detBk-1-detAdetBk/detak-1detBk-1)≥Ln(A,B).For more weaker and practical lower bound, Liu given thatdet(A o B)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB(nⅡk=2 k-1Ei=1 aikaki/aiiakk)=(L)n(A,B).We further improve it as Yn(A,B)=(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)+max1≤k≤n wn(A,B,k)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)≥(L)n(A,B).

Some new bound estimates of the Hermitian positive definite solutions of the nonlinear matrix equation X^s+ A~*X^(-t) A = Q

The range and existence conditions of the Hermitian positive definite solutions of nonlinear matrix equations Xs+A*X-tA=Q are studied, where A is an n×n non-singular complex matrix and Q is an n×n Hermitian positive definite matrix and parameters s,t>0. Based on the matrix geometry theory, relevant matrix inequality and linear algebra technology, according to the different value ranges of the parameters s,t, the existence intervals of the Hermitian positive definite solution and the necessary conditions for equation solvability are presented, respectively. Comparing the existing correlation results, the proposed upper and lower bounds of the Hermitian positive definite solution are more accurate and applicable.

Robust D-stability LMI conditions of matrix polytopes via affine parameter-dependent Lyapunov functions

The problem of the robust D-stability analysis for linear systems with parametric uncertainties is addressed. For matrix polytopes, new conditions via the affine parameter-dependent Lyapunov function of uncertain systems are developed with the benefit of the scalar multi-convex function. To be convenient for applications, such conditions are simplified into new linear matrix inequality （LMI） conditions, which can be solved by the powerful LMI toolbox. Numerical examples are provided to indicate that this new approach is less conservative than previous results for Hurwitz stability, Schur stability and D-stability of uncertain systems under certain circumstances.

Novel stability criteria for fuzzy Hopfield neural networks based on an improved homogeneous matrix polynomials technique

The global stability problem of Takagi-Sugeno（T-S） fuzzy Hopfield neural networks（FHNNs） with time delays is investigated.Novel LMI-based stability criteria are obtained by using Lyapunov functional theory to guarantee the asymptotic stability of the FHNNs with less conservatism.Firstly,using both Finsler＇s lemma and an improved homogeneous matrix polynomial technique,and applying an affine parameter-dependent Lyapunov-Krasovskii functional,we obtain the convergent LMI-based stability criteria.Algebraic properties of the fuzzy membership functions in the unit simplex are considered in the process of stability analysis via the homogeneous matrix polynomials technique.Secondly,to further reduce the conservatism,a new right-hand-side slack variables introducing technique is also proposed in terms of LMIs,which is suitable to the homogeneous matrix polynomials setting.Finally,two illustrative examples are given to show the efficiency of the proposed approaches.

Optimal Bounds for the Largest Eigenvalue of a 3 ×3 Correlation Matrix

A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more stringent than the optimal bounds by Wolkowicz and Styan in specific cases.

Free-matrix-based time-dependent discontinuous Lyapunov functional for synchronization of delayed neural networks with sampled-data control

This paper is concerned with the synchronization of delayed neural networks via sampled-data control. A new technique, namely, the free-matrix-based time-dependent discontinuous Lyapunov functional approach, is adopted in constructing the Lyapunov functional, which takes advantage of the sampling characteristic of sawtooth input delay. Based on this discontinuous Lyapunov functional, some less conservative synchronization criteria are established to ensure that the slave system is synchronous with the master system. The desired sampled-data controller can be obtained through the use of the linear matrix inequality（LMI） technique. Finally, two numerical examples are provided to demonstrate the effectiveness and the improvements of the proposed methods.

On the Inequalities for Traces and Singular Values of the Quaternion Matrices

In this paper we derive some inequalities for traces and singular values of the quaternion matrices,extend and improve some of the corresponding results appeared in other papers we know.

Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form

The known Fourier-Chernikov algorithm of linear inequality system convolution is complemented with an original procedure of all dependent (redundant) inequalities deletion. The concept of “almost dependent” inequalities is defined and an algorithm for further reducing the system by deletion of these is considered. The concluding algorithm makes it possible to hold actual-time convolution of a general inequality system containing up to 50 variables with the rigorous method of dependent inequalities deletion and up to 100 variables with the approximate method of one. The main application of such an approach consists in solving linear inequality system in an explicit form. These results are illustrated with a series of computer experiments.

Numerical Radius Inequalities for Sums and Products of Operators

A numerical radius inequality due to Shebrawi and Albadawi says that: If Ai, Bi, Xi are bounded operators in Hilbert space, i = 1,2,..., n , and f,g be nonnegative continuous functions on [0, ∞) satisfying the relation f(t)g(t) = t (t∈[0, ∞)), then for all r≥1. We give sharper numerical radius inequality which states that: If Ai, Bi, Xi are bounded operators in Hilbert space, i = 1,2,..., n , and f,g be nonnegative continuous functions on [0, ∞) satisfying the relation f(t)g(t) = t (t∈[0, ∞)), then ?where . Moreover, we give many numerical radius inequalities which are sharper than related inequalities proved recently, and several applications are given.

Hermite Positive Definite Solution of the Quaternion Matrix Equation Xm + B*XB = C

This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation Xm+ B*XB = C (m > 0) and its iterative solution method. According to the characteristics of the coefficient matrix, a corresponding algebraic equation system is ingeniously constructed, and by discussing the equation system’s solvability, the matrix equation’s existence interval is obtained. Based on the characteristics of the coefficient matrix, some necessary and sufficient conditions for the existence of Hermitian positive definite solutions of the matrix equation are derived. Then, the upper and lower bounds of the positive actual solutions are estimated by using matrix inequalities. Four iteration formats are constructed according to the given conditions and existence intervals, and their convergence is proven. The selection method for the initial matrix is also provided. Finally, using the complexification operator of quaternion matrices, an equivalent iteration on the complex field is established to solve the equation in the Matlab environment. Two numerical examples are used to test the effectiveness and feasibility of the given method. .