🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →

HomeStudy Guides420,000CA160,000

MAT237Y1 : mat237 1-3-2.pdf

52 views1 pages

beigeplatypus770

6 Oct 2014

School

Department

Course

Professor

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

As in the case of functions of one variable, a function fff : rn rm is continuous at a point aaa rn if fff (xxx) = fff (aaa). Indeed there need not be even a describable path for getting close to the point (a1, a2), it could just be or become near in a mystic way! As such we have isolated the approaching to (0, 0)" and have translated it to r 0. This translates the question of limit of a two variable function into the limit of a one variable function. For example in example 1 we see that the function f in polar coordinates will look r2 cos sin r2 which is really 1. But since the variable r has disappeared from the picture then like clearly the function f need not approach 0. Indeed for di erent values of the value of f as r 0 is di erent.

Related Documents

MAT237Y1 Study Guide - Final Guide: Intermediate Value Theorem, Folland Aircraft, Connected Space

indigowallaby753

MAT237Y1 : mat237 1-8.pdf

beigeplatypus770

MAT237Y1 : mat237 1-7.pdf

beigeplatypus770

Related Questions

~ just means vector

Suppose ~r(u) = r0(u)~i + r1(u)~j satisfies r'0(u) > 0 and r'1(u) < 0. Let a particle begin traveling from the point ~r(0) along the path ~r(u) beginning at a standstill. A consequence p of the conservation of energy is that the speed of the particle when it reaches point ~r(u) is sqrt(2g(r1(0) - r1(u)) where g is acceleration due to gravity.

(a) From this fact, derive a formula for the time it takes a particle to descend from ~r(0) to ~r(u) for any fixed u.

(b) Suppose that ~r(t) = (t-sin(t))~i+ (1+ cos(t))~j. Compute the time to descend from ~r(u0) to ~r(pi) as well as the arc length of the path for u0 = 0, 0.5, 1. You may use a computer algebra system for the latter integrals, the first should be done by hand.

(c) Compute time of descent and arc length of at least two other paths connecting (0, 2) and (pi, 0). You may use a computer algebra system to evaluate the integrals.

(d) Make some conjectures about the path ~r(t) = (t - sin(t))~i + (1 + cos(t))~j, state evidence supporting and also explain how conclusive or inconclusive the evidence is.

you must use matlab or octave program. others are not allowed T.T. please use only above the two program to get solution.

Problem 3: The Inverse Transformation Method A general method for simulating a RV having a continuous distribution called the inverse transformation method is based on the following result (see also Section 10.2 of the textbook and Quiz 2) Proposition 2.1. The Inverse Transformation Method). L UN U(0,1). For any continuous et distribution function F, X F-1(U) has distribution function F. (F-1(ar) is defined to equal that value y for which F(y) r.) In order to simulate X n Exp(1), for example, generate an U U(0,1) and let X log(1 -U) (see Quiz 2(c)). In fact, X log(U) is also Exp(1), since 1 U (0,1). Since X Exp(A) if X Exp(1) (why?), it follows that log(U)A has an Exp(1) distribution. This can be easily illustrated in Octave xi -log Grand (100,1)); 100 random samples from Exp (1) x2 -log (rand (100, 1))/2; 100 random samples from Exp(2) x3 -log Grand (100, 1))*2; 100 random samples from Exp(0.5) [mean (x1) mean(x2) mean (x3)] check their mean values In addition, Y X Gamma(n, A) if X Xn are i.i.d. Exp(A). Therefore, if Un are i.i.d. U(0, 1), log (Ui) 1 log Ui Gamma(n, A) (1) i-1 i-1 (a) Write an Octave code to generate 100 random samples from Gamma(10, A) by using the inverse transformation method (1). Let A 0.5, 1, 2. Plot histograms for the Gamma random samples. Octave also has a built-in gamma RV generator gamrnd (google it for reference!). Generate 100 random samples of Gamma(10, A) using gamrnd, make histograms, and compare two results. (b) As a function of U U(0, 1), create a new RV W with CDF F(w) 1 e-ti (w 0). (This is Quiz 2 (b).) Write an Octave code to generate 100 random samples of W F using the inverse transformation method (c) Consider a method for generating Weibull(a,B) RVs that have the following CDF F(z) exp(-ar 0 z oo, a Note that W in (b) is in fact Weibull(1,2). Write an Octave function myweibrnd.m that will generate n random samples for given parameters a and B. It should have the following format function CRJ myweibrnd n, alpha, beta) this function receives sample size n and parameters alpha and beta as input arguments and return R Ca vector of n random samples) (put your code here) Using your myweibrnd function, generate 1000 simulated values when (i) (a, B) (1,2) and (ii) (a,B) (2,1), respectively. Plot histograms and estimate their mean and variance

Show transcribed image text Problem 3: The Inverse Transformation Method A general method for simulating a RV having a continuous distribution called the inverse transformation method is based on the following result (see also Section 10.2 of the textbook and Quiz 2) Proposition 2.1. The Inverse Transformation Method). L UN U(0,1). For any continuous et distribution function F, X F-1(U) has distribution function F. (F-1(ar) is defined to equal that value y for which F(y) r.) In order to simulate X n Exp(1), for example, generate an U U(0,1) and let X log(1 -U) (see Quiz 2(c)). In fact, X log(U) is also Exp(1), since 1 U (0,1). Since X Exp(A) if X Exp(1) (why?), it follows that log(U)A has an Exp(1) distribution. This can be easily illustrated in Octave xi -log Grand (100,1)); 100 random samples from Exp (1) x2 -log (rand (100, 1))/2; 100 random samples from Exp(2) x3 -log Grand (100, 1))*2; 100 random samples from Exp(0.5) [mean (x1) mean(x2) mean (x3)] check their mean values In addition, Y X Gamma(n, A) if X Xn are i.i.d. Exp(A). Therefore, if Un are i.i.d. U(0, 1), log (Ui) 1 log Ui Gamma(n, A) (1) i-1 i-1 (a) Write an Octave code to generate 100 random samples from Gamma(10, A) by using the inverse transformation method (1). Let A 0.5, 1, 2. Plot histograms for the Gamma random samples. Octave also has a built-in gamma RV generator gamrnd (google it for reference!). Generate 100 random samples of Gamma(10, A) using gamrnd, make histograms, and compare two results. (b) As a function of U U(0, 1), create a new RV W with CDF F(w) 1 e-ti (w 0). (This is Quiz 2 (b).) Write an Octave code to generate 100 random samples of W F using the inverse transformation method (c) Consider a method for generating Weibull(a,B) RVs that have the following CDF F(z) exp(-ar 0 z oo, a Note that W in (b) is in fact Weibull(1,2). Write an Octave function myweibrnd.m that will generate n random samples for given parameters a and B. It should have the following format function CRJ myweibrnd n, alpha, beta) this function receives sample size n and parameters alpha and beta as input arguments and return R Ca vector of n random samples) (put your code here) Using your myweibrnd function, generate 1000 simulated values when (i) (a, B) (1,2) and (ii) (a,B) (2,1), respectively. Plot histograms and estimate their mean and variance

burgundywhale451