# OVER AND

OVER AGAIN

### GENGZHE CHANG and

THOMAS W. SEDERBERG

## PrefaceTransformation and iteration are two of the most basic notions in mathematics. The three parts of this book discuss a variety of transformations and their iterations, arranged in order of sophistication. Chapters one through nineteen discuss iterations in elementary mathematics. Most problems in this part come from mathematical olympiads of different countries, many from China, drawn largely from the first author's extensive experience as coach of the Chinese delegation at the International Mathematical Olympiads (IMO). We give special attention to transformations with a smoothing property. A variety of measures of smoothness occurs in our discussions. For example, for ordered Two theorems contained in the first part should be spotlighted. The first (in Chapter 16) is the beautiful theorem discovered by Douglas and Neumann independently in the early 1940's; it gives a process for constructing a regular Chapters 19-22 address functional iterations. Basic properties of continuous functions are briefly reviewed in Chapter 19. As a simple illustration Newton's method for finding roots is presented in Chapter 21. Chapter 23 discusses the main result of Li and Yorke's famous paper The last part of the book involves Bézier curves and surfaces; they play an important role in computer aided geometric design (CAGD), a new branch of applied mathematics and computer science. They are a common research interest of the two authors. Bézier techniques are based on Bernstein polynomials, devised in the early 1900's, but which had no numerical application until the early 1960's. Bézier curves and surfaces enable a designer to produce a smooth and pleasing shape, and a program to direct a machine tool to actually create it, by adjusting the locations of control points. The designer does not need to know how this works, but the details of the process have connections with much interesting mathematics, and we explore this. For instance, we obtain estimates for the distances between the control points and the curve; this yields the Weierstrass approximation theorem. Some smoothing and convexity-preserving properties of the Bernstein transformation can be formulated as theorems. As a preparation we included a chapter on variation diminishing matrices. Spline functions were discussed by 1. J. Schoenberg in the 1940's and have become powerful tools in interpolation and approximation theory, as well as in CAGD. Chapter 27 discusses cubic spline functions for purposes of interpolation, and Chapters 1 - 18 require only high school mathematics, with a few exceptions. The level of the book becomes considerably more advanced in the later chapters. The additional background material required is mainly the basics of real analysis. This is not difficult for students who have an aptitude for mathematics and it is presented in an Appendix. It is the length and complexity of many of the discussions which makes the later chapters more difficult. The first author conceived the idea for this book and began collecting material for it while serving as an associate member of the |Contact| |Front page| |Contents| |Books| Copyright © 1996-2018 Alexander Bogomolny 69977754 |