Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)

DOI10.1016/J.JSC.2007.09.001zbMath1132.13312OpenAlexW1989690103MaRDI QIDQ2481474

Agnes Szanto

Publication date: 10 April 2008

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.09.001

zbMATH Keywords

multivariate subresultantover-determined polynomial systemsolution of polynomial system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)

Related Items (11)

Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting) ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Subresultants and the Shape Lemma ⋮ On the irreducibility of multivariate subresultants. ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ The Hessian polynomial and the Jacobian ideal of a reduced hypersurface in \(\mathbb{P}^n\) ⋮ Waring decompositions and identifiability via Bertini and Macaulay2 software ⋮ Bounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrization ⋮ Multivariate subresultants using Jouanolou matrices ⋮ Subresultants of several univariate polynomials in Newton basis ⋮ Fitting ideals and multiple points of surface parameterizations

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
• Ideaux resultants
• Hybrid sparse resultant matrices for bivariate polynomials
• Le formalisme du résultant. (The formalism of resultant)
• Determinantal formulae for the solution set of zero-dimensional ideals
• Solutions of systems of algebraic equations and linear maps on residue class rings
• Computing the isolated roots by matrix methods
• Inertia forms and resultant: A formulary
• Fast algorithms for zero-dimensional polynomial systems using duality
• On the irreducibility of multivariate subresultants.
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• The resultant of an unmixed bivariate system
• The computational complexity of the Chow form
• Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
• Multivariate subresultants
• H-bases for polynomial interpolation and system solving
• Subresultants and generic monomial bases
• Zur inhomogenen Eliminationstheorie
• Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination]
• Residues and Resultants
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Subresultants and Reduced Polynomial Remainder Sequences
• Explicit formulas for the multivariate resultant.

This page was built for publication: Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)