KAM theory
KAM theory
The Kolmogorov-Arnold-Moser (KAM) theorem presents limits to the notion of chaos. This is the deepest result to date on this subject. This chapter starts with a review of Newton's method for solving non-linear equations, itself the iteration of a function. It introduces a notion of distance from the fixed point of Newton's iteration, which is used to prove convergence for good initial conditions. This is then applied to a model problem, that of bringing a matrix to normal form. KAM theory for maps of the circle to itself is developed next. Amazingly, maps close to rational rotations are chaotic while those close to irrational rotations are not. A digression into number theory explores the connection to Diophantine equations. Finally, the chapter solves the Hamilton-Jacobi equation by Newton's iteration, establishing that there are small perturbations of integrable systems that are not chaotic.
Keywords: Newton's iteration, Kolmogorov-Arnold-Moser theorem, non-linear equations, matrix, Hamilton-Jacobi equation
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
