The implementation of hybrid resultant matrix formulation
The resultant matrix constructed in this paper is based on the Sylvester-Bèzout formulation which gives a hybrid resultant matrix consisting of the Sylvester and Bèzout blocks. In this work, a new algorithm for the construction has been developed and implemented as a computer package written in C++....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/60799/ https://www.researchgate.net/publication/299855275_The_implementation_of_a_hybrid_resultant_matrix_formulation |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Summary: | The resultant matrix constructed in this paper is based on the Sylvester-Bèzout formulation which gives a hybrid resultant matrix consisting of the Sylvester and Bèzout blocks. In this work, a new algorithm for the construction has been developed and implemented as a computer package written in C++. The empirical results of the implementation on certain systems of multivariate polynomials are observed and compared to its mixed volume of subdivision Minkowski sum for determining the existence of exact resultant. An application for abstracting the resultant from the determinant of the matrix and determining the solutions of the given system of equations is illustrated. |
|---|