Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 46, Pages: 1-8
Surajo Sulaiman1,2 and Nor’aini Aris1 *
1Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia 81310, UTM Johor Bahru, Johor, Malaysia; [email protected] , [email protected] 2Department of Mathematics, Faculty of Science, Northwest University Kano 700221, Kano-Nigeria; [email protected]
*Author for correspondence
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia 81310, UTM Johor Bahru, Johor, Malaysia; [email protected]
Objective: To evaluate and compare different hybrid resultant formulations in relation to computational complexity, performance and optimality condition. Methods/Statistical Analysis: Hybrid matrices are evaluated using computer algebra system. Findings: we have shown that, none of the hybrid formulation works well with the exception of . However, after deleting the zero rows and columns the resulting matrix may not be a square matrix, on the other hand, we studied and established that none of the hybrid formulation produces a square matrix in general and likewise predicted that, the density or sparseness of the polynomial equations does not influence the performance of these hybrid matrix formulations. Applications/Improvements: This comparison reveals that, the existing hybrid methods for computing resultant are not efficient and therefore there is need for another formulations with will focus on the current limitations described in this paper.
Keywords: Hybrid Matrix, Hybrid Resultant, Resultant, Resultant Matrix, System of Polynomials
Subscribe now for latest articles and news.