Bezout matrices, subresultant polynomials and parameters (Q833155): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Various new expressions for subresultants and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for computing determinants and resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia characteristics of self-adjoint matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for constructing subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective algorithm of computing symbolic determinants with multivariate polynomial entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: New structure theorem for subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipolynomial resultant algorithms / rank
 
Normal rank

Revision as of 20:40, 1 July 2024

scientific article
Language Label Description Also known as
English
Bezout matrices, subresultant polynomials and parameters
scientific article

    Statements

    Bezout matrices, subresultant polynomials and parameters (English)
    0 references
    12 August 2009
    0 references
    Let \(D\) be an integral domain and \(T_1, \dots, T_r\) a set of parameters taking values in the algebraic closure of \(D\). Let \(P(x)\) and \(Q(x)\) two polynomials with coefficients in \(D[T_1, \dots, T_r].\) The main goal of the paper under review is to analyse new determinantal expressions which define the subresultant sequence of polynomials \(P\) and \(Q\). The definition of the subresultant polynomials is introduced in section 1. Different algorithm to compute the subresultant sequence are described in section 2. Finally, the experimental results and conclusions are given in section 3.
    0 references
    0 references
    subresultant polynomials
    0 references
    Bezout matrices
    0 references
    determinants
    0 references
    Samuelson-Berkowitz algorithm
    0 references

    Identifiers