Generalized normal forms and polynomial system solving
From MaRDI portal
Publication:5262772
DOI10.1145/1073884.1073920zbMath1360.68947OpenAlexW1974158837MaRDI QIDQ5262772
Mourrain, Bernard, Philippe Trebuchet
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
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)
Related Items
Polynomial-exponential decomposition from moments ⋮ On the construction of general cubature formula by flat extensions ⋮ The close relation between border and Pommaret marked bases ⋮ On deflation and multiplicity structure ⋮ Flat extension and ideal projection ⋮ Stable normal forms for polynomial system solving ⋮ A stabilized normal form algorithm for generic systems of polynomial equations ⋮ Blind algebraic identification of communication channels: symbolic solution algorithms ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ On the complexity exponent of polynomial system solving ⋮ Computing coupled border bases ⋮ A signature based border basis algorithm ⋮ Border basis relaxation for polynomial optimization ⋮ On the topology of real algebraic plane curves ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ Artificial discontinuities of single-parametric Gröbner bases ⋮ Computing border bases without using a term ordering ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Computing all border bases for ideals of points ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ Pivoting in extended rings for computing approximate Gröbner bases ⋮ 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 ⋮ Stable border bases for ideals of points ⋮ The Approach of Moments for Polynomial Equations ⋮ Border Basis for Polynomial System Solving and Optimization ⋮ A prolongation-projection algorithm for computing the finite real variety of an ideal
