1 / 16

3. Topics

3. Topics. Line of Best Fit Geometry of Linear Maps Markov Chains Orthonormal Matrices. Line of Best Fit. Over-determined systems, e.g., coin flipping:. ( m = fraction of heads ). There is no solution since. Best fit is. Circulation duration of U.S. currency:.

connor-waters
Télécharger la présentation

3. Topics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 3. Topics • Line of Best Fit • Geometry of Linear Maps • Markov Chains • Orthonormal Matrices

  2. Line of Best Fit Over-determined systems, e.g., coin flipping: ( m = fraction of heads ) There is no solution since Best fit is

  3. Circulation duration of U.S. currency: life = m denom + b Ax = v Best fit is projection of v onto column space of A :

  4. Fitting curve a f(x) + b g(x) to a set of data points { m(x1), …, m(xn) } Ax = m Best fit is projection of m onto column space of A :

  5. Exercises 3.Topics.1. 1. When the space shuttle Challenger exploded in 1986, one of the criticisms made of NASA’s decision to launch was in the way the analysis of number of O-ring failures versus temperature was made (of course, O-ring failure caused the explosion). Four O-ring failures will cause the rocket to explode. NASA had data from 24 previous flights. The temperature that day was forecast to be 31ºF. (a) NASA based the decision to launch partially on a chart showing only the flights that had at least one O-ring failure. Find the line that best fits these seven flights. On the basis of this data, predict the number of O-ring failures when the temperature is 31, and when the number of failures will exceed four. (b) Find the line that best fits all 24 flights. On the basis of this extra data, predict the number of O-ring failures when the temperature is 31, and when the number of failures will exceed four. Which do you think is the more accurate method of predicting?

  6. Geometry of Linear Maps Non-Linear Maps Linear Maps Projection: Linear Rotation: Linear

  7. Every H can be written as H = P B Q, where B is a partial identity matrix, and P , Q are products of elementary matrices, Mi (k), Pi , j, and Ci , j (k). B ~ projection. Mi (k) ~ dilation Pi , j~ reflection Ci , j (k) ~ skew

  8. Linear map h maps subspaces into subspaces. E.g., line through 0 to line through 0. Dim h(V) cannot be greater than Dim V → a line can’t map onto a plane. Calculus: Near x0 , f(x)  f(x0) + (xx0) f (x0) is a linear map. Multi-dim: f : Rn → Rm , f(x)  f(x0) + [ (xx0) ·  ] f(x0) Chain rule: f dilates N( x )by a factor of f (x). g dilates N( f (x)) by a factor of g (f (x)). g  f dilates N( x )by a factor of g (f (x)) f (x). Multi-dim: proj, shear, etc…

  9. Exercises 3.Topics.2. 1. What combination of dilations, flips, skews, and projections produces the map h: R3 →R3 represented with respect to the standard bases by this matrix?

  10. Markov Chains Player starts with 3 dollars & bets a dollar for each coin toss. Game is over when he has no money or up to 5 dollars. 6 possible states: s0 , s1 , s2 , s3 , s4 , s5 with game over whenever s0 or s5 is reached. Let pi(n) be the probability for him to be in state si after n tosses. Then i = 2, 3 mi j = probability of state j changing to state i

  11. Starting with 3 dollars: Probability for game to be over is .125+.375 = .5 at n = 4, and .396 + .59676 = .99276 at n = 24. The coin toss is a Markov process / chain (no memory effect). States 0 & 5 are absorptive. M is the transition matrix. p is the probability vector.

  12. Exercises 3.Topics.3.

  13. Orthonormal Matrices Euclidean geometry: 2 figures are the same (congruent) if they have the same size & shape. • f : R2 →R2 is an isometry if it preserves distances. • 2 figures are congruent if they are related by an isometry. • The followings are preserved under isometry: • Collinearity. • Between-ness of points. • Properties of a triangle. • Properties of a circle. Klein’s Erlanger Program proposes that each kind of geometry — Euclidean, projective, etc.— can be described as the study of the properties that are invariant under some group of transformations.

  14. Characterization of Isometries by Means of Linear Algebra The only non-linear isometries is translation. If f is an isometry that sends 0 to v0, then v f(v)  v0is linear. A linear transformation t of the plane is an isometry iff and Proof : From Pythagorean theorem. Proof : Direct calculation. Matrix representation of a linear isometry is orthonormal, i.e., its columns are mutually orthogonal & of length one. Note: most people call such matrices orthogonal & define it by M MT = I.

  15. Rotation Reflection Euclidean study of congruence: (i) a rotation followed by a translation, or (ii) a reflection followed by a translation ( glide reflection). 2 Figures are similar if they are congruent after a change of scale. i.e., if there exists an orthonormal matrix T s.t. points q & p on them are related by

  16. Exercises 3.Topics.4. 1. Write down the formula for each of these distance-preserving maps. (a) the map that rotates π/ 6 radians, and then translates by e2. (b) the map that reflects about the line y = 2x. (c) the map that reflects about y =2x and translates over 1 and up 1.

More Related