Cart (Loading....) | Create Account
Close category search window
 

Two-variable polynomials: intersecting zeros and stability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Geronimo, J.S. ; Sch. of Math., Georgia Inst. of Technol., Atlanta, GA, USA ; Woerdeman, H.J.

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.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:53 ,  Issue: 5 )

Date of Publication:

May 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.