Two-variable polynomials: intersecting zeros and stability
Authors:
- H.J. WoerdemanHWH.J. Woerdeman
- 8 May 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 53 (5) , 1130-1139
Abstract
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
This publication has 6 references indexed in Scilit:
- Positive extensions, Fejér–Riesz factorization and autoregressive filters in two variablesAnnals of Mathematics, 2004
- Spectral Factorizations and Sums of Squares Representations via Semidefinite ProgrammingSIAM Journal on Matrix Analysis and Applications, 2002
- Cayley-Bacharach theorems and conjecturesBulletin of the American Mathematical Society, 1996
- An Introduction to Operator Polynomials1989
- Inverses of Toeplitz Operators, Innovations, and Orthogonal PolynomialsSIAM Review, 1978
- Ueber die Darstellung definiter Formen als Summe von FormenquadratenMathematische Annalen, 1888