![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Dierk Schleicher (Jacobs University, Bremen)
Thursday 28 January 2010, 14:30-15:30
Newton's Method for Finding Roots of Complex Polynomials: Complex Dynamics Between Combinatorics and Numerical Analysis
- đ¤ Speaker: Dierk Schleicher (Jacobs University, Bremen)
- đ Date & Time: Thursday 28 January 2010, 14:30 - 15:30
- đ Venue: MR12
Questions? Contact
Andrew Thomason
Abstract
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.
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.