The calculator gives the resultant of two univariate polynomials. It also displays the Silvester matrix.

This page exists due to the efforts of the following people:




Created: 2019-08-16 19:13:36, Last updated: 2021-03-15 20:20:30
Creative Commons Attribution/Share-Alike License 3.0 (Unported)

This content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work Also, please do not modify any references to the original work (if any) contained in this content.

This calculator computes the resultant of two polynomials Res(A,B). Zero resultant means the polynomials have a common factor (root). If the polynomials have no common factors the resultant is always not zero. E.g. the polynomials 3x3+9 x2+x+3 and x2+5x+6 have common factor x+3 and the resultant of these polynomials equals to zero:




Sylvester matrix

The resultant computation

The resultant can be calculated as the determinant of Sylvester matrix, composed of the polynomials coefficients. The calculator displays Sylvester matrix for input polynomials for reference only, since it uses another algorithm, based on Euclidean division. The calculator has a modified version of the resultant computation algorithm published in Computer Algebra and Symbolic Computation book by Joel S. Cohen 1:

//Input polynomials
//result variable
a ⟵ 1
loop {
   //polynomial degrees
    m ⟵ deg(u(x))
    n ⟵ deg(v(x))      
    if ( n = 0 ) {
         a ⟵ a*v[0]^m
         return a;
    //polynomial division remainder
    r(x) ⟵ u(x) mod v(x)
    if ( r(x) = 0 ) {
        return 0;
    s ⟵ deg(r(x))
    a ⟵ a * v[n]^(m-s) * (-1)^(mn)
    u(x) ⟵ v(x)
    v(x) ⟵ r(x)

  1. Joel S. Cohen Computer Algebra and Symbolic Computation. Mathematical Methods. par. 7.1 The Resultant Concept 

URL copied to clipboard