Smale, a recent Fields Medalist, will continue his studies in computational complexity theory. In particular he will study Newton's method and variations of this algorithm for solving equations. Smale's approach is to view iterative algorithms dynamically. The implementation of the algorithm is viewed to a large extent as a dynamical system and the results from dynamical systems theory are then used to develop estimates on the global speed of convergence of the algorithm rather than just estimates on the asymptotic rate of convergence.

Agency
National Science Foundation (NSF)
Institute
Division of Mathematical Sciences (DMS)
Application #
8701750
Program Officer
James Glazebrook
Project Start
Project End
Budget Start
1987-06-15
Budget End
1992-11-30
Support Year
Fiscal Year
1987
Total Cost
$329,962
Indirect Cost
Name
University of California Berkeley
Department
Type
DUNS #
City
Berkeley
State
CA
Country
United States
Zip Code
94704