Mechanization of the Sturmfel-Salmon resultant method
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 propo...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/81270/ http://dx.doi.org/10.11113/mjfas.v13n3.627 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|