Pages that link to "Item:Q4652743"
From MaRDI portal
The following pages link to Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor (Q4652743):
Displaying 16 items.
- Computing self-intersection curves of rational ruled surfaces (Q625181) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- A new approach for constructing subresultants (Q864796) (← links)
- Changing views on curves and surfaces (Q1696176) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices (Q1864875) (← links)
- Subresultant chains using Bézout matrices (Q2109975) (← links)
- Computing singular points of plane rational curves (Q2474248) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- Parameterization of the discriminant set of a polynomial (Q2628787) (← links)
- Bezout identities and common minor zeros of 2-D polynomial matrices, and applications to time-delay systems (Q3489842) (← links)
- Division-free computation of subresultants using Bezout matrices (Q5850765) (← links)
- An efficient free-division algorithm for computing polynomial subresultants using non-homogeneous Bezout matrix (Q6669112) (← links)
