Computing Real Roots of Real Polynomials and its Application in Computational Geometry
published: May 4, 2015, recorded: March 2015, views: 253
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
I also discuss recent advances in the computation of real roots of real polynomials. Near optimal solutions for the more general problem of isolating the complex roots of complex polynomials are known for quite some time (V. Pan, 2002). The new algorithms achieve the same time complexity for a sub-problem and are considerably simpler. I also discuss application to computational geometry, in particular, cylindrical algebraic decomposition. The talk is based on joint work with Michael Sagraloff.
Download slides: eurocg2015_mehlhorn_computing_roots_01.pdf (412.7 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !