.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
intersecting zeros
Cayley-Bacharach
Fejer-Riesz factorization
Schur-Cohn
stability
spectral factorization
resultant valued matrix polynomials
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.2
Papers:
9.7K
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave no more
no more