1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3
|
|
- Elisabeth Williamson
- 5 years ago
- Views:
Transcription
1 Adrew Powuk - Math 49 (Numercal Aalyss) Root fdg. Itroducto f ( ),?,? Solve[^-,] {{-},{}} Plot[^-,{,-,}] Cubc equato Quartc equato Qutc equato Galos theory
2 Adrew Powuk - Math 49 (Numercal Aalyss) Solve[^-+S[]+Ep[]*Sqrt[],] Solve::smet: Ths system caot be solved wth the methods avalable to Solve.
3 Adrew Powuk - Math 49 (Numercal Aalyss) s l Plot[{Log[],-},{,,5}]
4 Adrew Powuk - Math 49 (Numercal Aalyss) Solve[S[]+(Cos[]) ((^-))==,] Plot[S[]+Cos[]/(^-),{,,}]
5 Adrew Powuk - Math 49 (Numercal Aalyss). (*) The Search Method a, b, b a a f f f ( ) #clude <ostream> double f(double ) { retur *-; } t ma(t argc, char** argv) { double a=-; double b= ; double eps=.; t =; double d=(b-a)/; double []; for(t =;<=;++) { []=a+d*; f((-eps<f[[])&&(f([])<eps)) { std::cout<<[]<<" "<<f([])<<"\"; } } retur ; } 5
6 Adrew Powuk - Math 49 (Numercal Aalyss) Results e For D N= For D N=^ For D N=^ 6
7 Adrew Powuk - Math 49 (Numercal Aalyss). Bsecto method.. Itroducto If f s a cotuous fucto. 7
8 Adrew Powuk - Math 49 (Numercal Aalyss) Eample , Iterato a, b f a f b f a f b f f ( ) error b a Iterato - f[_]=n[^-]; a=; c=(a+b)/; b=; Plot[f[],{,a,b}] f[a] f[c] f[b] c=/ f[a] = -. f[c]=.5 f[b]=. 8
9 Adrew Powuk - Math 49 (Numercal Aalyss) New terval [a=,c=/] Error=c-a=/-=/ Iterato f[_]=n[^-]; a=; c=(a+b)/;b=/; Plot[f[],{,a,b}] f[a] f[c] f[b] c=5/ f[a]=-. f[c]=-.475 f[b]=.5 New terval [c=5/4,b=/] Error=/-5/4=/4=/^ 9
10 Adrew Powuk - Math 49 (Numercal Aalyss) Iterato f[_]=n[^-]; a=5/4;b=/;c=(a+b)/ Plot[f[],{,a,b}] f[a] f[c] f[b] c=/ f[a]=-.475 f[c]=-.975 f[b]=.5 New terval [c=/8,b=/] Error=/-/8=/8=/^
11 Adrew Powuk - Math 49 (Numercal Aalyss) Iterato 4 f[_]=n[^-]; a=/8;b=/;c=(a+b)/ Plot[f[],{,a,b}] f[a] f[c] f[b] c=/ f[a]=-.975 f[c]=.6646 f[b]=.5 New terval [a=/8,b=/6] Error=/6-/8=/6=/^4
12 Adrew Powuk - Math 49 (Numercal Aalyss) Iterato 5 f[_]=n[^-]; a=/8;b=/6;c=(a+b)/ Plot[f[],{,a,b}] f[a] f[c] f[b] N[(b-a)] c=45/ f[a]=-.975 f[c]=-.469 f[b]=.6646 b-a=.65 New terval [a=45/,b=/6]
13 Adrew Powuk - Math 49 (Numercal Aalyss) Iterato 6 f[_]=n[^-]; a=45/;b=/6;c=(a+b)/ Plot[f[],{,a,b}] f[a] f[c] f[b] N[(b-a)] c=9/ f[a]=-.469 f[c]=.785 f[b]=.6646 b-a=.5 Results a=45/=.465 c=9/64=.488 error=c-a=9/64-45/=/64=/^6=.565 eect result =.44
14 Adrew Powuk - Math 49 (Numercal Aalyss).. Bsecto method - a program %%%%%%%%%%%%%%%%%%%%% fucto bsecto() a=; b=; N=6; dsp('start'); a b for =:N c=(a+b)/; dsp('terato'); f (f(a)*f(c) <=) a=a b=c else a=c b=b ed ed ed %bsecto %%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%% fucto y=f() y=^-; ed %%%%%%%%%%%%%%%%%%%% 4
15 Adrew Powuk - Math 49 (Numercal Aalyss) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%% Matlab/Octave %%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% fucto [ r ] = bsecto( f, a, b, N, eps_step, eps_abs ) % Check that that ether ed-pot s a root % ad f f(a) ad f(b) have the same sg, throw a ecepto. f ( f(a) == ) r = a; retur; elsef ( f(b) == ) r = b; retur; elsef ( f(a) * f(b) > ) error( 'f(a) ad f(b) do ot have opposte sgs' ); ed % We wll terate N tmes ad f a root was ot % foud after N teratos, a ecepto wll be throw. for k = :N % Fd the md-pot c = (a + b)/; % Check f we foud a root or whether or ot % we should cotue wth: % [a, c] f f(a) ad f(c) have opposte sgs, or % [c, b] f f(c) ad f(b) have opposte sgs. f ( f(c) == ) r = c; retur; elsef ( f(c)*f(a) < ) b = c; else a = c; ed % If b - a < eps_step, check whether or ot % f(a) < f(b) ad f(a) < eps_abs ad retur 'a', or % f(b) < eps_abs ad retur 'b'. f ( b - a < eps_step ) f ( abs( f(a) ) < abs( f(b) ) && abs( f(a) ) < eps_abs ) r = a; retur; elsef ( abs( f(b) ) < eps_abs ) r = b; retur; ed ed ed error( 'the method dd ot coverge' ); ed %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 5
16 Adrew Powuk - Math 49 (Numercal Aalyss).. Calculate three teratos of the bsecto method for f ad a, b. ( ) 5 ) a, b a b a, c.5, b 5 f ( a), f ( c), f ( b) 4 4 f ( a), f ( c), f ( b) ) a, b c old.5 a b 9 a, c, b f ( a), f ( c), f ( b) 6 4 f ( a), f ( c), f ( b) ) a, b c old a b 7 c f ( a), f ( c), f ( b) 64 6 f ( a), f ( c), f () b 9 a b 5 a c, b.5, c.875 old f ( a), f ( c), f ( b) ) et error b c ,
17 Adrew Powuk - Math 49 (Numercal Aalyss)..4 Calculate three teratos of the bsecto method for f ( ) ad a, b. ) a, b a b c 5 f a f f c f f b f 4 ( ) (), ( ), ( ) 8 a, b c old ) a b c f ( a) f (), f ( c) f, f ( b) f ) a, b c 4 old a b 4 9 c f ( a) f, f ( c) f, f ( b) f a= 4,b= 9 8 7
18 Adrew Powuk - Math 49 (Numercal Aalyss)..5 Calculate three teratos of the bsecto method for "bsecto method terato " "terval" a= b=4 "" c=(a+b)/ "accuracy" N[b-a] "values" N[f[a]] N[f[c]] N[f[b]] bsecto method terato terval 4 accuracy 4. values f ( ) ad a, b. "bsecto method terato " "terval" a=a b=c "" c=(a+b)/ "accuracy" N[b-a] "values" N[f[a]] N[f[c]] N[f[b]] bsecto method terato terval 8
19 Adrew Powuk - Math 49 (Numercal Aalyss) accuracy. values "bsecto method terato " "terval" a=c b=b "" c=(a+b)/ "accuracy" N[b-a] "values" N[f[a]] N[f[c]] N[f[b]] bsecto method terato terval / accuracy. values "bsecto method terato 4" "terval" a=c b=b "" c=(a+b)/ "accuracy" N[b-a] 9
20 Adrew Powuk - Math 49 (Numercal Aalyss) "values" N[f[a]] N[f[c]] N[f[b]] bsecto method terato 4 terval / 7/4 accuracy.5 values
21 Adrew Powuk - Math 49 (Numercal Aalyss)..6 Calculate three teratos of the bsecto method for f ( ) s ad a., b.5. Plot[S[]-/,{,,P}] Iterato a...5 c b.5 f a f c f b error b a.5 Iterato a c.75 b. 5 b f a f c f error b a.5
22 Adrew Powuk - Math 49 (Numercal Aalyss) Iterato a c.5 b.75 f a f c f b error b a.5
23 Adrew Powuk - Math 49 (Numercal Aalyss)..7 Calculate two teratos of the bsecto method for a, b. f( ) a, b a b c : fa ( ) 7 : fc ( ) 4 : fb ( ) a, b a b c 4 : fa ( ) : f ( c ) : f ( b ) 4 a, b 4 f[_]=-++^; a=;b=; Plot[f[],{,a,b}] f ( ) ad
24 Adrew Powuk - Math 49 (Numercal Aalyss) f[_]=-++^; a=;b=/; Plot[f[],{,a,b}]
25 Adrew Powuk - Math 49 (Numercal Aalyss)..8 Calculate two teratos of the bsecto method for a, b. 5 4 ad 5 4 a, b a b c : fa ( ) 5 4 * 5 : fc ( ) 5 4 * 4 : fb ( ) 5 4 * 6 c a, b a b 4 : fa ( ) 5 4 * 5 : fc ( ) 5 4 * : fb ( ) 5 4 * 4 a, b 4 5
26 Adrew Powuk - Math 49 (Numercal Aalyss)..9 Covergece aalyss, error b a b a, error b a b a b a, error b a b a b a, error..., error... error b a b a b a b a lm 6
27 Adrew Powuk - Math 49 (Numercal Aalyss).4 Newto's method.4. Itroducto f ' f Calculatos by had f ( ), f '( ) f( ) f '( ) f( ) f ().5 f '( ) f '() * f( ) f (.5) f '( ) f '(.5) * f '( ) f '(. 466). 466 f( ) f (.466) *
28 Adrew Powuk - Math 49 (Numercal Aalyss) f ' f f ' f f f ' f, f, f f ' f.5 f f '.4667 Plot[{^-,(^-)+**(-),((.5)^-)+*(.5)*(-.5)},{,,}]
29 Adrew Powuk - Math 49 (Numercal Aalyss) f( ) Step : set Step f( ) f ( ) f ( ) f '( )( ) f ( ) f ( ) f '( )( ) f '( )( ) f ( ) f( ) f '( ) f( ) f '( ) f( ) f '( ) f( ) f '( ) 9
30 Adrew Powuk - Math 49 (Numercal Aalyss).4. Eample f ( ), I[65]:= Clear[]; f[_] = ^ - ; df[_] = *; = ; = N[ - f[]/df[]] = N[ - f[]/df[]] = N[ - f[]/df[]] = N[ - f[]/df[]] = N[ - f[]/df[]] Calculatos by had f ( ), f '( ) f( ) f ( ), f '( ) f( ) f ().5 f '( ) f '() * f( ) f (.5) f '( ) f '(.5) * f '( ) f '(. 466). 466 f( ) f (.466) *.466
31 Adrew Powuk - Math 49 (Numercal Aalyss).4. Matlab code fucto ewto() eps=.; =; error=; terato=; whle(error>eps) New=-f()/df(); error=abs(new-); =New; dsp(sprtf('=%d =%f error=%f',terato,,error)); terato=terato+; ed ed fucto y=f() y=^-; ed fucto y=df() y=*; ed Output: octave:> ewto = =.5 error=.5 = = error=.8 = =.446 error=.45 =4 =.444 error=.
32 Adrew Powuk - Math 49 (Numercal Aalyss).4.5 (*) Covergece of Newto's method D y y (,) (-,-) D Fractal (*)
33 Adrew Powuk - Math 49 (Numercal Aalyss)
34 Adrew Powuk - Math 49 (Numercal Aalyss) 4
35 Adrew Powuk - Math 49 (Numercal Aalyss) 5
36 Adrew Powuk - Math 49 (Numercal Aalyss) 6
37 Adrew Powuk - Math 49 (Numercal Aalyss).4.6 (*) Problems wth multple roots f f( ) f '( ) ( ) ( ) f '( ) ( ) f ( ) ( ) f '( ) ( ) f( ) Sgularty the epresso for close to. f '( ), f ( ) f ( ) ( ) ( ) f '( ) ( ) ( )? 7
38 Adrew Powuk - Math 49 (Numercal Aalyss).4.7 (*) Startg pot eters a cycle.4.8 (*) Iftely may roots Plot[S[/],{,-,}]
39 Adrew Powuk - Math 49 (Numercal Aalyss).4.9 (*) Sample applcato Let us cosder the followg mechacal system P y L L 6EI P N 4. 4 I m 9 N E * m y y y y
40 Adrew Powuk - Math 49 (Numercal Aalyss) Clear[]; EE=*^9; L=; J=.^4/; P=^; Plot[P/(6*EE*J) ( +L L ),{,,L}] y=-.; F[_]=P/(6*EE*J) ( +L L )-y; df[_]=d[f[],]; =; =-F[]/dF[] =-F[]/dF[] =-F[]/dF[] =-F[]/dF[]
41 Adrew Powuk - Math 49 (Numercal Aalyss).4. Fd teratos of the Newto's method for f ( ) ad. f '( ) f( ) f '( ) f f '( ) f '() 4 ( ) f () f f( ) f '( ) f( ) f ' 4 f '( ) f f ' 4 4 4
42 Adrew Powuk - Math 49 (Numercal Aalyss).4. Fd teratos of the Newto's method for f ( ) ad. f( ) f '( ) f( ) f( ) f f ( ) 6. ( ) * f( ) f ( ) 5 * Fd teratos of the Newto's method for f ( ) 5 5 ad. f( ) 5 5 f '( ) 5 f ' f ' ' f 5 * f * 5 7 f f * * 5 7 4
43 Adrew Powuk - Math 49 (Numercal Aalyss).4. Fd teratos of the Newto's method for f ( ) 5 4 ad. f( ) 5 4 f( ) f '( ) f '( ) 4 f( ) 5 4 * 9 f '( ) 4 * 8 f( ) f '( ) * * 8 4
44 Adrew Powuk - Math 49 (Numercal Aalyss).4.4 Fd teratos of the Newto's method for f ( ) 7 ad. f ( ) 7, f '( )... ' ' * 7 f 7 7 * f 7 * f * f 7 *
45 Adrew Powuk - Math 49 (Numercal Aalyss).4.5 (*) Covergece aalyss f( ) f ( ) f ( ) f ( ) f '( )( ) f ''( )( ) (, ) f( ) f '( ) f ( ) f '( )( ) f ''( )( ) f ( ) f '( ) f ''( ) ( ) ( ) f '( ) f '( ) f '( ) f( ) f ''( ) ( ) f '( ) f '( ) f( ) f ''( ) ( ) f '( ) f '( ) f ''( ) ( ) f '( ) f ''( ) ( ) f '( ) f ''( ) M f '( ) M ( ) M ( ) M ( ) M ( ) M ( ).... Newto method has quadratc rate of covergece. 45
46 Adrew Powuk - Math 49 (Numercal Aalyss) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M ( ) M( ) f '( ) ( ) M f ''( ) f ''( ) f '( ) 46
47 Adrew Powuk - Math 49 (Numercal Aalyss).4.6 (**) Newto's method theorem (**) Newto's method theorem Let f : R R fd * R uder the followg assumptos. ) Ests at least oe soluto ). f * '( ) ) f ' Lp D * such that D where D R.e. f f * * ( ) s a ope terval. the * ) The Newto method coverge lm, ) f * ( ), * * ) k k p. Proof b We kow that f '( ) d f ( b) f ( a) b a b a f ( ) d f ( ) d b f z d f z b a ( ) ( ) a a f ( ) d f ( ) d b a b a k where D s a doma of the fucto f : R R. 47
48 Adrew Powuk - Math 49 (Numercal Aalyss) Lemma If f ' Lp D, the f ( y) f ( ) f '( ) y y Proof f y f f '( z) dz f '( ) y f '( ) dz the y y f y f f '( ) y f '( z) dz f '( ) dz '( ) '( ) '( ) f y f f y f z f dz Parameterzato z :, t z( t), y z t t ty y() y() y y y dz d t ty y dt dt y dz g z dz g z( t) dt g z( t) ( y ) dt g t ty ( y ) dt dt y f '( z) f '( ) dz f ' t ty f ' y dt f ' Lp D y f ' t ty f ' dt f '( y) f '( ) y the y y t ty dt y t y dt y tdt y f y f f y y '( ) Now t s possble to prove that p * * k k p * * k k 48
49 Adrew Powuk - Math 49 (Numercal Aalyss) f( ) k k k f '( ) k f( ) k k k k k * k * k f '( ) k * f '( ) f ( ) f '( ) * k k k k * * * k * * k k k k * * k k k f '( ) f '( ) f ( ) f ( ) f '( ) f '( ) f ( ) f ( ) f '( ) f ( ) f ( ) f '( ) * * k k k f '( ) '( ) y y * * ( ) ( ) '( ) f y f f k k f f f f '( ) f '( ) p * k k k * * k k k p m f '( ) k k p k * * k k k 49
50 Adrew Powuk - Math 49 (Numercal Aalyss).4.7 (*) Hgher order methods f( ) f( ) f ( ) f ( ) f '( )( ) f '( ) f ( ) f ( ) f '( )( ) f ''( )( )? 5
51 Adrew Powuk - Math 49 (Numercal Aalyss).5 Secat method f ( ) f ( ) f ( ) Fd teratos of the secat method for f ( ) f ( ) f ( ) f ( ), f ( ),, f ( ) f () f ( ) f ( ) f () f () 8 ( ).6 ( ) ( ) f ( ) f f ( ) f ( ) f f
52 Adrew Powuk - Math 49 (Numercal Aalyss).5. Relato wth the Newto s method f ' f f ' f f f f f f ' f f f ( ) f ( ) ( ) 5
53 Adrew Powuk - Math 49 (Numercal Aalyss).5. Dervato of the formula f ( ) f ( ) y f ( ) ( ) f ( ) f ( ) y f ( ) ( ) (, f ( )) (, f ( )) f( ) f ( ) f ( ) f f ( ) ( ) ( ) f ( ) ( ) f ( ) f ( ) ( ) f ( ) f ( ) f ( ) f( ) f ( ) f ( ) f f ( ) f ( ) or f f ( ) f ( ) f( ) f ( ) f ( ) ( ) ( ) 5
54 Adrew Powuk - Math 49 (Numercal Aalyss) f ( ) f ( ) y f ( ) ( ) f ( ) f ( ) f ( ) ( ) ( ) f ( ) ( ) f ( ) f f( ) f ( ) f ( ) f( ) f ( ) f ( ) f ( ) f ( ) f ( ) f ( f ( ) f ( ) ) 54
55 Adrew Powuk - Math 49 (Numercal Aalyss) Comparso to the Newto's method f( ) f '( ) f ( ) f ( ) f '( ) f ( ) f f ( ) f ( ) f ( ) f ( ) f ( ) f ( ) f ( ) ( ) f ( ),.. Clear[]; f[_]=^-; =; =; =N[-(-)*f[]/(f[]-f[])] =; =; =N[-(-)*f[]/(f[]-f[])] =; =; =N[-(-)*f[]/(f[]-f[])] =; =; =N[-(-)*f[]/(f[]-f[])]
56 Adrew Powuk - Math 49 (Numercal Aalyss).5. (*) Covergece aalyss Covergece aalyss f f f f f f f f f f f f f f f f f f f f f f f f f '' f '' f '' f '' f ( ) f ( ) f f f f ' f O f f f ' f '' O f ( ) f ( ) f f ' ' ' f f f f f f f 56
57 Adrew Powuk - Math 49 (Numercal Aalyss) 57 ( ) ( ) '' '' '' ' ' '' ' f f f f f f f f f f f f f 5.6 p p p p p p p p p A A A p A c A c p A Superler covergece 5 5 '' ' A f A f The method s faster tha the Newto s method because t requre oly oe fucto evaluato every terato.
58 Adrew Powuk - Math 49 (Numercal Aalyss) ma, ' ' , ' p p A p A A f A M f A A
59 Adrew Powuk - Math 49 (Numercal Aalyss).5.4 Fd teratos of the secat method for f ( ) f ( ) f ( ) f ( ), f ( ) f () f ( ) f ( ) f () f () 7 ( ) ( ) ( ) f ( ) f f ( ) f ( ) f f() f ( ),,.5.5 Fd teratos of the secat method for f ( ) f ( ) f ( ) f ( ), f ( ) f () f ( ) f ( ) f () f () 8 ( ).6 ( ) ( ) f ( ) f f ( ) f ( ) f f f ( ),, 59
60 Adrew Powuk - Math 49 (Numercal Aalyss).5.6 Fd teratos of secat method for f ( ) f ( ) f ( ) f ( ) , f f ( ) f () f ( ) f ( ) f () f () ( 5). ( 5) ( 5) 5 f ( ) 5 f f ( ) f ( ) 5 5 f f ( ) 5,,.5.7 Fd teratos of the secat method for f ( ),, f ( ),, f f ( ) f ( ) ( ) f ( ) f () f ( ) f ( ) f () f () 4 ( ). ( ) f ( ) f f( ) f ( ) 4 f f ()
61 Adrew Powuk - Math 49 (Numercal Aalyss).5.8 Fd teratos of the secat method for f (, ) 5 4, f ( ) 5 4,, f f ( ) f ( ) ( ) f ( ) f () f ( ) f ( ) f () f () ( 5 4 * ). 5 4 * ( 5 4 * ) 9 f ( ) 9 f f ( ) f ( ) 9 9 f f() * * 5 4 * 9 9 6
62 Adrew Powuk - Math 49 (Numercal Aalyss).5.9 Fd teratos of the secat method for f ( ),, f ( ),, f f ( ) f ( ) ( ) f ( ) f () f ( ) f ( ) f () f () f ( ) f ( ) f ( ) f ( ) f ( ) f ().5. Fd teratos of the secat method for f[_]=^-^--; Plot[f[],{,,5}] f ( ), 5,
63 Adrew Powuk - Math 49 (Numercal Aalyss) f ( ), 5, 4 f f ( ) f ( ) f ( ) f ( ) f ( ) f(4) f( 4) f(5) ( ) * * f ( ) f ( ) f ( ) * * * f(.8) f(.8) f(4).8.8 *
64 Adrew Powuk - Math 49 (Numercal Aalyss) f[_]=^-^--; =5; y=f[]; =4; y=f[]; Sl[_]=y+((y-y)/(-))*(-); Plot[{f[],Sl[]},{,.4,5}]
65 Adrew Powuk - Math 49 (Numercal Aalyss). (*) Regula fals c a f b f b b f a f a The method coverges faster tha the bsecto method. 65
66 Adrew Powuk - Math 49 (Numercal Aalyss) 66.6 Fed pot teratos Equato * * * * lm
67 Adrew Powuk - Math 49 (Numercal Aalyss) Eample 5 ( ), ( ), ( ) ( ) ( ) ( ) * lm * * * * 5 * true 67
68 Adrew Powuk - Math 49 (Numercal Aalyss) 68
69 Adrew Powuk - Math 49 (Numercal Aalyss).6. Fd fed pot teratos for f ( ) 5 ad 5. 5 ( ) 5 5 f( ) f 5 / : 5 / ( ) 5 ( ) Fed pot teratos 5 ( ), ( ), ( ) ( ) ( ) ( )
70 Adrew Powuk - Math 49 (Numercal Aalyss) Geeral formula for fed pot terato ( ) Covergece crtera a, b ma '( ) Eample 5, ( ), '( ).5. y '( ) Clear[]; f[_]=.5*(+5/); =7; =f[] =f[] =f[] =f[] =f[]
71 Adrew Powuk - Math 49 (Numercal Aalyss).6. Eample / 5 ( ) 5 ( ) 5 5 ( ) ( ) 5 ) ( Eample / 5 /*(-) 5 5 ( ) ( )
72 Adrew Powuk - Math 49 (Numercal Aalyss).6.4 Eample /:5 / ( ) ( ) ( ) ( ) ( ) ( )
73 Adrew Powuk - Math 49 (Numercal Aalyss).6.5 Eample / : 5 ( ) 5 ( ) ( ) ( ) ( ) 5... The lmt does t est. 5 5 ( ) ( ) ( ).666 7
74 Adrew Powuk - Math 49 (Numercal Aalyss).6.6 (*) Eample D y 4 4 y y 4 y 4 y 4 4 y X X y 4 y 4 X y 4 y X 4 X 4 y 4 X X y X X y X X
75 Adrew Powuk - Math 49 (Numercal Aalyss) 4 4 y y 4 y 4 y 4 y 4 y 4 y y 4 X AX B ( X ) AX B X ( X) X ( X ) AX B X ( X ) AX B A AX B B A X AB B X ( X ) AX B A AX B B A X AB B ( ) A AX B AB B A AX A B AB B A X A A B X A X A A B X A X A... A A B for A, lm AX S A... A A lm S (geometrcal seres) X AX B ( X ) AX B '( X) A A Matr orm 75
76 Adrew Powuk - Math 49 (Numercal Aalyss) A A ma a ma, j aj aj j j j ma a a, a a ma, ma, 4 y y 4 4 y 4 y A A ma a ma a, a j j j j j j ma, ma, a a a a ma, 76
77 Adrew Powuk - Math 49 (Numercal Aalyss).6.7 Geometrcal terpretato of the fed pot terato y y g( ) g( ) g( ) y y g( ).. 77
78 Adrew Powuk - Math 49 (Numercal Aalyss).6.8 Fed pot theorem (estece of the soluto).6.8. Itroducto Theorem (Estece of the soluto) Let be a cotuous fucto o[, ], ad suppose g satsfes the property a b a g( ) b g ( ) The the equato If D a, b g( ) the D D. ab ab has at least oe soluto the terval[, ]. b y a a b Remark Usg cotouty t s possble to prove that the soluto of the equato ests f g : a, b a, b or a, b g : ab,. g the terval ab, 78
79 Adrew Powuk - Math 49 (Numercal Aalyss) b y a a g : a, b a, b a, b g : ab, b 79
80 Adrew Powuk - Math 49 (Numercal Aalyss).6.9 Cotracto mappg theorem Theorem (Cotracto mappg theorem for Assume that g ( ) ad g '( ) the ) There s a uque soluto ) For ay tal estmate of ) 4) lm g '( ) for g ) are cotuous for a b ad assume that g satsfes the theorem, ad ma g'( ) a b of the equato g( ) (.e. g( ) ). ab, close to, the terates wll coverge to. we have g '( ). 8
81 Adrew Powuk - Math 49 (Numercal Aalyss) (*) Proof g g ' ' ' ' ma g ' g g g g g g ab, g g
82 Adrew Powuk - Math 49 (Numercal Aalyss) g g g ' ' ' ' ma g ' g g g g g g ab, By assumpto, the lm lm Because the by the sadwch theorem 8
83 Adrew Powuk - Math 49 (Numercal Aalyss) lm lm lm lm lm By cotuty of lm lm We kow the lm lm Uqueess Let s assume that there are two fed pots lm lm,,, lm lm lm D lm 8
84 Adrew Powuk - Math 49 (Numercal Aalyss) Theorem (***) (Baach fed pot theorem) Let (X, ) be a o-empty complete metrc space. Let : oegatve real umber * ad oly oe fed pot X T X X such that ( T ( ), T ( y)) (, y) for all Fed pot ca be foud as follows: start wth a arbtrary elemet or T ( ). The followg equalty descrbes the speed of covergece * (, ) (, ) * (, ) (, ) be a cotracto mappg o X,.e.: there s a, y X. The T admts oe X ad defe ad teratve sequece by.6.9. (*) Problem Is t possble to solve Aswer for,? I preseted eample. Rage of the fucto the terval, s (from the graph) :, :,, s cotuous (every polyomal s cotous) o the terval,. Fucto Because ad ), ), :, s cotuous (every polyomal s cotous) o the terval, The accordg to the theorem the soluto of the equato Plot[{,-},{,,}] for, ests. 84
85 Adrew Powuk - Math 49 (Numercal Aalyss) (*) Problem Is t possble to solve Aswer? for, I order to apply the theorem we eed to kow the rage of the fucto over the terval, ad the cotouty. Fucto s cotuous o the terval, because every polyomal s cotous. Rage of the fucto Plot[{,-^},{,,}]. ca be foud from the graph
86 Adrew Powuk - Math 49 (Numercal Aalyss) Because ) :, :,,, ad 4), :,, s cotuous (every polyomal s cotous) o the terval The accordg to the theorem the soluto of the equato, for, ests. 86
87 Adrew Powuk - Math 49 (Numercal Aalyss).6.9. Problem 5 Let us cosder ( ) ad,. estmate the error of the fed pot terato for Aswer From the graph whch s show below we ca see that ( ) : ab, a, b, or ( D) D, 5 the the soluto of the equato ests the terval Plot[{(/)*(+5/),},{,,}].,. ad ( D) D ,,,,,, m, ma, m ma, 87
88 Adrew Powuk - Math 49 (Numercal Aalyss) Let s calculate dervatve 5 ( ) 5 '( ) Let s D, the Crtcal umbers '( ) D 5 '( ) , 5.6 D ca be calculated by usg optmzato techques. [,] [,] ma ma ma, 5,.4 D m m m, 5, D D m, ma [,] [,] D D.5.5,.4, D 88
89 Adrew Powuk - Math 49 (Numercal Aalyss) Plot[(/)*(-5/^),{,,}] Plot[Abs[(/)*(-5/^)],{,,}] Defto of the rage [ ab, ], 89
90 Adrew Powuk - Math 49 (Numercal Aalyss) '' 5 ' 5 *5 5 Plot[5/^,{,-4,4}] I the terval [,] dervatve of the fucto '( ) s postve, the the fucto '( ) crease. The etreme values of the fucto '( ) are at the epots of the terval [,]. From the graph we see that 5 ma '( ) ma ma ', ' 5, ' ma,, a b the accordg to the theorem the sequece Let s estmate the error for the fed pot terato for s coverget to the fed pot.. 9
91 Adrew Powuk - Math 49 (Numercal Aalyss) 5,, ( ) Verfcato of the results We kow that the soluto of the equato After calculatos True error s much smaller tha the error estmator. s *
92 Adrew Powuk - Math 49 (Numercal Aalyss) Problem Let us cosder ( ) s ad,. Soluto Clear[]; f[_]=(/)*s[]; Plot[{f[],},{,-P,P}] =; =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] =N[f[]] estmate the error of the fed pot terato for ad
93 Adrew Powuk - Math 49 (Numercal Aalyss) Estece of the soluto for D [, ] D : D s :,, D D, true, Plot[{(/)*S[],/,-/},{,-P,P}]
94 Adrew Powuk - Math 49 (Numercal Aalyss) ' s ' cos ma ' ma cos D, Plot[{(/)*Cos[],/,-/},{,-P,P}] Plot[{(/)*Abs[Cos[]],/,-/},{,-P,P}]
95 Adrew Powuk - Math 49 (Numercal Aalyss) Error estmate s ( )
96 Adrew Powuk - Math 49 (Numercal Aalyss) Problem Let us cosder ( ) cos ad,. Aswer estmate the error of the fed pot terato for ad Clear[]; = ; = ; Do[{Prt[], = (/)*N[Cos[]]}, {,, }]
97 Adrew Powuk - Math 49 (Numercal Aalyss) D D,, m, ma,,,,, :, cos :,, m m cos,, ma ma cos,, D D,, true The f pot ests. ma ' ma s ma s D,, The f pot s uque. cos ( )
98 Adrew Powuk - Math 49 (Numercal Aalyss) Atke Error estmato ad Etrapolato
99 Adrew Powuk - Math 49 (Numercal Aalyss) after solvg that for or g( ) g( ) Because lm lm g '( ) the so t s possble to assume that Atke's etrapolato forma for error estmato ad g ' 99
100 Adrew Powuk - Math 49 (Numercal Aalyss) Eample, 5, ( ) ( )
101 Adrew Powuk - Math 49 (Numercal Aalyss).6. (*) Hgher order Error Estmato.6.. Frst order method g( ) g( ) g '( c ) g( ) g( ) g( ) g( ) g '( c ) g '( c ) g '( c ).6.. Secod order method If g '( ) g( ) g( ) g '( ) g ''( c ) g( ) g( ) g '( ) g( ) g( ) g '( ) g ''( c ) g ''( c ) g ''( c )
102 Adrew Powuk - Math 49 (Numercal Aalyss).7 (*) Order of covergece Defto (Rate of covergece) - The rate of covergece s at least ler. If c ad N such that * * C, for N - The rate of covergece s at least superler ff { } such that * ad N such that - The covergece s at least quadratc f C & N t * * C, I geeral for large p * *, C the p s the rate of covergece. p *, N
103 Adrew Powuk - Math 49 (Numercal Aalyss) l p * * C p * * C l p C p C C p C p l l l l l l l l l C p ( ) l l pl l l l p l l p l l p l l ~ p l l l l
104 Adrew Powuk - Math 49 (Numercal Aalyss) Sample code fucto ewto() eps=.; =; error=; terato=; whle(error>eps) em=log(abs(-sqrt())); New=-f()/df(); e =log(abs(new-sqrt())); error=abs(new-); New=New-f(New)/df(New); ep=log(abs(new-sqrt())); p=(ep-e)/(e-em); =New; dsp(sprtf('=%d =%f error=%f p=%f',terato,,error,p)); terato=terato+; ed ed fucto y=f() y=^-; ed fucto y=df() y=*; ed Output = =.5 error=.5 p=.855 = = error=.8 p=.9899 = =.446 error=.45 p= =4 =.444 error=. p=if 4
105 Adrew Powuk - Math 49 (Numercal Aalyss).8 Revew.8. Summer 7 Secto. Problem..7 Problem..8 Secto.4 Problem.4. Problem.4. Secto.5 Problem.5.7 Problem.5.8 Secto.6 Problem.6.9. Problem
UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method
More informationPGE 310: Formulation and Solution in Geosystems Engineering. Dr. Balhoff. Interpolation
PGE 30: Formulato ad Soluto Geosystems Egeerg Dr. Balhoff Iterpolato Numercal Methods wth MATLAB, Recktewald, Chapter 0 ad Numercal Methods for Egeers, Chapra ad Caale, 5 th Ed., Part Fve, Chapter 8 ad
More information( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006
Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.
More informationMu Sequences/Series Solutions National Convention 2014
Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed
More information1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.
PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg
More information2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America
SOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR EQUATIONS Gauss-Sedel Method 006 Jame Traha, Autar Kaw, Kev Mart Uversty of South Florda Uted States of Amerca kaw@eg.usf.edu Itroducto Ths worksheet demostrates
More informationG S Power Flow Solution
G S Power Flow Soluto P Q I y y * 0 1, Y y Y 0 y Y Y 1, P Q ( k) ( k) * ( k 1) 1, Y Y PQ buses * 1 P Q Y ( k1) *( k) ( k) Q Im[ Y ] 1 P buses & Slack bus ( k 1) *( k) ( k) Y 1 P Re[ ] Slack bus 17 Calculato
More informationF. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties
進佳數學團隊 Dr. Herbert Lam 林康榮博士 HKAL Pure Mathematcs F. Ieualtes. Basc propertes Theorem Let a, b, c be real umbers. () If a b ad b c, the a c. () If a b ad c 0, the ac bc, but f a b ad c 0, the ac bc. Theorem
More informationL5 Polynomial / Spline Curves
L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a
More information9.1 Introduction to the probit and logit models
EC3000 Ecoometrcs Lecture 9 Probt & Logt Aalss 9. Itroducto to the probt ad logt models 9. The logt model 9.3 The probt model Appedx 9. Itroducto to the probt ad logt models These models are used regressos
More informationChapter 5 Properties of a Random Sample
Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample
More informationBeam Warming Second-Order Upwind Method
Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet
More information1 Lyapunov Stability Theory
Lyapuov Stablty heory I ths secto we cosder proofs of stablty of equlbra of autoomous systems. hs s stadard theory for olear systems, ad oe of the most mportat tools the aalyss of olear systems. It may
More informationInternational Journal of Mathematical Archive-5(8), 2014, Available online through ISSN
Iteratoal Joural of Mathematcal Archve-5(8) 204 25-29 Avalable ole through www.jma.fo ISSN 2229 5046 COMMON FIXED POINT OF GENERALIZED CONTRACTION MAPPING IN FUZZY METRIC SPACES Hamd Mottagh Golsha* ad
More informationSupervised learning: Linear regression Logistic regression
CS 57 Itroducto to AI Lecture 4 Supervsed learg: Lear regresso Logstc regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Data: D { D D.. D D Supervsed learg d a set of eamples s
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationStrong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout
More informationArithmetic Mean and Geometric Mean
Acta Mathematca Ntresa Vol, No, p 43 48 ISSN 453-6083 Arthmetc Mea ad Geometrc Mea Mare Varga a * Peter Mchalča b a Departmet of Mathematcs, Faculty of Natural Sceces, Costate the Phlosopher Uversty Ntra,
More informationOn Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros
It. Joural of Math. Aalyss, Vol. 7, 2013, o. 20, 983-988 HIKARI Ltd, www.m-hkar.com O Modfed Iterval Symmetrc Sgle-Step Procedure ISS2-5D for the Smultaeous Icluso of Polyomal Zeros 1 Nora Jamalud, 1 Masor
More informationGiven a table of data poins of an unknown or complicated function f : we want to find a (simpler) function p s.t. px (
Iterpolato 1 Iterpolato Gve a table of data pos of a ukow or complcated fucto f : y 0 1 2 y y y y 0 1 2 we wat to fd a (smpler) fucto p s.t. p ( ) = y for = 0... p s sad to terpolate the table or terpolate
More informationDKA method for single variable holomorphic functions
DKA method for sgle varable holomorphc fuctos TOSHIAKI ITOH Itegrated Arts ad Natural Sceces The Uversty of Toushma -, Mamhosama, Toushma, 770-8502 JAPAN Abstract: - Durad-Kerer-Aberth (DKA method for
More informationCubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem
Joural of Amerca Scece ;6( Cubc Nopolyomal Sple Approach to the Soluto of a Secod Order Two-Pot Boudary Value Problem W.K. Zahra, F.A. Abd El-Salam, A.A. El-Sabbagh ad Z.A. ZAk * Departmet of Egeerg athematcs
More informationUnimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods
Malaysa Umodalty Joural Tests of Mathematcal for Global Optmzato Sceces (): of 05 Sgle - 5 Varable (007) Fuctos Usg Statstcal Methods Umodalty Tests for Global Optmzato of Sgle Varable Fuctos Usg Statstcal
More informationAnalysis of Lagrange Interpolation Formula
P IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue, December 4. www.jset.com ISS 348 7968 Aalyss of Lagrage Iterpolato Formula Vjay Dahya PDepartmet of MathematcsMaharaja Surajmal
More informationOn the Interval Zoro Symmetric Single Step. Procedure IZSS1-5D for the Simultaneous. Bounding of Real Polynomial Zeros
It. Joural of Math. Aalyss, Vol. 7, 2013, o. 59, 2947-2951 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ma.2013.310259 O the Iterval Zoro Symmetrc Sgle Step Procedure IZSS1-5D for the Smultaeous
More informationmeans the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.
9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,
More informationNumerical Analysis Formulae Booklet
Numercal Aalyss Formulae Booklet. Iteratve Scemes for Systems of Lear Algebrac Equatos:.... Taylor Seres... 3. Fte Dfferece Approxmatos... 3 4. Egevalues ad Egevectors of Matrces.... 3 5. Vector ad Matrx
More informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More information5 Short Proofs of Simplified Stirling s Approximation
5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:
More informationAssignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)
Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form
More informationTHE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION
Joural of Scece ad Arts Year 12, No. 3(2), pp. 297-32, 212 ORIGINAL AER THE ROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION DOREL MIHET 1, CLAUDIA ZAHARIA 1 Mauscrpt receved: 3.6.212; Accepted
More informationX ε ) = 0, or equivalently, lim
Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece
More informationResearch Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings
Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte
More informationA Remark on the Uniform Convergence of Some Sequences of Functions
Advaces Pure Mathematcs 05 5 57-533 Publshed Ole July 05 ScRes. http://www.scrp.org/joural/apm http://dx.do.org/0.436/apm.05.59048 A Remark o the Uform Covergece of Some Sequeces of Fuctos Guy Degla Isttut
More informationCHAPTER 4 RADICAL EXPRESSIONS
6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube
More informationA conic cutting surface method for linear-quadraticsemidefinite
A coc cuttg surface method for lear-quadratcsemdefte programmg Mohammad R. Osoorouch Calfora State Uversty Sa Marcos Sa Marcos, CA Jot wor wth Joh E. Mtchell RPI July 3, 2008 Outle: Secod-order coe: defto
More informationCS475 Parallel Programming
CS475 Parallel Programmg Deretato ad Itegrato Wm Bohm Colorado State Uversty Ecept as otherwse oted, the cotet o ths presetato s lcesed uder the Creatve Commos Attrbuto.5 lcese. Pheomea Physcs: heat, low,
More informationBERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler
Mathematcal ad Computatoal Applcatos, Vol. 8, No. 3, pp. 293-300, 203 BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS Aysegul Ayuz Dascoglu ad Nese Isler Departmet of Mathematcs,
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationMMJ 1113 FINITE ELEMENT METHOD Introduction to PART I
MMJ FINITE EEMENT METHOD Cotut requremets Assume that the fuctos appearg uder the tegral the elemet equatos cota up to (r) th order To esure covergece N must satsf Compatblt requremet the fuctos must have
More information= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n
.. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show
More informationDerivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations
Dervato of -Pot Block Method Formula for Solvg Frst Order Stff Ordary Dfferetal Equatos Kharul Hamd Kharul Auar, Kharl Iskadar Othma, Zara Bb Ibrahm Abstract Dervato of pot block method formula wth costat
More informationLecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES
FDM: Appromato of Frst Order Dervatves Lecture APPROXIMATION OF FIRST ORDER DERIVATIVES. INTRODUCTION Covectve term coservato equatos volve frst order dervatves. The smplest possble approach for dscretzato
More informationå 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018
Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of
More informationLecture 9: Tolerant Testing
Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have
More informationAitken delta-squared generalized Juncgk-type iterative procedure
Atke delta-squared geeralzed Jucgk-type teratve procedure M. De la Se Isttute of Research ad Developmet of Processes. Uversty of Basque Coutry Campus of Leoa (Bzkaa) PO Box. 644- Blbao, 488- Blbao. SPAIN
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationQR Factorization and Singular Value Decomposition COS 323
QR Factorzato ad Sgular Value Decomposto COS 33 Why Yet Aother Method? How do we solve least-squares wthout currg codto-squarg effect of ormal equatos (A T A A T b) whe A s sgular, fat, or otherwse poorly-specfed?
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationUNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS
UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Exam: ECON430 Statstcs Date of exam: Frday, December 8, 07 Grades are gve: Jauary 4, 08 Tme for exam: 0900 am 00 oo The problem set covers 5 pages Resources allowed:
More informationENGI 4430 Numerical Integration Page 5-01
ENGI 443 Numercal Itegrato Page 5-5. Numercal Itegrato I some o our prevous work, (most otaly the evaluato o arc legth), t has ee dcult or mpossle to d the dete tegral. Varous symolc algera ad calculus
More informationSimple Linear Regression
Statstcal Methods I (EST 75) Page 139 Smple Lear Regresso Smple regresso applcatos are used to ft a model descrbg a lear relatoshp betwee two varables. The aspects of least squares regresso ad correlato
More informationSupport vector machines
CS 75 Mache Learg Lecture Support vector maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 75 Mache Learg Outle Outle: Algorthms for lear decso boudary Support vector maches Mamum marg hyperplae.
More informationENGI 4421 Propagation of Error Page 8-01
ENGI 441 Propagato of Error Page 8-01 Propagato of Error [Navd Chapter 3; ot Devore] Ay realstc measuremet procedure cotas error. Ay calculatos based o that measuremet wll therefore also cota a error.
More information= 2. Statistic - function that doesn't depend on any of the known parameters; examples:
of Samplg Theory amples - uemploymet househol cosumpto survey Raom sample - set of rv's... ; 's have ot strbuto [ ] f f s vector of parameters e.g. Statstc - fucto that oes't epe o ay of the ow parameters;
More informationNewton s Power Flow algorithm
Power Egeerg - Egll Beedt Hresso ewto s Power Flow algorthm Power Egeerg - Egll Beedt Hresso The ewto s Method of Power Flow 2 Calculatos. For the referece bus #, we set : V = p.u. ad δ = 0 For all other
More informationLog1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each
01 Log1 Cotest Roud Theta Complex Numbers 1 Wrte a b Wrte a b form: 1 5 form: 1 5 4 pots each Wrte a b form: 65 4 4 Evaluate: 65 5 Determe f the followg statemet s always, sometmes, or ever true (you may
More information( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model
Chapter 3 Asmptotc Theor ad Stochastc Regressors The ature of eplaator varable s assumed to be o-stochastc or fed repeated samples a regresso aalss Such a assumpto s approprate for those epermets whch
More informationMultiple Choice Test. Chapter Adequacy of Models for Regression
Multple Choce Test Chapter 06.0 Adequac of Models for Regresso. For a lear regresso model to be cosdered adequate, the percetage of scaled resduals that eed to be the rage [-,] s greater tha or equal to
More informationLaboratory I.10 It All Adds Up
Laboratory I. It All Adds Up Goals The studet wll work wth Rema sums ad evaluate them usg Derve. The studet wll see applcatos of tegrals as accumulatos of chages. The studet wll revew curve fttg sklls.
More informationQ-analogue of a Linear Transformation Preserving Log-concavity
Iteratoal Joural of Algebra, Vol. 1, 2007, o. 2, 87-94 Q-aalogue of a Lear Trasformato Preservg Log-cocavty Daozhog Luo Departmet of Mathematcs, Huaqao Uversty Quazhou, Fua 362021, P. R. Cha ldzblue@163.com
More informationMidterm Exam 1, section 1 (Solution) Thursday, February hour, 15 minutes
coometrcs, CON Sa Fracsco State Uversty Mchael Bar Sprg 5 Mdterm am, secto Soluto Thursday, February 6 hour, 5 mutes Name: Istructos. Ths s closed book, closed otes eam.. No calculators of ay kd are allowed..
More informationFeature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)
CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.
More information18.413: Error Correcting Codes Lab March 2, Lecture 8
18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse
More informationGeneralization of the Dissimilarity Measure of Fuzzy Sets
Iteratoal Mathematcal Forum 2 2007 o. 68 3395-3400 Geeralzato of the Dssmlarty Measure of Fuzzy Sets Faramarz Faghh Boformatcs Laboratory Naobotechology Research Ceter vesa Research Isttute CECR Tehra
More informationChapter 5. Curve fitting
Chapter 5 Curve ttg Assgmet please use ecell Gve the data elow use least squares regresso to t a a straght le a power equato c a saturato-growthrate equato ad d a paraola. Fd the r value ad justy whch
More informationGeneral Method for Calculating Chemical Equilibrium Composition
AE 6766/Setzma Sprg 004 Geeral Metod for Calculatg Cemcal Equlbrum Composto For gve tal codtos (e.g., for gve reactats, coose te speces to be cluded te products. As a example, for combusto of ydroge wt
More informationA Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
Aerca Joural of Operatos Research, 4, 4, 33-339 Publshed Ole Noveber 4 ScRes http://wwwscrporg/oural/aor http://ddoorg/436/aor4463 A Pealty Fucto Algorth wth Obectve Paraeters ad Costrat Pealty Paraeter
More informationd dt d d dt dt Also recall that by Taylor series, / 2 (enables use of sin instead of cos-see p.27 of A&F) dsin
Learzato of the Swg Equato We wll cover sectos.5.-.6 ad begg of Secto 3.3 these otes. 1. Sgle mache-fte bus case Cosder a sgle mache coected to a fte bus, as show Fg. 1 below. E y1 V=1./_ Fg. 1 The admttace
More informationBounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy
Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled
More informationObjectives of Multiple Regression
Obectves of Multple Regresso Establsh the lear equato that best predcts values of a depedet varable Y usg more tha oe eplaator varable from a large set of potetal predctors {,,... k }. Fd that subset of
More informationResearch Article Gauss-Lobatto Formulae and Extremal Problems
Hdaw Publshg Corporato Joural of Iequaltes ad Applcatos Volume 2008 Artcle ID 624989 0 pages do:055/2008/624989 Research Artcle Gauss-Lobatto Formulae ad Extremal Problems wth Polyomals Aa Mara Acu ad
More informationMidterm Exam 1, section 2 (Solution) Thursday, February hour, 15 minutes
coometrcs, CON Sa Fracsco State Uverst Mchael Bar Sprg 5 Mdterm xam, secto Soluto Thursda, Februar 6 hour, 5 mutes Name: Istructos. Ths s closed book, closed otes exam.. No calculators of a kd are allowed..
More information: At least two means differ SST
Formula Card for Eam 3 STA33 ANOVA F-Test: Completely Radomzed Desg ( total umber of observatos, k = Number of treatmets,& T = total for treatmet ) Step : Epress the Clam Step : The ypotheses: :... 0 A
More informationA tutorial on the Aitken convergence accelerator
A tutoral o the Atke covergece accelerator By Cedrck Collomb Abstract. Ths tutoral troduces the cocept ad usefuless of covergece accelerators hopefully a smple maer tellgble to ay reader wth mmal mathematcal
More informationOrdinary Least Squares Regression. Simple Regression. Algebra and Assumptions.
Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos
More informationUnsupervised Learning and Other Neural Networks
CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all
More informationLebesgue Measure of Generalized Cantor Set
Aals of Pure ad Appled Mathematcs Vol., No.,, -8 ISSN: -8X P), -888ole) Publshed o 8 May www.researchmathsc.org Aals of Lebesgue Measure of Geeralzed ator Set Md. Jahurul Islam ad Md. Shahdul Islam Departmet
More informationA Method for Damping Estimation Based On Least Square Fit
Amerca Joural of Egeerg Research (AJER) 5 Amerca Joural of Egeerg Research (AJER) e-issn: 3-847 p-issn : 3-936 Volume-4, Issue-7, pp-5-9 www.ajer.org Research Paper Ope Access A Method for Dampg Estmato
More informationCOMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL
Sebasta Starz COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL Abstract The am of the work s to preset a method of rakg a fte set of dscrete radom varables. The proposed method s based o two approaches:
More informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More informationEVALUATION OF FUNCTIONAL INTEGRALS BY MEANS OF A SERIES AND THE METHOD OF BOREL TRANSFORM
EVALUATION OF FUNCTIONAL INTEGRALS BY MEANS OF A SERIES AND THE METHOD OF BOREL TRANSFORM Jose Javer Garca Moreta Ph. D research studet at the UPV/EHU (Uversty of Basque coutry) Departmet of Theoretcal
More informationEvaluation of uncertainty in measurements
Evaluato of ucertaty measuremets Laboratory of Physcs I Faculty of Physcs Warsaw Uversty of Techology Warszawa, 05 Itroducto The am of the measuremet s to determe the measured value. Thus, the measuremet
More informationα1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions:
Smplex ad Rectagle Elemets Mult-dex Notato = (,..., ), o-egatve tegers = = β = ( β,..., β ) the + β = ( + β,..., + β ) + x = x x x x = x x β β + D = D = D D x x x β β Defto: The set P of polyomals of degree
More informationSolving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationReview Exam II Complex Analysis
Revew Exam II Complex Aalyss Uderled Propostos or Theorems: Proofs May Be Asked for o Exam Chapter 3. Ifte Seres Defto: Covergece Defto: Absolute Covergece Proposto. Absolute Covergece mples Covergece
More informationPoint Estimation: definition of estimators
Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.
More informationTaylor s Series and Interpolation. Interpolation & Curve-fitting. CIS Interpolation. Basic Scenario. Taylor Series interpolates at a specific
CIS 54 - Iterpolato Roger Crawfs Basc Scearo We are able to prod some fucto, but do ot kow what t really s. Ths gves us a lst of data pots: [x,f ] f(x) f f + x x + August 2, 25 OSU/CIS 54 3 Taylor s Seres
More information02/15/04 INTERESTING FINITE AND INFINITE PRODUCTS FROM SIMPLE ALGEBRAIC IDENTITIES
0/5/04 ITERESTIG FIITE AD IFIITE PRODUCTS FROM SIMPLE ALGEBRAIC IDETITIES Thomas J Osler Mathematcs Departmet Rowa Uversty Glassboro J 0808 Osler@rowaedu Itroducto The dfferece of two squares, y = + y
More informationThe Arithmetic-Geometric mean inequality in an external formula. Yuki Seo. October 23, 2012
Sc. Math. Japocae Vol. 00, No. 0 0000, 000 000 1 The Arthmetc-Geometrc mea equalty a exteral formula Yuk Seo October 23, 2012 Abstract. The classcal Jese equalty ad ts reverse are dscussed by meas of terally
More informationMATH 371 Homework assignment 1 August 29, 2013
MATH 371 Homework assgmet 1 August 29, 2013 1. Prove that f a subset S Z has a smallest elemet the t s uque ( other words, f x s a smallest elemet of S ad y s also a smallest elemet of S the x y). We kow
More informationLecture 3 Probability review (cont d)
STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto
More informationAnalyzing Control Structures
Aalyzg Cotrol Strutures sequeg P, P : two fragmets of a algo. t, t : the tme they tae the tme requred to ompute P ;P s t t Θmaxt,t For loops for to m do P t: the tme requred to ompute P total tme requred
More informationLogistic regression (continued)
STAT562 page 138 Logstc regresso (cotued) Suppose we ow cosder more complex models to descrbe the relatoshp betwee a categorcal respose varable (Y) that takes o two (2) possble outcomes ad a set of p explaatory
More informationSolving Interval and Fuzzy Multi Objective. Linear Programming Problem. by Necessarily Efficiency Points
Iteratoal Mathematcal Forum, 3, 2008, o. 3, 99-06 Solvg Iterval ad Fuzzy Mult Obectve ear Programmg Problem by Necessarly Effcecy Pots Hassa Mshmast Neh ad Marzeh Aleghad Mathematcs Departmet, Faculty
More informationLecture Notes 2. The ability to manipulate matrices is critical in economics.
Lecture Notes. Revew of Matrces he ablt to mapulate matrces s crtcal ecoomcs.. Matr a rectagular arra of umbers, parameters, or varables placed rows ad colums. Matrces are assocated wth lear equatos. lemets
More informationLecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model
Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The
More informationarxiv:math/ v1 [math.gm] 8 Dec 2005
arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko
More informationAn Introduction to. Support Vector Machine
A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork
More informationComplete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables
Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl
More information