Stable normal forms for polynomial system solving

DOI10.1016/j.tcs.2008.09.004zbMath1159.68045OpenAlexW1999647319MaRDI QIDQ2378497

Philippe Trebuchet, Mourrain, Bernard

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.004

zbMATH Keywords

normal formmultivariate polynomialquotient algebraroot-findingborder basissymbolic-numeric computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Moments and sums of squares for polynomial optimization and related problems, A stabilized normal form algorithm for generic systems of polynomial equations, Border bases for lattice ideals, Numerical root finding via Cox rings, Computing coupled border bases, Border basis relaxation for polynomial optimization, Truncated normal forms for solving polynomial systems: generalized and efficient algorithms, Overdetermined Weierstrass iteration and the nearest consistent system, Complexity of Gröbner basis detection and border basis detection, A Polyhedral Characterization of Border Bases, Flat families by strongly stable ideals and a generalization of Gröbner bases, Solving Polynomial Systems via Truncated Normal Forms

Uses Software

• FGb
• Kronecker
• ISOLATE

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
• An elementary construction of the multigraded Hilbert scheme of points
• Introduction to the solution of polynomial systems
• Computing the isolated roots by matrix methods
• Solving zero-dimensional systems through the rational univariate representation
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Characterizations of border bases
• Matrices in elimination theory
• H-bases for polynomial interpolation and system solving
• On E. Cartan's Prolongation Theorem of Exterior Differential Systems
• Solving projective complete intersection faster
• Numerical Polynomial Algebra
• Generalized normal forms and polynomial system solving
• A Gröbner free alternative for polynomial system solving