Pages that link to "Item:Q2564953"

The following pages link to An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953):

Displaying 15 items.

• Metric problems for quadrics in multidimensional space (Q480662) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• Various new expressions for subresultants and their applications (Q1762553) (← links)
• On the Bézout construction of the resultant (Q1808661) (← links)
• Simultaneous elimination by using several tools from real algebraic geometry (Q1808663) (← links)
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices (Q1864875) (← links)
• A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
• A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
• On the Relation Between Matrices and the Greatest Common Divisor of Polynomials (Q3304778) (← links)
• On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
• Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions (Q5945288) (← links)
• An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix (Q6669112) (← links)