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 ...
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. T...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
In the process of eliminating variables in a symbolic polynomial system, the extraneous factors are ...
Resultant is the result of eliminating the variables from a system of polynomials. Compared with oth...
Resultant is the result of eliminating the variables from a system of polynomials. Compared with oth...
AbstractA new method for constructing Sylvester-type resultant matrices for multivariate elimination...
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their proj...
Elimination methods based on generalizations of the Dixon's resultant formulation have been dem...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
AbstractA new method for constructing Sylvester-type resultant matrices for multivariate elimination...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
AbstractResultants characterize the existence of roots of systems of multivariate nonlinear polynomi...
AbstractThe problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial...
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. T...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
In the process of eliminating variables in a symbolic polynomial system, the extraneous factors are ...
Resultant is the result of eliminating the variables from a system of polynomials. Compared with oth...
Resultant is the result of eliminating the variables from a system of polynomials. Compared with oth...
AbstractA new method for constructing Sylvester-type resultant matrices for multivariate elimination...
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their proj...
Elimination methods based on generalizations of the Dixon's resultant formulation have been dem...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
AbstractA new method for constructing Sylvester-type resultant matrices for multivariate elimination...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
AbstractResultants characterize the existence of roots of systems of multivariate nonlinear polynomi...
AbstractThe problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial...
The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. T...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be ...