University of Cambridge > Talks.cam > Combinatorics Seminar > Newton's Method for Finding Roots of Complex Polynomials: Complex Dynamics Between Combinatorics and Numerical Analysis

Newton's Method for Finding Roots of Complex Polynomials: Complex Dynamics Between Combinatorics and Numerical Analysis

Add to your list(s) Download to your calendar using vCal

  • UserDierk Schleicher (Jacobs University, Bremen)
  • ClockThursday 28 January 2010, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We shall discuss Newton’s root-finding method for the case of complex polynomials in a single variable. This method has been known to approximate roots extremely efficiently, once good approximate solutions are known, but its global properties are known to be difficult to describe. We shall discuss recent results towards turning Newton’s method into an efficient algorithm for finding all roots of given complex polynomials, and give a classification of all “bad cases” in combinatorial terms using “Newton graphs”. This also answers a question raised by Smale.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity