A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
From MaRDI portal
Publication:2883813
DOI10.1145/1576702.1576727zbMath1237.65046OpenAlexW2135960888MaRDI QIDQ2883813
Stef Graillat, Philippe Trebuchet
Publication date: 13 May 2012
Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1576702.1576727
Related Items (5)
Polynomial-exponential decomposition from moments ⋮ On deflation and multiplicity structure ⋮ Solving a sparse system using linear algebra ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Border Basis for Polynomial System Solving and Optimization
Uses Software
This page was built for publication: A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
