Heuristics to accelerate the Dixon resultant

Robert H. Lewis

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 77, issue 4, 400-407

Abstract: The Dixon resultant method solves a system of polynomial equations by computing its resultant. It constructs a square matrix whose determinant (det) is a multiple of the resultant (res). The naïve way to proceed is to compute det, factor it, and identify res. But often det is too large to compute or factor, even though res is relatively small. In this paper we describe three heuristic methods that often overcome these problems. The first, although sometimes useful by itself, is often a subprocedure of the second two. The second may be used on any polynomial system to discover factors of det without producing the complete determinant. The third applies when res appears as a factor of det in a certain exponential pattern. This occurs in some symmetrical systems of equations. We show examples from computational chemistry, signal processing, dynamical systems, quantifier elimination, and pure mathematics.

Keywords: Resultant; Dixon; Bezout; Polynomial system (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037847540700170X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:77:y:2008:i:4:p:400-407

DOI: 10.1016/j.matcom.2007.04.007

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().