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...
保存先:
主要な著者: | Nahar Ahmad, Shamsatun, Aris, Nor’aini |
---|---|
フォーマット: | 論文 |
出版事項: |
ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
2010
|
主題: | |
オンライン・アクセス: | http://eprints.utm.my/id/eprint/25998/ https://mjfas.utm.my/index.php/mjfas/issue/view/18 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
The mechanization of multires algorithm and computation of mixed volume using mixed subdivision for sparse resultants
著者:: Aris, Nor'aini, 等
出版事項: (2011) -
Hybrid resultant matrix algorithm based on the sylvester-bezout formulation
著者:: Ahmad, Shamsatun Nahar
出版事項: (2016) -
Mechanization of the Sturmfel-Salmon resultant method
著者:: Sulaiman, Surajo, 等
出版事項: (2017) -
The implementation of hybrid resultant matrix formulation
著者:: Ahmad, Shamsatun Nahar, 等
出版事項: (2015) -
Computing Sylvester resultant matrix in hermite polynomials
著者:: AlSolami, Somiah Merezeeq A
出版事項: (2019)