Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor (Q4652743): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New structure theorem for subresultants / rank | |||
Normal rank |
Latest revision as of 19:09, 7 June 2024
scientific article; zbMATH DE number 2139358
Language | Label | Description | Also known as |
---|---|---|---|
English | Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor |
scientific article; zbMATH DE number 2139358 |
Statements
Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor (English)
0 references
28 February 2005
0 references
numerical examples
0 references
subresultant
0 references
algorithms
0 references
greatest common divisor
0 references
polynomials
0 references
Bézout matrices
0 references
0 references
0 references