Matrices in elimination theory

DOI10.1006/jsco.1998.0266zbMath0943.13005OpenAlexW1968297701MaRDI QIDQ1808659

Ioannis Z. Emiris, Mourrain, Bernard

Publication date: 5 September 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/09ab095e2abd16e1bb6a2b6f51a6960798b5b744

zbMATH Keywords

polynomial equationsBezout matrixtoric resultant

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials over commutative rings (13B25)

Related Items

A package for computations with sparse resultants ⋮ Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation ⋮ Multihomogeneous resultant formulae by means of complexes ⋮ The resultant of an unmixed bivariate system ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Stable normal forms for polynomial system solving ⋮ Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Accurate solution of polynomial equations using Macaulay resultant matrices ⋮ The Multivariate Schwartz--Zippel Lemma ⋮ On the Mahler measure of resultants in small dimensions ⋮ Numerical root finding via Cox rings ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Sparse resultants and straight-line programs ⋮ The Canny-Emiris conjecture for the sparse resultant ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Locating and Counting Equilibria of the Kuramoto Model with Rank-One Coupling ⋮ Computing the Dixon Resultant with the Maple Package DR ⋮ Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry ⋮ Sparse difference resultant ⋮ Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients ⋮ Computing multihomogeneous resultants using straight-line programs ⋮ Solving a sparse system using linear algebra ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ A package for computations with classical resultants ⋮ Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants ⋮ Macaulay style formulas for sparse resultants ⋮ The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports ⋮ Resultant over the residual of a complete intersection. ⋮ Explicit formulas for the multivariate resultant. ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials ⋮ Exact line and plane search for tensor optimization ⋮ Computing the common zeros of two bivariate functions via Bézout resultants ⋮ BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS ⋮ Computations of multi-resultant with mechanization ⋮ The predicates of the Apollonius diagram: algorithmic analysis and implementation ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Algebraic methods and arithmetic filtering for exact predicates on circle arcs ⋮ An eigen-representation of the Navier-Stokes equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bernstein's theorem in affine space
• Generalised characteristic polynomials
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• Solving systems of polynomial inequalities in subexponential time
• Multidimensional structured matrices and polynomial systems
• Résolution des systèmes d'équations algébriques
• Le formalisme du résultant. (The formalism of resultant)
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Chow polytopes and general resultants
• Fiber polytopes
• Implicit representation of rational parametric surfaces
• The number of roots of a system of equations
• Newton polytopes and the Bezout theorem
• Computing the isolated roots by matrix methods
• How to count efficiently all affine roots of a polynomial system
• Toric intersection theory for affine root counting
• Residue currents and Bezout identities
• Multigraded resultants of Sylvester type
• On the Newton polytope of the resultant
• Product formulas for resultants and Chow forms
• A convex geometric approach to counting the roots of a polynomial system
• A global view of residues in the torus
• Isolated points, duality and residues
• Algorithms for residues and Łojasiewicz exponents
• Bounds of traces in complete intersections and degrees in the Nullstellensatz
• A note on testing the resultant
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• On the complexity of sparse elimination
• Effective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n\)]
• Improved Algorithms for Sign Determination and Existential Quantifier Elimination
• Introduction to Toric Varieties. (AM-131)
• Solving sparse linear equations over finite fields
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
• THE GEOMETRY OF TORIC VARIETIES
• On Grau’s Method for Simultaneous Factorization of Polynomials
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• Matrix eigenproblems are at the heart of polynomial system solving
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Computation of a specified root of a polynomial system of equations using eigenvectors