z-logo
open-access-imgOpen Access
Efficient Alternative Method for Computing Multivariate Resultant Formulation
Author(s) -
Surajo Sulaiman,
Nor’aini Aris,
Shamsatun Nahar Ahmad
Publication year - 2019
Publication title -
journal of mathematical and fundamental sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 12
eISSN - 2337-5760
pISSN - 2338-5510
DOI - 10.5614/j.math.fund.sci.2019.51.1.2
Subject(s) - matrix (chemical analysis) , block (permutation group theory) , set (abstract data type) , algorithm , computational complexity theory , basis (linear algebra) , mathematics , block matrix , mathematical optimization , computer science , combinatorics , geometry , materials science , eigenvalues and eigenvectors , physics , quantum mechanics , composite material , programming language
In elimination theory, the matrix method of computing resultant remains the most popular due to its less computational complexity compared to Groebner basis and set characteristics approaches. However, for a matrix method to be effective, the size and the nature of elements of the matrix play an important role, since if the resultant is not an exact resultant, it has to be  extracted from the determinant of the corresponding resultant matrix.. In this paper, a new resultant matrix is proposed. The proposed construction consists of four blocks, one of the blocks uses an entry formula of computing a Dixon matrix, while, two of the blocks use a mapping from the Jouanolou’s method and the last block consists of only zero elements. The new formulation is computed without intermediate cancelling terms which reduces the complexity of the construction and enhances its effectiveness.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom