QQ客服 官方微博 反馈留言

	A new geometric algorithm with order reduction for robust strictly positive real synthesis
	Xie, Liangjun ; Wang, Long ; Yu, Wensheng
	2002
DOI	10.1109/CDC.2002.1184792
英文摘要	A new geometric algorithm with order reduction for robust Strictly Positive Real (SPR) synthesis is presented. By searching from the boundary of the region of the weak strict positive realness (WSPR) of a polynomial, we can find the intersection of the WSPR regions of the polynomial family. Then the synthesis problem can be transformed to finding a feasible solution in ellipses with two variables, thus the problem becomes simpler and easy to solve, and the computational burden has been significantly reduced. Moreover, the derived conditions are necessary and sufficient for robust SPR synthesis of low-order polynomial segments (n&le15) or interval polynomials (n&le4). The algorithm is computationally efficient for some types of polynomial sets, such as segments, intervals and polytopes with arbitrary order. Illustrative examples are provided.; EI; 0
语种	英语
内容类型	会议论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/330319]
专题	工学院
推荐引用方式 GB/T 7714	Xie, Liangjun,Wang, Long,Yu, Wensheng. A new geometric algorithm with order reduction for robust strictly positive real synthesis[C]. 见:.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。