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: | Sulaiman, Surajo, Aris, Noraini, Ahmad, Shamsatun Nahar |
---|---|
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!
|
Similar Items
-
Sylvester-type matrices for sparse resultants
by: Nahar Ahmad, Shamsatun, et al.
Published: (2010) -
The mechanization of multires algorithm and computation of mixed volume using mixed subdivision for sparse resultants
by: Aris, Nor'aini, et al.
Published: (2011) -
New methods of computing the projective polynomial resultant based on dixon, jouanolou and jacobian matrices
by: Sulaiman, Surajo
Published: (2018) -
The implementation of hybrid resultant matrix formulation
by: Ahmad, Shamsatun Nahar, et al.
Published: (2015) -
Hybrid resultant matrix algorithm based on the sylvester-bezout formulation
by: Ahmad, Shamsatun Nahar
Published: (2016)