A new approach for constructing subresultants
From MaRDI portal
Cites work
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
- Computing triangular systems and regular systems
- Elimination methods
- scientific article; zbMATH DE number 3922806 (Why is no real title available?)
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- New structure theorem for subresultants
- On Euclid's Algorithm and the Theory of Subresultants
- Subresultants and Reduced Polynomial Remainder Sequences
Cited in
(15)- Computing the topology of an arrangement of implicitly defined real algebraic plane curves
- Subresultants under composition
- Subresultants revisited.
- New structure theorem for subresultants
- Tools for analyzing the intersection curve between two quadrics through projection and lifting
- Solving the interference problem for ellipses and ellipsoids: new formulae
- Subresultant chains using Bézout matrices
- An algebraic framework for computing the topology of offsets to rational curves
- Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants
- Two Variants of Bézout Subresultants for Several Univariate Polynomials
- Subresultants of several univariate polynomials in Newton basis
- A basis-preserving algorithm for computing the Bézout matrix of Newton polynomials
- Bezout matrices, subresultant polynomials and parameters
- Improving the topology computation of an arrangement of cubics
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication: A new approach for constructing subresultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864796)
