Solving Polynomial System Efficiently and Accurately

03/21/2018 ∙ by Bernard Mourrain, et al. ∙ 0

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. We use new characterizations of normal forms and describe accurate and efficient constructions that allow us to compute the algebra structure of R/I, and hence the solutions of I. We show how the resulting algorithms give accurate results in double precision arithmetic and compare with normal form algorithms using Groebner bases and homotopy solvers.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.