A recursive algorithm for constructing complicated Dixon matrices
Applied Mathematics and Computation(2010)
Abstract
Whether the determinant of the Dixon matrix equals zero or not is used for determining if a system of n+1 polynomial equations in n variables has a common root, and is a very efficient quantifier elimination approach too. But for a complicated polynomial system, it is not easy to construct the Dixon matrix. In this paper, a recursive algorithm to construct the Dixon matrix is proposed by which some problems that cannot be tackled by other methods can be solved on the same computer platform. A dynamic programming algorithm based on the recursive formula is developed and compared for speed and efficiency to the recursive algorithm.
MoreTranslated text
Key words
Dixon polynomial,Dixon matrix,Quantifier elimination,Formal power series
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined