File : pdf, 1 MB, 151 pages
by Shlomo Sternberg
TOC
1 Iterations and fixed points
1.1 Square roots
1.2 Newton’s method
1.2.1 The guts of the method
1.2.2 A vector version
1.2.3 Implementation
1.2.4 The existence theorem
1.2.5 Basins of attraction
1.3 The implicit function theorem
1.4 Attractors and repellers
1.5 Renormalization group
2 Bifurcations
2.1 The logistic family
2.2 Local bifurcations
2.2.1 The fold
2.2.2 Period doubling
2.3 Newton’s method and Feigenbaum’s constant
2.4 Feigenbaum renormalization
2.5 Period 3 implies all periods
2.6 Intermittency
3 Conjugacy
3.1 Affine equivalence
3.2 Conjugacy of T and L4
3.3 Chaos
3.4 The saw-tooth transformation and the shift
3.5 Sensitivity to initial conditions
3.6 Conjugacy for monotone maps
3.7 Sequence space and symbolic dynamics
4 Space and time averages
4.1 histograms and invariant densities
4.2 the histogram of L4
4.3 The mean ergodic theorem
4.4 the arc sine law
4.5 The Beta distributions
5 The contraction fixed point theorem
5.1 Metric spaces
5.2 Completeness and completion
5.3 The contraction fixed point theorem
5.4 Dependence on a parameter
5.5 The Lipschitz implicit function theorem
6 Hutchinson’s theorem and fractal images
6.1 The Hausdorff metric and Hutchinson’s theorem
6.2 Affine examples
6.2.1 The classical Cantor set
6.2.2 The Sierpinski Gasket
7 Hyperbolicity
7.1 C0 linearization near a hyperbolic point
7.2 invariant manifolds
8 Symbolic dynamics
8.1 Symbolic dynamics
8.2 Shifts of finite type
8.2.1 One step shifts
8.2.2 Graphs
8.2.3 The adjacency matrix
8.2.4 The number of fixed points
8.2.5 The zeta function
8.3 Topological entropy
8.3.1 The entropy of YG from A(G)
8.4 The Perron-Frobenius Theorem
8.5 Factors of finite shifts
Download : pdf1
