Pages that link to "Item:Q1260754"
From MaRDI portal
The following pages link to Multipolynomial resultant algorithms (Q1260754):
Displaying 26 items.
- Resultants and contour integrals (Q366044) (← links)
- Kukles revisited: Advances in computing techniques (Q630663) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- Structured matrices in the application of bivariate interpolation to curve implicitization (Q870441) (← links)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
- Sparse resultant under vanishing coefficients (Q1408687) (← links)
- Dense resultant of composed polynomials: mixed-mixed case (Q1432880) (← links)
- Generalized resultants over unirational algebraic varieties (Q1569828) (← links)
- Global methods for solving systems of nonlinear algebraic equations (Q1591945) (← links)
- Fast computation of the Bézout and Dixon resultant matrices (Q1599530) (← links)
- Sparse resultant of composed polynomials. I: Mixed-unmixed case. (Q1600042) (← links)
- Sparse resultant of composed polynomials. II: Unmixed-mixed case. (Q1600043) (← links)
- Implicitization of rational surfaces by means of polynomial interpolation (Q1603812) (← links)
- Resultant elimination via implicit equation interpolation (Q1691953) (← links)
- A package for computations with classical resultants (Q1755194) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Exact matrix formula for the unmixed resultant in three variables (Q1779473) (← links)
- The resultant of an unmixed bivariate system (Q1878480) (← links)
- Resultants of partially composed polynomials (Q2457350) (← links)
- Parallel computation of determinants of matrices with polynomial entries (Q2643537) (← links)
- A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
- Pseudozeros of multivariate polynomials (Q4794655) (← links)
- A proof of Hilbert's theorem on ternary quartic forms (Q5217463) (← links)
- RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS (Q5314399) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
- Computation of a specified root of a polynomial system of equations using eigenvectors (Q5926400) (← links)
