The following pages link to Matrices in elimination theory (Q1808659):
Displaying 40 items.
- Solving a sparse system using linear algebra (Q491257) (← links)
- On the Mahler measure of resultants in small dimensions (Q869215) (← links)
- Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry (Q1415389) (← links)
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients (Q1432892) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q1602945) (← links)
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- A package for computations with classical resultants (Q1755194) (← links)
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation (Q1878474) (← links)
- Multihomogeneous resultant formulae by means of complexes (Q1878475) (← links)
- The resultant of an unmixed bivariate system (Q1878480) (← links)
- An eigen-representation of the Navier-Stokes equations (Q2112666) (← links)
- A package for computations with sparse resultants (Q2121682) (← links)
- Numerical root finding via Cox rings (Q2173863) (← links)
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (Q2200298) (← links)
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials (Q2284950) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Computing the common zeros of two bivariate functions via Bézout resultants (Q2514244) (← links)
- Computations of multi-resultant with mechanization (Q2572016) (← links)
- The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
- Constructing Sylvester-type resultant matrices using the Dixon formulation (Q2643539) (← links)
- Macaulay style formulas for sparse resultants (Q2782655) (← links)
- BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS (Q3422219) (← links)
- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports (Q3598003) (← links)
- Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling (Q4603032) (← links)
- Computing the Dixon Resultant with the Maple Package DR (Q4610015) (← links)
- Solving Polynomial Systems via Truncated Normal Forms (Q4689237) (← links)
- Accurate solution of polynomial equations using Macaulay resultant matrices (Q4821046) (← links)
- The Multivariate Schwartz--Zippel Lemma (Q5071095) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems (Q5157586) (← links)
- Sparse difference resultant (Q5891997) (← links)
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants (Q5937883) (← links)
- Resultant over the residual of a complete intersection. (Q5951556) (← links)
- Explicit formulas for the multivariate resultant. (Q5951557) (← links)
- Exact line and plane search for tensor optimization (Q5963312) (← links)
- The Canny-Emiris conjecture for the sparse resultant (Q6101263) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
