MAE 107 Homework 8 Solutions
|
|
- Meredith Lamb
- 5 years ago
- Views:
Transcription
1 MAE 107 Homework 8 Solutions 1. Newton s method to solve 3exp( x) = 2x starting at x 0 = 11. With chosen f(x), indicate x n, f(x n ), and f (x n ) at each step stopping at the first n such that f(x n ) Start with f(x) of the form f(x) = 3exp( x) 2x Setting f(x) = 0, Newton s method may be implemented on f(x) to obtain the roots of the function. x 0 = 11 f(x 0 ) = f (x 0 ) = n = 1 x 1 = x 0 f(x 0) f (x 0 ) = f(x 1 ) = f (x 1 ) = n = 2 x 2 = x 1 f(x 1) f (x 1 ) = f(x 2 ) = f (x 2 ) = n = 3 x 3 = x 2 f(x 2) f (x 2 ) = f(x 3 ) = f (x 3 ) = n = 4 x 4 = x 3 f(x 3) f (x 3 ) = f(x 4 ) = f (x 4 ) =
2 n = 5 x 5 = x 4 f(x 4) f (x 4 ) = f(x 5 ) = < f (x 5 ) = Therefore, x 5 = is a close enough approximation to solve the initial equation within a tolerance of Given the equation E e sin(e) M = 0, for angle E given M [0, 2π) with e as a known parameter. Supposing e (0, 0.25) and initial E 0 = M with understanding that sin(e) 1, what is the worst case error for E 0? Given the form of the equation, the left hand side will represent the error, meaning any value that the left hand side yields which is not zero is an error term. Taking the absolute value, the error can be expressed as e 0 = E 0 e sin(e 0 ) M e 0 = e sin(e 0 ), E 0 = M e 0 e (1) e 0 e < 0.25 e max 0 = 0.25 Where e is a known parameter in (0, 0.25). Errors for Newton s method for solution of f(e) 0 satisfy the relation e k+1 ˆKe 2 k where ˆK = max ζ,η f (ζ) 2f (η) Obtain a tight bound for ˆK for this problem then use that to obtain a bound for the errors in the second step and in the third step of some Newton s method iteration. How many steps would be required to obtain an estiamte with an error no greater than 10 7? Based on that, how many trigonometric function evaluations would be necessary in that Newton s method iteration? 2
3 f(e) = E e sin(e) M f (E) = 1 e cos(e) f (E) = e sin(e) ˆK = max f (ζ) ζ,η 2f (η) = max ζ f (ζ) 2 max η f (η) = e, e (0, 0.25) 2 1 e ˆK (0.75) 1 6 So, with a ˆK 1 6, a bound of the error at the first step can be approximated which can be used to bound the error at the second step and so on. Using the maximum error with the initial e 1 ˆK e e e 2 ˆK e e 2 = e 3 ˆK e ( ) 2 e < 10 7 So, the third step will yield an approximation which will have an associated error less than So, at n = 3, a total of 6 trigonometric evaluations would be required, because for each step f(x n ) and f (x n ) will both be computed with a sin evaluation for f(x n ) and a cos evaluation forf (x n ). Two evaluations at step 0 to obtain an approximation for x 1, two more evaluations at step 1 to obtain an approximation for x 2, and two final evaluations at step 2 to obtain an approximation for x 3 which is known to satisfy the error criterion. A simple MATLAB script given by MAE HW 8 P 2.m might be used to assist in this analysis. 1 %% 2 % MAE107 Homework 8 Problem 2 3 % O b j e c t i v e : Determine the number o f s t e p s r e q u i r e d to s a t i s f y some 4 % guaranteed e r r o r f o r Newton s Method 5 % 3
4 6 % Input V a r i a b l e s : None 7 % 8 % Output V a r i a b l e s : None 9 % 10 % Functions Called : None 11 % 12 %% 13 % Define bounded K hat and e0 terms 14 K hat = 1 / 6 ; 15 e0 = ; 16 % Define e p s i l o n value 17 eps = 1E 7; 18 % Print i n i t i a l e r r o r 19 f p r i n t f ( e 0 = %.12 f \n, e0 ) ; 20 % Begin i t e r a t i o n count 21 n = 1 ; 22 % Perform while loop to determine e r r o r bound per s t e p 23 while e0 > eps 24 % Determine new e r r o r 25 en = K hat e0 ˆ 2 ; 26 % Print e r r o r at s t e p 27 f p r i n t f ( e %i = %.12 f \n, [ n en ] ) ; 28 % Update v a l u e s 29 e0 = en ; 30 n = n+1; 31 end 32 % Take away the e x t r a count on n 33 n = n 1; The console output is the following: e 0 = e 1 = e 2 = e 3 = For this problem, three scripts will be utilized, MAE HW 8 P 3.m, secant method.m, and noideatwo.m. 1 f u n c t i o n [ x, y ] = secant method ( x0, x1, f, eps, nmax) 2 % O b j e c t i v e : Perform s e c a n t method i t e r a t i o n f o r some f u n c t i o n 3 % d e f i n e d by the handle f u n t i l some e p s i l o n i s s a t i s f i e d 4 % or some maximum number o f i t e r a t i o n s i s reached. 5 % 6 % Input V a r i a b l e s : x0 and x1 : I n i t i a l v a l u e s f o r r o o t e s t i m a t i o n 7 % f : Function handle f o r e v a l u a t i o n o f p o i n t s 8 % eps : Error c r i t e r i o n value 9 % nmax : Maximum number o f i t e r a t i o n s b e f o r e stop 10 % 11 % Output V a r i a b l e s : x : Output v e c t o r o f approximate r o o t p o i n t s 12 % y : Output v e c t o r o f point e v a l u a t i o n s, f ( x ) 13 % 14 % Functions Called : f : Function f o r which r o o t i s estimated by 15 % s e c a n t method 4
5 16 % 17 % Default i t e r a t i o n count / e r r o r t o l e r a n c e 18 i f nargin < 5 19 nmax = ; 20 i f nargin < 4 21 eps = 1e 6; 22 end 23 end % P r e a l l o c a t i o n 26 x = z e r o s ( 1, nmax) ; 27 y = z e r o s ( 1, nmax) ; 28 % I n i t i a l i z a t i o n 29 x ( 1 ) = x0 ; 30 x ( 2 ) = x1 ; 31 y ( 1 ) = f ( x0 ) ; 32 y ( 2 ) = f ( x1 ) ; 33 % Secant Method Loop 34 i = 3 ; 35 e r r o r = abs ( y ( 2 ) ) ; 36 while e r r o r > eps && i < nmax % Two c o n d i t i o n a l a r g s f o r eps and nmax 37 % Find c u r r e n t x 38 x ( i ) = x ( i 1) y ( i 1) ( x ( i 1) x ( i 2) ) /( y ( i 1) y ( i 2) ) ; 39 % Evaluate c u r r e n t y 40 y ( i ) = f ( x ( i ) ) ; 41 e r r o r = abs ( y ( i ) ) ; 42 i = i + 1 ; 43 end 44 % Truncate v e c t o r s o f e x t r a z e r o s 45 x = x ( 1 : i 1) ; 46 y = y ( 1 : i 1) ; 47 end 1 f u n c t i o n [ f ] = noideatwo ( x ) 2 % O b j e c t i v e : Function d e s c r i p t i o n f o r problem 3 o f homework 8 3 % 4 % Input V a r i a b l e s : x : Point o f e v a l u a t i o n 5 % 6 % Output V a r i a b l e s : y : Function e v a l u a t i o n 7 % 8 % Functions Called : None 9 c1 = x ; 10 f o r i 1 = 1 : 3 11 c1 = cos ( c1 )+x+3; 12 end 13 f=c1 ; 14 end 1 %% 2 % MAE107 Homework 8 Problem 3 S c r i p t 3 % 4 % O b j e c t i v e : Use s e c a n t method to approximate the r o o t o f some 5 % f u n c t i o n d e f i n e d by noideatwo.m 6 % 7 % Input V a r i a b l e s : None 8 % 9 % Output V a r i a b l e s : None 5
6 10 % 11 % Functions Called : noideatwo.m: Given f u n c t i o n d e s c r i p t i o n f o r r o o t 12 % approximation 13 % secant method.m: G e n e r a l i z e d Secant Method S c r i p t 14 % 15 %% 16 %%%%%%%%%%%%%%% 17 c l e a r a l l ; 18 c l o s e a l l ; 19 % Define I n i t i a l x v a l u e s 20 x0 = 1 ; 21 x1 = 3 ; 22 % Define noideatwo f u n c t i o n handle 23 f ; 24 % Define Epsilon 25 eps = 1E 10; 26 % Define some maximum number o f i t e r a t i o n s i n c a s e i t can t s a t i s f y e p s i l o n 27 nmax = ; 28 [ x, y ] = secant method ( x0, x1, f, eps, nmax) ; 29 e r r o r = abs ( y ( end ) ) ; 30 % Print r e s u l t s 31 f o r i = 1 : l e n g t h ( x ) 32 k=i 1; 33 f p r i n t f ( x %i = %.12 f and, [ k x ( i ) ] ) ; % Print x e s t i m a t e s 34 f p r i n t f ( f ( x %i ) = %.12 f \n, [ k y ( i ) ] ) ; % Print f ( x ) e v a l u a t i o n s 35 end The console output is the following: x 0 = and f(x 0) = x 1 = and f(x 1) = x 2 = and f(x 2) = x 3 = and f(x 3) = x 4 = and f(x 4) = x 5 = and f(x 5) = x 6 = and f(x 6) = x 7 = and f(x 7) = x 8 = and f(x 8) = x 9 = and f(x 9) = Consider attempting to solve tan(3x) = 2x via the fixed point method. A form under which the method is guaranteed to converge would be x = 1 3 atan(2x ). This can be proven by taking the first derivative and bounding its absolute value under 1. 6
7 x = g(x) g(x) = 1 3 atan(2x ) g 8 (x) = 48x x + 15 g (x) < 1, x R The form of g(x) is continuously differentiable, so a γ to define the convergence rate could be directly computed. max x R g (x) = γ < 1 x = 1 ( 4, g 1 ) = γ = 2 3 This result shows that the fixed point α is unique, the iteration x n+1 = g(x n ) converges to α for any guess x 0 R, and the error estimate becomes α x n γn 1 γ x 1 x 0 ( ) 2 n α x n 3 x 1 x 0 3 Finally, the following limit also holds α x n+1 lim n inf α x n = g (α) Then, there is one other form to consider, so let x = 1 2 tan(3x) 1 4 which will not guarantee convergence. be the alternative form x = h(x) h(x) = 1 2 tan(3x) 1 4 g (x) = 3 2 sec2 (3x) g (x) > 1, x R 7
8 So, for any interval [a, b] which exists such that h(x) [a, b], there is no constant γ which would guarantee h (x) γ < 1. Therefore, h(x) does not satisfy the fixed-point theorem for the convergence of sequence x n+1 = h(x n ) to some unique fixed point α [a, b]. 5. For this problem, two scripts will be used, MAE HW 8 P 5.m and fp method.m. For analysis, a maximum of 100 iterations will be allowed for either form, and a satisfactory epsilon will be given by ɛ = f u n c t i o n [ x, n ] = fp method ( x0, f, nmax, eps ) 2 % O b j e c t i v e : Use f i x e d point method to obtain a convergence point 3 % based on the i t e r a t i o n x n = f ( x n 1) 4 % 5 % Input V a r i a b l e s : x0 : I n i t i a l point o f i t e r a t i o n 6 % f : Function handle f o r f i x e d point i t e r a t i o n 7 % nmax : Maximum number o f i t e r a t i o n s 8 % eps : Error c r i t e r i o n 9 % 10 % Output V a r i a b l e s : x : Fixed point convergence value 11 % n : I t e r a t i o n s t e p f o r convergence 12 % 13 % Functions Called : f : Right hand s i d e f u n c t i o n f o r f i x e d point 14 % i t e r a t i o n 15 %% 16 % Set d e f a u l t v a l u e s i f input arguments not f u l l 17 i f nargin < 4 18 eps = 1e 10; 19 i f nargin < 3 20 nmax = ; 21 end 22 end 23 % I n i t i a l i z e v a l u e s f o r loop 24 n = 1 ; 25 x = f ( x0 ) ; 26 e = abs ( x x0 ) ; 27 % Begin loop with e x i t c o n d i t i o n s given by eps and nmax 28 while max( e ) > eps && n < nmax 29 % Obtain new point 30 x = f ( x0 ) ; 31 % Determine new e r r o r 32 e = abs ( x x0 ) ; 33 % Update v a l u e s f o r next s t e p 34 x0 = x ; 35 n = n+1; 36 end 1 %% 2 % MAE 107 Homework 8 Problem 5 3 % 4 % O b j e c t i v e : Use Fixed Point method to f i n d convergene point with 5 % two d i f f e r e n t forms o f equation 6 % 7 % Input V a r i a b l e s : None 8 % 9 % Output V a r i a b l e s : None 10 % 11 % Functions C a l l e d : None ( See Anonymous Functions Defined i n Code ) 8
9 12 % 13 %% 14 % Define i n i t i a l guess v e c t o r 15 x0 = [ 0 ; 2; ] ; 16 % Convenient to d e f i n e two anonymous f u n c t i o n s f o r e a s i e r argument p a s s i n g 17 g x ) (1/3) atan (2 x+(1/2) ) ; % Form 1 : Expect convergence 18 h x ) (1/2) tan (3 x ) (1/4) ; % Form 2 : Do not expect convergence 19 % Define two p o t e n t i a l t h r e s h o l d s f o r h a l t i n g f i x e d point i t e r a t i o n 20 eps = 1e 7; % Absolute e r r o r between two i t e r a t i o n s 21 nmax = ; % Maximum Number o f I t e r a t i o n s 22 % P r e a l l o c a t e v e c t o r s f o r l o o p i n g over x0 v e c t o r 23 x gvec = z e r o s ( l e n g t h ( x0 ), 1 ) ; % Point o f convergence f o r form g 24 x hvec = z e r o s ( l e n g t h ( x0 ), 1 ) ; % Point o f convergence f o r form h 25 n g = z e r o s ( l e n g t h ( x0 ), 1 ) ; % Number o f i t e r a t i o n s f o r form g 26 n h = z e r o s ( l e n g t h ( x0 ), 1 ) ; % Number o f i t e r a t i o n s f o r form h 27 f o r i = 1 : l e n g t h ( x0 ) 28 % Fixed Point I t e r a t i o n f o r form g 29 [ x gvec ( i ), n g ( i ) ] = fp method ( x0 ( i ), g, nmax, eps ) ; 30 % Print R e s u l t s 31 f p r i n t f ( %i i t e r a t i o n s f o r g to attempt, n g ( i ) ) ; 32 f p r i n t f ( convergence to %.8 f, x gvec ( i ) ) ; 33 f p r i n t f ( using i n i t i a l guess %.0 f \n, x0 ( i ) ) ; 34 % Fixed Point I t e r a t i o n f o r form h 35 [ x hvec ( i ), n h ( i ) ] = fp method ( x0 ( i ), h, nmax, eps ) ; 36 % Print R e s u l t s 37 f p r i n t f ( %i i t e r a t i o n s f o r h to attempt, n h ( i ) ) ; 38 f p r i n t f ( convergence to %.8 f, x hvec ( i ) ) ; 39 f p r i n t f ( using i n i t i a l guess %.0 f \n, x0 ( i ) ) ; 40 end The console output is the following: 16 iterations for g to attempt convergence to using initial guess iterations for h to attempt convergence to using initial guess 0 18 iterations for g to attempt convergence to using initial guess iterations for h to attempt convergence to using initial guess iterations for g to attempt convergence to using initial guess iterations for h to attempt convergence to using initial guess 1000 f(x) x 0 n α ɛ n max g(x) g(x) g(x) h(x) h(x) h(x) So, it would appear that g(x) converged reasonably well for all initial guesses, however h(x) required the maximum number of iterations and showed no consistency in converging to some fixed point α. 9
10 6. For this problem, two scripts will be used, MAE HW 8 P 6.m and fp method.m. First, x 7 is determined using a two equation, two unknown fixed point iteration. Then, ˆKk is determined for each step in k [1, 2,...6] and is used to estimate what x 15 x 14 will be. This estimate is then compared to the actual value of x 15 x f u n c t i o n [ x, n ] = fp method ( x0, f, nmax, eps ) 2 % O b j e c t i v e : Use f i x e d point method to obtain a convergence point 3 % based on the i t e r a t i o n x n = f ( x n 1) 4 % 5 % Input V a r i a b l e s : x0 : I n i t i a l point o f i t e r a t i o n 6 % f : Function handle f o r f i x e d point i t e r a t i o n 7 % nmax : Maximum number o f i t e r a t i o n s 8 % eps : Error c r i t e r i o n 9 % 10 % Output V a r i a b l e s : x : Fixed point convergence value 11 % n : I t e r a t i o n s t e p f o r convergence 12 % 13 % Functions Called : f : Right hand s i d e f u n c t i o n f o r f i x e d point 14 % i t e r a t i o n 15 %% 16 % Set d e f a u l t v a l u e s i f input arguments not f u l l 17 i f nargin < 4 18 eps = 1e 10; 19 i f nargin < 3 20 nmax = ; 21 end 22 end 23 % I n i t i a l i z e v a l u e s f o r loop 24 n = 1 ; 25 x = f ( x0 ) ; 26 e = abs ( x x0 ) ; 27 % Begin loop with e x i t c o n d i t i o n s given by eps and nmax 28 while max( e ) > eps && n < nmax 29 % Obtain new point 30 x = f ( x0 ) ; 31 % Determine new e r r o r 32 e = abs ( x x0 ) ; 33 % Update v a l u e s f o r next s t e p 34 x0 = x ; 35 n = n+1; 36 end 1 %% 2 % MAE 107 Homework 8 Problem 6 3 % 4 % O b j e c t i v e : Determine s o l u t i o n to a s e t o f e q u a t i o n s using f i x e d 5 % point method then use the e s t i m a t e o f K hat to e s t i m a t e 6 % the Euclidean norm o f the d i f f e r e n c e in the v e c t o r s 7 % between the 14 th and the 15 th i t e r a t i o n s 8 % 9 % Input V a r i a b l e s : None 10 % 11 % Ouput V a r i a b l e s : None 12 % 13 % Functions Called : fpmethod.m: G e n e r a l i z e d Fixed Point method to allow f o r 14 % n e q u a t i o n s and n uknowns 10
11 15 % 16 % ( See l o c a l f u n c t i o n s d e f i n e d below main loop 17 % 18 %% 19 c l e a r a l l ; 20 c l o s e a l l ; 21 % Define I n i t i a l Conditions 22 x0 = [ 0 ; 0 ] ; 23 % Define Function Handle 24 h p6 ; 25 % Define Epsilon Error C r i t e r i o n 26 eps = 1e 10; 27 % Define Step Number f o r determining K hat v e c t o r 28 n = 7 ; 29 % P r e a l l o c a t e v e c t o r s / i n i t i a l i z e 30 xk = z e r o s ( l e n g t h ( x0 ), n+1) ; 31 xk ( :, 1 ) = x0 ; 32 K t i l d e k = z e r o s (n 1,1) ; 33 num = z e r o s ( 2, n 1) ; 34 euc num = z e r o s (n 1,1) ; 35 den= z e r o s ( 2, n 1) ; 36 euc den = z e r o s (n 1,1) ; 37 % Begin Loop f o r b u i l d i n g v e c t o r o f xk going to s t e p f o r i = 1 : xk ( :, i +1) = fp method ( xk ( :, i ), h, 1, eps ) ; 40 end 41 % Print e s t i m a t e f o r x 7 42 f p r i n t f ( x 7 = \n%.12 f \n%.12 f \n\n, xk ( :, 8 ) ) ; 43 % Begin Loop f o r Determining K hat using the f i r s t 7 i t e r a t i o n s 44 f o r k = 2 : n 45 num ( :, k 1) = xk ( :, k+1) xk ( :, k ) ; % Numerator term 46 euc num ( k 1) = euc norm (num ( :, k 1) ) ; %Euclidean norm o f numerator 47 den ( :, k 1) = xk ( :, k ) xk ( :, k 1) ; % Denominator term 48 euc den ( k 1) = euc norm ( den ( :, k 1) ) ; % Euclidean norm o f denominator 49 K t i l d e k ( k 1) = euc num ( k 1)/ euc den ( k 1) ; % K hat k e v a l u a t i o n 50 f p r i n t f ( K t i l d e %i = %.12 f \n, [ k 1 K t i l d e k ( k 1) ] ) ; % Print r e s u l t s 51 end 52 % Estimate the Euclidean norm d i f f e r e n c e at s t e p % Since f u n c t i o n i s assumed L i p s c h i t z continuous, i t i s assumed t h e r e 54 % e x i s t s some cosntant L < 1 such that x n+1 x n <= L x n x n % From K hat k, a l o w e r bound approximation f o r L can be taken by the 56 % maximum value o f K hat k 57 % 58 L = max( K t i l d e k ) ; 59 L = K t i l d e k ( 5 ) ; 60 % Print what our L i p s c h i t z constant approximation w i l l be 61 f p r i n t f ( \ nwill use L = %.12 f to e s t i m a t e x 15 x 14 \ n,l) ; 62 % 63 % Now compute x 15 x 14 = Lˆ8 x 7 x 6 64 e u c n o r m 1 5 e s t = Lˆ(15 n ) euc num (n 1) ; 65 % Obtain the a c t u a l Euclidean norm d i f f e r e n c e at s t e p euc norm 15 = euc norm ( xk ( :, 1 6 ) xk ( :, 1 5 ) ) ; 67 % Print r e s u l t s 68 f p r i n t f ( The estimated value o f x 15 x 14 = %.16 f \n, e u c n o r m 1 5 e s t ) ; 69 f p r i n t f ( The a c t u a l value o f x 15 x 14 = %.16 f \n, euc norm 15 ) ; 70 %% 11
12 71 % n v a r i a b l e n equation f u n c t i o n 72 f u n c t i o n [ f ] = f p 6 ( x ) 73 % O b j e c t i v e : Set o f e q u a t i o n s d e f i n e d in problem 6 d e s c r i p t i o n f o r 74 % f i x e d point i t e r a t i o n 75 % 76 % Input V a r i a b l e s : x : Vector o f v a l u e s f o r e v a l u a t i o n 77 % 78 % Output V a r i a b l e s : f : Vector o f f u n c t i o n e v a l u a t i o n s 79 % 80 % Functions Called : None 81 % 82 f = z e r o s ( l e n g t h ( x ), 1 ) ; 83 i f l e n g t h ( f ) = 2 84 e r r o r ( Function e x p e c t s an input v e c t o r o f l e n g t h 2, but i t ) ; 85 e r r o r ( r e c e i v e d a v e c t o r o f some other l e n g t h ) ; 86 end 87 f ( 1 ) = 0. 5 atan ( x ( 1 )+x ( 2 ) ) + 7 ; 88 f ( 2 ) = s i n ( x ( 1 ) x ( 2 ) ) /(2 exp(1+x ( 2 ) ˆ2) ) ; 89 end % Euclidean Norm Function 92 f u n c t i o n [ norm ] = euc norm ( x ) 93 % O b j e c t i v e : Obtain the Euclidean norm o f an input v e c t o r 94 % 95 % Input V a r i a b l e s : x : Input v e c t o r 96 % 97 % Output V a r i a b l e s : norm : Euclidean norm value o f input v e c t o r 98 % 99 % Functions Called : None 100 % 101 % Define a sum o f square v a l u e s 102 sq sum = 0 ; 103 % Begin loop to sum the square v a l u e s 104 f o r i = 1 : l e n g t h ( x ) 105 sq sum = sq sum + x ( i ) ˆ 2 ; 106 end 107 % Take the square r o o t o f the sum 108 norm = s q r t ( sq sum ) ; 109 end The console output is the following: x 7 = K tilde 1 = K tilde 2 = K tilde 3 = K tilde 4 = K tilde 5 = K tilde 6 = Will use L = to estimate x 15-x 14 12
13 The estimated value of x 15-x 14 = The actual value of x 15-x 14 = There are, of course, multiple ways to utilize K k to obtain an estimate x 15 x 14. For example, one could use the final value obtained from the K k values. Using K 6 will yield an estimate that is around This ends up being a bit closer to the actual result than using the maximum K k value, because using the maximum will provide a more conservative estimate. Using K 5 will yield a result that is around which is now slightly below the actual result. Any estimate between and would be a reasonable approximation in this case. 7. Lagrange interpolation for second-order polynomial through (x 0, y 0 ) = (1, 4), (x 1, y 1 ) = (3, 2), and (x 2, y 2 ) = (7, 8). Reduce solution to form y = c 0 + c 1 x + c 2 x 2. P (x) = 2 Pj 2 (x) j=0 Pj 2 (x) = y j L 2 j(x) 2 L 2 x x k j(x) = x j x k k=0,k j P (x) = P 2 0 (x) + P 2 1 (x) + P 2 2 (x) P (x) = y 0 L 2 0(x) + y 1 L 2 1(x) + y 2 L 2 2(x) [( ) ( )] [( ) ( x x1 x x2 x x0 x x2 P (x) = y 0 + y 1 x 0 x 1 x 0 x 2 x 1 x 0 x 1 x 2 [( ) ( )] [( ) ( )] x 3 x 7 x 1 x 7 P (x) = ( 1 P (x) = 4 12 x2 5 6 x + 21 ) ( x2 + x 7 ) 8 8 P (x) = 1 3 x x x2 + 2x x x 1 P (x) = 1 4 x )] [( x x0 + y 2 x 2 x 0 ) ( )] x 3 [( x ( 1 24 x2 1 6 x ) ) ( )] x x1 x 2 x 1 Where c 0 = 17 4, c 1 = 0, and c 2 =
MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations.
MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of f(x) = 0, their advantages and disadvantages. Convergence
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationMath 551 Homework Assignment 3 Page 1 of 6
Math 551 Homework Assignment 3 Page 1 of 6 Name and section: ID number: E-mail: 1. Consider Newton s method for finding + α with α > 0 by finding the positive root of f(x) = x 2 α = 0. Assuming that x
More informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationMATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N.
MATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of F (x) = 0, their advantages and disadvantages.
More informationMath Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, Due: Thursday, January 27,
Math 371 - Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, 2011. Due: Thursday, January 27, 2011.. Include a cover page. You do not need to hand in a problem sheet.
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationROOT FINDING REVIEW MICHELLE FENG
ROOT FINDING REVIEW MICHELLE FENG 1.1. Bisection Method. 1. Root Finding Methods (1) Very naive approach based on the Intermediate Value Theorem (2) You need to be looking in an interval with only one
More informationOutline. Additional Nonlinear Systems. Abstract. Finding Equilibrium Points Numerically. Newton s Method
Outline Finding Equilibrium Points Numerically Additional Nonlinear Systems James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University June 13, 2017
More information3.1: 1, 3, 5, 9, 10, 12, 14, 18
3.:, 3, 5, 9,,, 4, 8 ) We want to solve d d c() d = f() with c() = c = constant and f() = for different boundary conditions to get w() and u(). dw d = dw d d = ( )d w() w() = w() = w() ( ) c d d = u()
More informationOutline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationTHE SECANT METHOD. q(x) = a 0 + a 1 x. with
THE SECANT METHOD Newton s method was based on using the line tangent to the curve of y = f (x), with the point of tangency (x 0, f (x 0 )). When x 0 α, the graph of the tangent line is approximately the
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationThis Week. Professor Christopher Hoffman Math 124
This Week Sections 2.1-2.3,2.5,2.6 First homework due Tuesday night at 11:30 p.m. Average and instantaneous velocity worksheet Tuesday available at http://www.math.washington.edu/ m124/ (under week 2)
More informationSOLVED PROBLEMS ON TAYLOR AND MACLAURIN SERIES
SOLVED PROBLEMS ON TAYLOR AND MACLAURIN SERIES TAYLOR AND MACLAURIN SERIES Taylor Series of a function f at x = a is ( f k )( a) ( x a) k k! It is a Power Series centered at a. Maclaurin Series of a function
More informationNumerical Analysis Fall. Roots: Open Methods
Numerical Analysis 2015 Fall Roots: Open Methods Open Methods Open methods differ from bracketing methods, in that they require only a single starting value or two starting values that do not necessarily
More informationTangent Lines Sec. 2.1, 2.7, & 2.8 (continued)
Tangent Lines Sec. 2.1, 2.7, & 2.8 (continued) Prove this Result How Can a Derivative Not Exist? Remember that the derivative at a point (or slope of a tangent line) is a LIMIT, so it doesn t exist whenever
More informationComputational Methods. Solving Equations
Computational Methods Solving Equations Manfred Huber 2010 1 Solving Equations Solving scalar equations is an elemental task that arises in a wide range of applications Corresponds to finding parameters
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationNumerical Methods I Solving Nonlinear Equations
Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)
More informationCHAPTER 3 DIFFERENTIATION
CHAPTER 3 DIFFERENTIATION 3.1 THE DERIVATIVE AND THE TANGENT LINE PROBLEM You will be able to: - Find the slope of the tangent line to a curve at a point - Use the limit definition to find the derivative
More informationMAE 107 Homework 7 Solutions
MAE 107 Homework 7 Solutions 1. Tridiagonal system for u xx (x) + u(x) = 1 + sin(πx/4), for x [0, ], where u(0) =, u() = 4, with step size h = 1/. The total number of segments are: n = 0 1/ =. The nodes
More information10.7 Trigonometric Equations and Inequalities
0.7 Trigonometric Equations and Inequalities 79 0.7 Trigonometric Equations and Inequalities In Sections 0., 0. and most recently 0., we solved some basic equations involving the trigonometric functions.
More informationINTRODUCTION TO COMPUTATIONAL MATHEMATICS
INTRODUCTION TO COMPUTATIONAL MATHEMATICS Course Notes for CM 271 / AMATH 341 / CS 371 Fall 2007 Instructor: Prof. Justin Wan School of Computer Science University of Waterloo Course notes by Prof. Hans
More informationLecture 4. Section 2.5 The Pinching Theorem Section 2.6 Two Basic Properties of Continuity. Jiwen He. Department of Mathematics, University of Houston
Review Pinching Theorem Two Basic Properties Lecture 4 Section 2.5 The Pinching Theorem Section 2.6 Two Basic Properties of Continuity Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu
More informationOutline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations
Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationExtended Introduction to Computer Science CS1001.py. Lecture 8 part A: Finding Zeroes of Real Functions: Newton Raphson Iteration
Extended Introduction to Computer Science CS1001.py Lecture 8 part A: Finding Zeroes of Real Functions: Newton Raphson Iteration Instructors: Benny Chor, Amir Rubinstein Teaching Assistants: Yael Baran,
More informationNonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Nonlinear Systems 1 / 24 Part III: Nonlinear Problems Not all numerical problems
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationMA 8019: Numerical Analysis I Solution of Nonlinear Equations
MA 8019: Numerical Analysis I Solution of Nonlinear Equations Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw
More informationTHE LIMIT PROCESS (AN INTUITIVE INTRODUCTION)
The Limit Process THE LIMIT PROCESS (AN INTUITIVE INTRODUCTION) We could begin by saying that limits are important in calculus, but that would be a major understatement. Without limits, calculus would
More informationFormulas to remember
Complex numbers Let z = x + iy be a complex number The conjugate z = x iy Formulas to remember The real part Re(z) = x = z+z The imaginary part Im(z) = y = z z i The norm z = zz = x + y The reciprocal
More informationChapter 1. Root Finding Methods. 1.1 Bisection method
Chapter 1 Root Finding Methods We begin by considering numerical solutions to the problem f(x) = 0 (1.1) Although the problem above is simple to state it is not always easy to solve analytically. This
More informationVariable. Peter W. White Fall 2018 / Numerical Analysis. Department of Mathematics Tarleton State University
Newton s Iterative s Peter W. White white@tarleton.edu Department of Mathematics Tarleton State University Fall 2018 / Numerical Analysis Overview Newton s Iterative s Newton s Iterative s Newton s Iterative
More information1 The best of all possible worlds
Notes for 2017-03-18 1 The best of all possible worlds Last time, we discussed three methods of solving f(x) = 0: Newton, modified Newton, and bisection. Newton is potentially faster than bisection; bisection
More informationSection 4.1 The Power Method
Section 4.1 The Power Method Key terms Dominant eigenvalue Eigenpair Infinity norm and 2-norm Power Method Scaled Power Method Power Method for symmetric matrices The notation used varies a bit from that
More informationRoot Finding Convergence Analysis
Root Finding Convergence Analysis Justin Ross & Matthew Kwitowski November 5, 2012 There are many different ways to calculate the root of a function. Some methods are direct and can be done by simply solving
More informationNumerical Optimization
Unconstrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 01, India. NPTEL Course on Unconstrained Minimization Let f : R n R. Consider the optimization problem:
More informationAP Calculus Summer Prep
AP Calculus Summer Prep Topics from Algebra and Pre-Calculus (Solutions are on the Answer Key on the Last Pages) The purpose of this packet is to give you a review of basic skills. You are asked to have
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationCS 450 Numerical Analysis. Chapter 5: Nonlinear Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationCLASS NOTES Models, Algorithms and Data: Introduction to computing 2018
CLASS NOTES Models, Algorithms and Data: Introduction to computing 2018 Petros Koumoutsakos, Jens Honore Walther (Last update: April 16, 2018) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T Heath Chapter 5 Nonlinear Equations Copyright c 2001 Reproduction permitted only for noncommercial, educational
More informationMA 137: Calculus I for the Life Sciences
MA 137: Calculus I for the Life Sciences David Murrugarra Department of Mathematics, University of Kentucky http://www.ms.uky.edu/~ma137/ Spring 2018 David Murrugarra (University of Kentucky) MA 137: Lecture
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationCS412: Introduction to Numerical Methods
CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,
More informationChapter 2: Functions, Limits and Continuity
Chapter 2: Functions, Limits and Continuity Functions Limits Continuity Chapter 2: Functions, Limits and Continuity 1 Functions Functions are the major tools for describing the real world in mathematical
More informationSolution of Algebric & Transcendental Equations
Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection
More informationNumerical Solution of f(x) = 0
Numerical Solution of f(x) = 0 Gerald W. Recktenwald Department of Mechanical Engineering Portland State University gerry@pdx.edu ME 350: Finding roots of f(x) = 0 Overview Topics covered in these slides
More informationHomework 2. Matthew Jin. April 10, 2014
Homework Matthew Jin April 10, 014 1a) The relative error is given by ŷ y y, where ŷ represents the observed output value, and y represents the theoretical output value. In this case, the observed output
More informationJustify all your answers and write down all important steps. Unsupported answers will be disregarded.
Numerical Analysis FMN011 10058 The exam lasts 4 hours and has 13 questions. A minimum of 35 points out of the total 70 are required to get a passing grade. These points will be added to those you obtained
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.2.1, 4.2.3, 4.2.6, 4.2.8,
More informationMATH 2053 Calculus I Review for the Final Exam
MATH 05 Calculus I Review for the Final Exam (x+ x) 9 x 9 1. Find the limit: lim x 0. x. Find the limit: lim x + x x (x ).. Find lim x (x 5) = L, find such that f(x) L < 0.01 whenever 0 < x
More informationNonlinear Equations and Continuous Optimization
Nonlinear Equations and Continuous Optimization Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Introduction 2 Bisection Method 3 Newton s Method 4 Systems
More informationINTRODUCTION TO NUMERICAL ANALYSIS
INTRODUCTION TO NUMERICAL ANALYSIS Cho, Hyoung Kyu Department of Nuclear Engineering Seoul National University 3. SOLVING NONLINEAR EQUATIONS 3.1 Background 3.2 Estimation of errors in numerical solutions
More informationLecture 8. Root finding II
1 Introduction Lecture 8 Root finding II In the previous lecture we considered the bisection root-bracketing algorithm. It requires only that the function be continuous and that we have a root bracketed
More informationNumerical Methods Lecture 3
Numerical Methods Lecture 3 Nonlinear Equations by Pavel Ludvík Introduction Definition (Root or zero of a function) A root (or a zero) of a function f is a solution of an equation f (x) = 0. We learn
More information10.7 Trigonometric Equations and Inequalities
0.7 Trigonometric Equations and Inequalities 857 0.7 Trigonometric Equations and Inequalities In Sections 0., 0. and most recently 0., we solved some basic equations involving the trigonometric functions.
More informationLine Search Methods for Unconstrained Optimisation
Line Search Methods for Unconstrained Optimisation Lecture 8, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Generic
More informationIntroduction to Numerical Analysis
Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes
More informationMath 1552: Integral Calculus Final Exam Study Guide, Spring 2018
Math 55: Integral Calculus Final Exam Study Guide, Spring 08 PART : Concept Review (Note: concepts may be tested on the exam in the form of true/false or short-answer questions.). Complete each statement
More informationAnnouncements. Topics: Homework: - sections 4.5 and * Read these sections and study solved examples in your textbook!
Announcements Topics: - sections 4.5 and 5.1-5.5 * Read these sections and study solved examples in your textbook! Homework: - review lecture notes thoroughly - work on practice problems from the textbook
More informationOrder of convergence
Order of convergence Linear and Quadratic Order of convergence Computing square root with Newton s Method Given a > 0, p def = a is positive root of equation Newton s Method p k+1 = p k p2 k a 2p k = 1
More informationUniversity of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta
University of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta Homework 4: Due Friday, 0/4/06, 10:00am Part I) (1) Section., Problems #3(a,d), 9, 11. () Apply
More informationf ( c ) = lim{x->c} (f(x)-f(c))/(x-c) = lim{x->c} (1/x - 1/c)/(x-c) = lim {x->c} ( (c - x)/( c x)) / (x-c) = lim {x->c} -1/( c x) = - 1 / x 2
There are 9 problems, most with multiple parts. The Derivative #1. Define f: R\{0} R by [f(x) = 1/x] Use the definition of derivative (page 1 of Differentiation notes, or Def. 4.1.1, Lebl) to find, the
More informationFormulas that must be memorized:
Formulas that must be memorized: Position, Velocity, Acceleration Speed is increasing when v(t) and a(t) have the same signs. Speed is decreasing when v(t) and a(t) have different signs. Section I: Limits
More information17 Solution of Nonlinear Systems
17 Solution of Nonlinear Systems We now discuss the solution of systems of nonlinear equations. An important ingredient will be the multivariate Taylor theorem. Theorem 17.1 Let D = {x 1, x 2,..., x m
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationMath 128A: Homework 2 Solutions
Math 128A: Homework 2 Solutions Due: June 28 1. In problems where high precision is not needed, the IEEE standard provides a specification for single precision numbers, which occupy 32 bits of storage.
More informationFigure 1: Graph of y = x cos(x)
Chapter The Solution of Nonlinear Equations f(x) = 0 In this chapter we will study methods for find the solutions of functions of single variables, ie values of x such that f(x) = 0 For example, f(x) =
More information1 Getting started Math4414 Matlab Tutorial We start by defining the arithmetic operations in matlab in the following tables Arithmetic Operations * mu
1 Getting started Math4414 Matlab Tutorial We start by defining the arithmetic operations in matlab in the following tables Arithmetic Operations * multiplication + addition - subtraction n left division
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationName Date Period. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
AB Fall Final Exam Review 200-20 Name Date Period MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the problem. ) The position of a particle
More information1 Question related to polynomials
07-08 MATH00J Lecture 6: Taylor Series Charles Li Warning: Skip the material involving the estimation of error term Reference: APEX Calculus This lecture introduced Taylor Polynomial and Taylor Series
More information3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.
3.1 Introduction Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x 3 +1.5x 1.5 =0, tan x x =0. Practical existence test for roots: by intermediate value theorem, f C[a, b] & f(a)f(b)
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More information10.7 Trigonometric Equations and Inequalities
0.7 Trigonometric Equations and Inequalities 857 0.7 Trigonometric Equations and Inequalities In Sections 0. 0. and most recently 0. we solved some basic equations involving the trigonometric functions.
More informationIf you need the source code from the sample solutions, copy and paste from the PDF should work. If you re having trouble, send me an .
AM117 Sample Solutions, HW#1 Hi, I m Andreas Kloeckner, your grader for this course. Feel free to email me at kloeckner@dam.brown.edu. The code for the sample solutions is written so that it will run in
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More informationDRAFT - Math 101 Lecture Note - Dr. Said Algarni
2 Limits 2.1 The Tangent Problems The word tangent is derived from the Latin word tangens, which means touching. A tangent line to a curve is a line that touches the curve and a secant line is a line that
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationR x n. 2 R We simplify this algebraically, obtaining 2x n x n 1 x n x n
Math 42 Homework 4. page 3, #9 This is a modification of the bisection method. Write a MATLAB function similar to bisect.m. Here, given the points P a a,f a and P b b,f b with f a f b,we compute the point
More informationHow fast can we add (or subtract) two numbers n and m?
Addition and Subtraction How fast do we add (or subtract) two numbers n and m? How fast can we add (or subtract) two numbers n and m? Definition. Let A(d) denote the maximal number of steps required to
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
More informationMath 1B, lecture 15: Taylor Series
Math B, lecture 5: Taylor Series Nathan Pflueger October 0 Introduction Taylor s theorem shows, in many cases, that the error associated with a Taylor approximation will eventually approach 0 as the degree
More informationand lim lim 6. The Squeeze Theorem
Limits (day 3) Things we ll go over today 1. Limits of the form 0 0 (continued) 2. Limits of piecewise functions 3. Limits involving absolute values 4. Limits of compositions of functions 5. Limits similar
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationFALL 2018 MATH 4211/6211 Optimization Homework 4
FALL 2018 MATH 4211/6211 Optimization Homework 4 This homework assignment is open to textbook, reference books, slides, and online resources, excluding any direct solution to the problem (such as solution
More informationLecture 5: Inverse Trigonometric Functions
Lecture 5: Inverse Trigonometric Functions 5 The inverse sine function The function f(x = sin(x is not one-to-one on (,, but is on [ π, π Moreover, f still has range [, when restricte to this interval
More informationCarefully tear this page off the rest of your exam. UNIVERSITY OF TORONTO SCARBOROUGH MATA37H3 : Calculus for Mathematical Sciences II
Carefully tear this page off the rest of your exam. UNIVERSITY OF TORONTO SCARBOROUGH MATA37H3 : Calculus for Mathematical Sciences II REFERENCE SHEET The (natural logarithm and exponential functions (
More information