Generalized normal forms and polynomial system solving

DOI10.1145/1073884.1073920MaRDI QIDQ5262772zbMATH OpenOpenAlexFDO

Authors Bernard Mourrain, Philippe Trébuchet

Publication date 16 July 2015

Published in Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00070537/file/RR-5471.pdf

zbMATH Keywords

normal formroot-findingquotient algebramultivariate polynomialsymbolic-numeric computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05)

Recommendations

• Stable normal forms for polynomial system solving
• A stabilized normal form algorithm for generic systems of polynomial equations
• scientific article; zbMATH DE number 2098740
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• scientific article; zbMATH DE number 1504686

Cited in

(35)

• scientific article; zbMATH DE number 2098740 (Why is no real title available?)
• Effective algorithm for computing Noetherian operators of zero-dimensional ideals
• Globally maximizing the sum of squares of quadratic forms over the unit sphere
• On the construction of general cubature formula by flat extensions
• scientific article; zbMATH DE number 1504686 (Why is no real title available?)
• Polynomial-exponential decomposition from moments
• Blind algebraic identification of communication channels: symbolic solution algorithms
• Computing border bases without using a term ordering
• NORMAL BGG SOLUTIONS AND POLYNOMIALS
• Complexity of Gröbner basis detection and border basis detection
• The close relation between border and Pommaret marked bases
• Computing coupled border bases
• Flat extension and ideal projection
• On the complexity exponent of polynomial system solving
• A stabilized normal form algorithm for generic systems of polynomial equations
• Noether normalization guided by monomial cone decompositions
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Computing all border bases for ideals of points
• Border basis relaxation for polynomial optimization
• On deflation and multiplicity structure
• Overdetermined Weierstrass iteration and the nearest consistent system
• A Polyhedral Characterization of Border Bases
• Stable border bases for ideals of points
• Solving polynomial systems via truncated normal forms
• Flat families by strongly stable ideals and a generalization of Gröbner bases
• The approach of moments for polynomial equations
• On the topology of real algebraic plane curves
• Border basis for polynomial system solving and optimization
• A signature based border basis algorithm
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
• Artificial discontinuities of single-parametric Gröbner bases
• Pivoting in extended rings for computing approximate Gröbner bases
• Stable normal forms for polynomial system solving

This page was built for publication: Generalized normal forms and polynomial system solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262772)