Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When al...Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.展开更多
The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach...The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach is proposed for the design of filters that ensure a prescribed H∞performance level for al ad-missible uncertain parameters, which is different from the quadratic framework that entails fixed matrices for the entire uncertainty do-main. This idea is realized by careful y selecting the structure of the matrices involved in the products with system matrices. An extended H∞ sufficient condition for the existence of robust esti-mators is formulated in terms of linear matrix inequalities, which can be solved via efficient interior-point algorithms.展开更多
基金Supported by the National Natural Science Foundation of China(12001327,12071057)。
文摘Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.
基金supported by the Innovative Team Program of the National Natural Science Foundation of China(61021002)the Specialized Research Fund for the Doctoral Program of Higher Education(20122302120069)+3 种基金the Basic Research Plan in Shenzhen City(JC201105160564AJCYJ20120613135212389)the Fundamental Research Funds for the Central Universities(HIT.NSRIF.2009137)the Key Lab of Wind Power and Smart Grid in Shenzhen City(CXB201005250025A)
文摘The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach is proposed for the design of filters that ensure a prescribed H∞performance level for al ad-missible uncertain parameters, which is different from the quadratic framework that entails fixed matrices for the entire uncertainty do-main. This idea is realized by careful y selecting the structure of the matrices involved in the products with system matrices. An extended H∞ sufficient condition for the existence of robust esti-mators is formulated in terms of linear matrix inequalities, which can be solved via efficient interior-point algorithms.
