# Newton's Method for Finding Roots

## Chaotic Behavior and Newton's Method

An algorithm leads to chaotic behavior if two starting points which are close together generate iterates which are sometimes far apart and sometimes close together: is small but is large for lots (infinitely many) of values of and is small for lots of values of .

The iterates of the next simple algorithm exhibit chaotic behavior.

**A Simple Chaotic Algorithm: **Starting with any number between and , double the number and keep the fractional part of the result: is the fractional part of is the fractional part of , and in general, .

If , then the iterates of the algorithm are (= fractional part of The iterates for two other starting values close to are given below as well as the iterates of and :

There are starting values as close together as we want whose iterates are far apart infinitely often. Many physical, biological, and business phenomena exhibit chaotic behavior. Atoms can start out within inches of each other and several weeks later be hundreds of miles apart. The idea that small initial differences can lead to

dramatically diverse outcomes is sometimes called the "Butterfly Effect" from the title of a talk ("Predictability: Does the Flap of a Butterfly's Wings in Brazil Set Off a Tornado in Texas?") given by Edward Lorenz, one of the first

people to investigate chaos. The "butterfly effect" has important implications about the possibility, or rather the impossibility, of accurate longâ€“range weather forecasting. Chaotic behavior is also an important aspect of studying turbulent air and water flows, the incidence and spread of diseases, and even the fluctuating behavior of the stock market.

Newton's method often exhibits chaotic behavior, and, since it is a relatively easy to study, is often used as a model to study the properties of chaotic behavior. If we use Newton's method to approximate the roots of (with roots and ), then starting points which are very close together can have iterates which converge to different roots. The iterates of and converge to the roots and , respectively. The iterates of the middle point converge to the root , and the iterates of another nearby point, , simply cycle between and and do not converge at all.

**Practice 6: **Find the first 4 Newton's method iterates of and for . Try two other starting values very close to (but not equal to ) and find their first iterates. Use the graph of to explain how starting points so close together can quickly have iterates so far apart.