An Algorithm for Optimizing the Size of Dixon Resultant Matrix
In the process of eliminating variables in a symbolic polynomial system, the extraneous factors are referred to the unwanted parameters of resulting polynomial. This paper aims at reducing the number of these factors via optimizing the size of Dixon matrix. An optimal configuration of Dixon matrix would lead to the enhancement of the process of computing the resultant which uses for solving polynomial systems. To do so, an optimization algorithm along with a number of new polynomials is introduced to replace the polynomials in the polynomial system. Moreover, the monomial multipliers are optimally positioned to multiply each of the polynomials. Further, the optimization algorithm has been used in terms of complexity analysis. Implementation of this method on standard examples proves the high efficiency the method.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Articles published by TSP are under an Open Access license, which means all articles published by TSP are accessible online free of charge and as free of technical and legal barriers to everyone. Published materials can be re-used if properly acknowledged and cited Open Access publication is supported by the authors' institutes or research funding agencies by payment of a comparatively low Article Processing Charge (APC) for accepted articles.