TY - EJOU AU - Zhang, Shang AU - Karimi, Seyedmehdi AU - Shamshirband, Shahaboddin AU - Mosavi, Amir TI - Optimization Algorithm for Reduction the Size of Dixon Resultant Matrix: A Case Study on Mechanical Application T2 - Computers, Materials \& Continua PY - 2019 VL - 58 IS - 2 SN - 1546-2226 AB - 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 and implement a complexity analysis. Moreover, the monomial multipliers are optimally positioned to multiply each of the polynomials. Furthermore, through practical implementation and considering standard and mechanical examples the efficiency of the method is evaluated. KW - Dixon resultant matrix KW - symbolic polynomial system KW - elimination theory KW - optimization algorithm KW - computational complexity DO - 10.32604/cmc.2019.02795