Session S34 - Symbolic and Numerical Computation with Polynomials

Friday, July 16, 15:15 ~ 15:45 UTC-3

Towards correct and efficient computations with polynomials

Michael Burr

Clemson University, United States   -   This email address is being protected from spambots. You need JavaScript enabled to view it.

Traditionally, there has been a trade-off between efficiency and correctness when deciding between symbolic and numeric computations. Hybrid symbolic-numeric computations can avoid this trade-off and be both efficient and correct. Such hybrid methods have been particularly fruitful in algorithms for solving polynomial systems.

In this talk we will discuss a new framework for the design of hybrid symbolic-numeric computations. This framework is devised to expose the key details so that both the efficiency and the correctness of the developed algorithms can be studied directly. We will illustrate this framework on algorithms for finding the isolated roots of systems of polynomials.

Joint work with Chee Yap (New York University) and Juan Xu (Beihang University).

View abstract PDF