Numerical Methods in Engineering, Study notes of Numerical Methods in Engineering

Download Numerical Methods in Engineering and more Study notes Numerical Methods in Engineering in PDF only on Docsity!

4, — PEcES4oOaR : Numerical “e _ patel [e will, £ ae are ‘ ol —a ~ . al ret “XK fee hich \$G) 201 acwote 6 some evtoC toler. te a axis. 3° 24a Fin ilo 8 £0) é ‘ Ons rj lo LGC). ax? har ter0 , Hen he L f@)- <22x+4 : fo i bt. leeodac. AQ Bolerance. Z Alone chingok eg, Solvers FA, fe reac a WM, Vv Vv Baadelin “Catabical pat ws foreX « Bisechion . - SU CeSVe. "+ Nala Baphion 2 False posifion. 4 A9pI0; Maier 2—_Secanl ee a \ $a) * £Cb) ¢o| . at batt ene soubor § eaists oc Odd ao. Of fix) fix) Figure: If the function does not change sign between two points, there may not be any roots for the equation between the two points. f(x) Figure: If the function changes sign between two points, more than one root for the equation may exist between the:two points. PAGE DATE Hokbod of sawing > eel tage “ fin is sabished: P(a)* £Cb) 40 os p—i_VeS, ten continue ciko He seand step. bg ie ae ten te bisection entliad ca nol be applied on 2) _ D ile H, ‘ k k { . | le /t L dp 5 L) : _ C= Cat+b) /2 | 3a “a Mp eal da li te alin by He lg 7 [be] os 1 i¢ eee oT £(c) 400 => The vook ies ca the Subialenal Jac, seb. a a-i¢ [P(c)* £¢b) 40 Tar ty mob lies tn “he subintenal Té-b, sel: _ 2 if [FQ £ 6c) o Fema Got ¢S_C - jase << Continue unl te apts criteria és safistied: a a ony 1 : Nm au) ee TV = Exam t: Use bisedin mo & Fink yooks of: 7 Ciao X32 eet on He care [2,232 le £64) is Gntinuous on He cateryl Co, 27 2. Buk £(o)x £&) 2s No +Hreverore He ~ Condh'na_¢s _nok_sab's bed - = g- apes sh Sel RT A biseehjon the efel ad ailishes aS [log - Ba\ = Ye \b, - ay = Vy lb, - tol = 42 |b, -4o\ ‘ | ba -&g| 243 [by-Go . ab < cterabion : “go _Ib-al 2, , Q°\ |b-al fe —_Cake. 09 toi bor sides) Alon 2 Ss ty (Ibeal Ze 4% s = | As fo (haa) Zé, ES — PAGE, DATE i He cmver isechinn _m & solve, £0) = x74 UX? lo=0, fr He catervel F122, and enor bleange.o- 0005. Solu; iks He only we/iod uli $s eazy delembae tre ; ——___ dumber of éferalinr needed . Sve Disad.. ot bisection méttos+ ifs is Slow, a8 No accounl & ben of b)u3 ‘. 3 like ill fail fo €; of y ae 5 Se ill abe i Lox). L T T Marl x \ x Bt +1 -1.07692 -1.10374 -0.25854 2.737517 3.165 2 3 -1,07692 -1.10374 -0.25854 2.737499 -0.84177 -0.50638 9.692 4 0.25854 2.737499 -0.84177 -0.50639 -0.75072 -0.09342 0.121 5 0.84177 -0.50639 -0.75072 -0.0934 -0.73013 0.009759 9.03 0.003< 6 0.75072 -0.0934 -0.73013 0.009759 €s C~ -0.73208 Advantages/disadvantages of secant method * The advantage of Secant method , if it reaches the solution, it will converge faster than the bisection method. * The disadvantage, it may not reach a solution (it diverts), as in Bisection method , we check the sign of f(a) and f(b) but in Secant we could discard the part that had a root. Heltah o£ solving : = “HA k; a * €(b) do. ever toleyonce (Es) eal ae ala. #£0b) (b-e) £(b) = Fla Slows ASS — Caste bisedion mtfol :) if £G) wx £0) Zo —> Cook ties (a He sub inthal Ta,c% ath [hact ic F@)x £0) 0 hes - ite Tec azo]. if £O\x fc) =o ~» Hy woot is € . @) continue dsttr! the Shyppie, criteria js Sahistied Eds | « pace’) J rr a Helhod 6 4 Successive gopreaimabion, :- ———_ :% . > T - a - * i — a = A(X ;) =; + A£{X\ sk —subticienl condition foc converrence ; : wiz 9 ’(%) 9(Xo) = Xo + A(X? — 6) =x g' (Xo) =1+A(2 x9) =1 114022) <1 E -1 X _ _£lxsi)=0 Ku Xe mA e La os, £/4Ge,\ 2 o- Fl%e) We “EI - Kitl- xX, =- FC) hon €! i] a FN EN EN RS EE EN = DB Ye 0%... = (eo F(x) 2 ». oe ficxs) / vO SSS SFT Q\ use an _inifi sot He rol “x; ", bo estioile to new villue of fe oF, Kip aS. Xtpl = %; - FO £ xe) : 3) Gind tte absolitte celafive. ceppconitndhia, AN{O( \Ea| ag Fi = Kort = Ve x loo = Ea ls XEFT u) compare te absoluke lative pion. eypet with te pre - Soeatied Use ewror flame €. Yes Ao ? st Dy Udi esti a is [EqkN 5 4 af He rods | Wo ss Stoo He algortum . Alto, ud it te no. of dtuahins at excoedeh He marc. aunlee of _cterapiens allowes . 7 ees $3 A= (rau Cail fo _cnveme: 3. Hish accuracy - - division by q cish - 4. widely apalicable A gook | U- man coutiige do tte, wLon cook For computa’ enplemrenabion- Fo Fa vil. Birge-Vieta Method This method is based on the Newton-Raphson method to find the root of the polynomial P(x) of degree n Pa(X) = gt” + Og gx"? 40+ LX +0 Using Birge-Vieta method, Newton-Raphson form ( 1) can be transformed to the iteration (2) sei = a BA, = 01,2... (1) A au mo, k=0,1,2,.... (2) Where 1. Example Use Birge-Vieta method to find the root of the polynomial f(x)=x3+3x2-5x+1 accurate to 10? with initial point Xp = 0.5 15 Iteration a, > coefficients of the polynomial a,=b3=C3 F=Xo ye 2"4 Iteration a, > coefficients of the polynomial a3=b3=C3 3" Iteration a, > coefficients of the polynomial a3=b3=C3 4' Iteration a, > coefficients of the polynomial a3=b3=Cs = dy th xades1 Ce = De F301 | 5 | -4.2408 + 3.4265 a) coos iki bo 0.0046 {Et ~2=0: oy Sos i - STPTRISY i Aeetiin =—(+7%s1 < 0.01 K 3 2 (3) 32347 3.4694 1 )