Sylvester-type matrices for sparse resultants
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. Therefore for sparse inputs, the matrix is lower in dimension. The aim of the study is to infer conditions on the class of polynomial systems that can give a resultant matrix whose size is minimized, t...
Saved in:
Main Authors: | Nahar Ahmad, Shamsatun, Aris, Nor’aini |
---|---|
Format: | Article |
Published: |
ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
2010
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/25998/ https://mjfas.utm.my/index.php/mjfas/issue/view/18 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The mechanization of multires algorithm and computation of mixed volume using mixed subdivision for sparse resultants
by: Aris, Nor'aini, et al.
Published: (2011) -
Hybrid resultant matrix algorithm based on the sylvester-bezout formulation
by: Ahmad, Shamsatun Nahar
Published: (2016) -
Mechanization of the Sturmfel-Salmon resultant method
by: Sulaiman, Surajo, et al.
Published: (2017) -
The implementation of hybrid resultant matrix formulation
by: Ahmad, Shamsatun Nahar, et al.
Published: (2015) -
Computing Sylvester resultant matrix in hermite polynomials
by: AlSolami, Somiah Merezeeq A
Published: (2019)