![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
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 AnalysisAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsEnterprise Tuesday 2016-2017 Pembroke Papers Entrepreneurship Centre at Cambridge Judge Business SchoolOther talksCambridge - Corporate Finance Theory Symposium September 2018 - Day 1 Animal Migration Surface meltwater ponding and drainage causes ice-shelf flexure Roland the Hero "Vectorbuilder: Revolutionising Vector Design & Custom Cloning" (25 min seminar) followed by "Advanced Technologies For Rapid Generation Of Custom Designed Animal Models" (25 min seminar) Bank credit rating changes, capital structure adjustments and lending |