scholarly journals Stability of Matrix Polytopes with a Dominant Vertex and Implications for System Dynamics

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Octavian Pastravanu ◽  
Mihaela-Hanako Matcovschi

The paper considers the class of matrix polytopes with a dominant vertex and the class of uncertain dynamical systems defined in discrete time and continuous time, respectively, by such polytopes. We analyze the standard concept of stability in the sense of Schur—abbreviated as SS (resp., Hurwitz—abbreviated as HS), and we develop a general framework for the investigation of the diagonal stability relative to an arbitrary Hölderp-norm,1≤p≤∞, abbreviated asSDSp(resp.,HDSp). Our framework incorporates, as the particular case withp=2, the known condition of quadratic stability satisfied by a diagonal positive-definite matrix, i.e.SDS2(resp.,HDS2) means that the standard inequality of Stein (resp., Lyapunov) associated with all matrices of the polytope has a common diagonal solution. For the considered class of matrix polytopes, we prove the equivalence between SS andSDSp(resp., HS andHDSp),1≤p≤∞(fact which is not true for matrix polytopes with arbitrary structures). We show that the dominant vertex provides all the information needed for testing these stability properties and for computing the corresponding robustness indices. From the dynamical point of view, if an uncertain system is defined by a polytope with a dominant vertex, then the standard asymptotic stability ensures supplementary properties for the state-space trajectories, which refer to special types of Lyapunov functions and contractive invariant sets (characterized through vectorp-norms weighted by diagonal positive-definite matrices). The applicability of the main results is illustrated by two numerical examples that cover both discrete- and continuous-time cases for the class of uncertain dynamics studied in our paper.

CAUCHY ◽  
2010 ◽  
Vol 1 (2) ◽  
pp. 85 ◽  
Author(s):  
Rahmat Sagara

In this article, ellipse and circle will be learnt in depth via matrix algebra approach. The discussion of the both is started from their classic definition continued by surveying ellipse in matrix form. During the survey, some properties about ellipse will be explained and also, the procedure in drawing the figures can be obtained geometrically using some aspect in geometry: rotation and translation. At the end of the discussion, the new definition of the figures is deduced. Both of them are defined as” a set of points in a plane that are the same distance from a fixed point” but in different point of view about the ‘distance’. The ‘distance’ in the definition is derived from different norm definition. The difference lies on the positive definite matrix used in the norm definition. Base on the new definition, we’ll have the conclusion that circle is a special type of ellipse.


2019 ◽  
Vol 21 (07) ◽  
pp. 1850057 ◽  
Author(s):  
Francesca Anceschi ◽  
Michela Eleuteri ◽  
Sergio Polidoro

We consider weak solutions of second-order partial differential equations of Kolmogorov–Fokker–Planck-type with measurable coefficients in the form [Formula: see text] where [Formula: see text] is a symmetric uniformly positive definite matrix with bounded measurable coefficients; [Formula: see text] and the components of the vector [Formula: see text] are bounded and measurable functions. We give a geometric statement of the Harnack inequality recently proved by Golse et al. As a corollary, we obtain a strong maximum principle.


Author(s):  
Valentin A. Bereznev

AbstractAn approach based on projection of a vector onto a pointed convex polyhedral cone is proposed for solving the quadratic programming problem with a positive definite matrix of the quadratic form. It is proved that this method has polynomial complexity. A method is said to be of polynomial computational complexity if the solution to the problem can be obtained in N


Sign in / Sign up

Export Citation Format

Share Document