IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v77y2008i4p400-407.html
   My bibliography  Save this article

Heuristics to accelerate the Dixon resultant

Author

Listed:
  • Lewis, Robert H.

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.

Suggested Citation

  • Lewis, Robert H., 2008. "Heuristics to accelerate the Dixon resultant," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 77(4), pages 400-407.
    • Handle: RePEc:eee:matcom:v:77:y:2008:i:4:p:400-407
    DOI: 10.1016/j.matcom.2007.04.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847540700170X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2007.04.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lewis, Robert H. & Coutsias, Evangelos A., 2016. "Flexibility of Bricard’s linkages and other structures via resultants and computer algebra," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 125(C), pages 152-167.
    2. Lewis, Robert H., 2010. "Comparing acceleration techniques for the Dixon and Macaulay resultants," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(6), pages 1146-1152.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:77:y:2008:i:4:p:400-407. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.