.png){kind=icon}
返回
Sampling zeros and the Euler-Frobenius polynomials
.png){kind=icon}
OA
AI
DOI：10.1109/9.905706.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this note, we show that the zeros of sampled-data systems resulting from rapid sampling of continuous-time systems preceded by a zero-order hold (ZOH) are the roots of the Euler-Frobenius polynomials. Using known properties of these polynomials, we prove two conjectures of Hagiwara and coworkers, the first of which concerns the simplicity, negative realness, and interlacing properties of the sampling zeros of ZOH- and first-order hold (FOH-) sampled systems. To prove the second conjecture, we show that in the fast sampling limit, and as the continuous-time relative degree increases, the largest sampling zero for FOH-sampled systems approaches 1/e, where e is the base of the natural logarithm.
Keyword:
fast sampling
first-order hold
limiting zeros
sampling zeros
zero-order hold
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
引用论文
Validating Cell Surface Proteases as Drug Targets for Cancer Therapy: What Do We Know, and Where Do We Go?.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏 没有更多内容
没有更多内容