Abstract
In the last two decades, the homotopy continuation method has been developed into a reliable and ecient numerical algorithm for solving all isolated zeros of polynomial systems. During the last few years, a major computational breakthrough has emerged in the area. Based on the Bernshtein theory on root count, the polyhedral homotopy is established to considerably reduce the number of homotopy paths that need to be traced to nd all the isolated roots, making the method much more powerful. This article reports the most recent development of this new method along with future considerations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
