Abstract
Designing and implementing a procedure for computing the polynomial resultant provides an avenue for analyzing both the computational complexity and performance of such construction. In this paper a new Maple procedure called Sturmfelmethod for computing the Sturmfel-Salmon resultant method is proposed based on existing methods and assumptions. Examples are provided to demonstrate the mechanization of the resulting new algorithm and its computing time. The new procedure can be used to determine whether three polynomials intersect or not and to solve a given system of polynomial equations.
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 callMore From: Malaysian Journal of Fundamental and Applied Sciences
Disclaimer: 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.
