.png){kind=icon}
返回
Two-variable polynomials: Intersecting zeros and stability
.png){kind=icon}
OA
AI
DOI：10.1109/TCSI.2005.862180.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In order to construct two-variable polynomials with a certain zero behavior, the notion of intersecting zeros is studied. We show that generically two-variable polynomials have a finite set of intersecting zeros, and give an algorithm on how to construct a polynomial with the desired intersecting zeros. Relations with the Cayley-Bacharach theorem are addressed. In addition, we will also address the case when stable polynomials are sought.
Keyword:
intersecting zeros
Cayley-Bacharach
Fejer-Riesz factorization
Schur-Cohn
stability
spectral factorization
resultant valued matrix polynomials
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.7K
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容