Numerical Solution of Non-linear Equations
|
|
- Marvin Floyd
- 6 years ago
- Views:
Transcription
1 Numerical Solutio of Noliear Equatios. INTRODUCTION The most commo reallife problems are oliear ad are ot ameable to be hadled by aalytical methods to obtai solutios of a variety of mathematical problems. Iterative methods are the foremost amog the methods developed to obtai approimate solutios. The method of fidig a root of the oliear equatios of the form f () = 0 (.) where the fuctio f () may be algebraic, trascedetal or combiatio of both, plays a major role i the applicatios of mathematics as problems of such kid occur more frequetly i may scietific ad egieerig mathematical modelig. The followig equatios (i) 6 = 0 (ii) e cos = 0 (iii) si() e 5 = 0 ca be classified as follows. (i) The equatio 6 = 0 is a algebraic equatio of degree 6 havig oe root early at = (ii) The equatio e cos = 0 is a trascedetal equatio as it cotais trascedetal fuctios which has a root early about = (iii) The equatio si () e 5 = 0 is a equatio combied of both algebraic ad trascedetal fuctios ad it has a root early about = If a umber a makes the fuctio of a scalar variable, i.e., f () to zero the a is called a zero or a root of the equatio f () = 0. To obtai this root, if oe obtais iterates {,,......} startig with a iitial guess 0, the this sequece of iterates coverge to the root wheever lim a = 0 (or) lim =a. Æ Æ I this chapter, we shall study the methods of obtaiig a approimate solutio of equatios of the form (.) ad discuss the importace of each of these methods comparig with oe aother whe required, through some eamples.
2 Numerical Solutio of Noliear Equatios 5 Y y = y = e X Fig.. From the above plottig of the graphs, oe ca see that abscissa of the itersectio of two curves is aroud = 0.7. Therefore, the required approimate root of the equatio (..) is 0.7. Eample.: Obtai graphically the two real roots of the equatio = 0 Solutio: The give equatio is f () = = 0 Oe ca verify that Therefore, we have f (0) > 0, f () < 0, f () < 0, ad f (3) > 0 f (0) f () < 0, ad f () f (3) < 0 ad hece there eists roots i (0, ) ad (, 3). We ow rewrite the give equatio as 4 + = 3. 3 Let us plot the graphs for the curves y = ad y = Ê Á Ë 4 + ˆ 3 /3 o the same scale i the iterval (0, 3) with respect to the same ais formig the followig tabular values. Table y = y =
3 5 Numerical Aalysis: Iterative Methods Y y = 3 y = Fig.. X From the above plottig of the curves, we have the abscissae of poits of itersectio of the curves are ear about 0.76 ad about.96. Threrefore, the required approimate roots of the give equatio i the itervals (0, ) ad (, 3) are = 0.76 ad =.96 respectively. Eample.3: Fid a root of the equatio e = 0 correct to 3 decimal places, by usig the bisectio method. Solutio: Let f () = e Sice f (0) < 0 ad f () > 0, there is a root i the iterval (0, ). We ow form the followig table to obtai the required root o takig a = 0 ad b =. Table.3 Sl. No. a b a+ b c = f (c)
4 Sice f (0.567) < , the required root of the equatio e = 0 correct to three places of decimal is = Note.: The above computed tabulated values are rouded to 4 decimals, though the root is required correct to 3 decimal places, i order to check whether the fuctio value is less tha to obtai the root up to the desired accuracy. Remark.: If a is a real root of the equatio f () = 0 correct to N decimal places, the f (a) < N i magitude. Eample.4: Obtai the smallest positive real root of the equatio e si = 0 by bisectio method, correct to 4 decimal places. Solutio: Let f () = e si Ê ˆ sice f (0) > 0, f (0.5) > 0 ad f () < 0, the lowest root lies i the iterval Á,. Now, Ë we form the followig table to obtai the root takig a = ad b = 0.5 Table.4 Sl. No. a b a+ b c = Sice f (0.5885) = < , the root of the equatio e si = 0, correct to four decimal places is = Note.: As the width of the iterval is reduced by half at each step i the bisectio method, N bisectios will be required to have a legth of the iterval which cotais the root, is b a N. Ad, to have Numerical Solutio of Noliear Equatios 53 b a e (a small quatity as desired), oe ca easily deduce that N f (c)
5 54 Numerical Aalysis: Iterative Methods b a N l /l e Coditio (.) ca be verified for the eamples (.3) ad (.4) for e = (.).4 ITERATION METHOD The iteratio method ivolves trasformig the equatio (.) ito the form = f() (.3) ad geeratig a sequece of approimatios,, 3,...,,... to a root of the equatio (.) from the scheme + = f( ) (.4) ( = 0,,,...) Choosig a proper iitial approimatio 0. We ow state ad prove the sufficiet coditio for the covergece of the method (.4). Theorem.: If I is the iterval i which * a root of the equatio f () = 0, lies ad if f () < for all i I the the iterative method (.4) will coverge to * provided 0 is properly chose i I. Proof: If * is a root of f () = 0, the from (.3), we have * = f(*) (.5) The scheme (.4) is give by + = f ( ) (.6) where + ad are the ( + ) th ad th approimatios to * respectively. Now, subtractig (.6) from (.5), we get + * = f( ) f(*) by mea value theorem, where < < *. If we let The (.7) ca be writte as = ( *) f () (.7) f ( ) K < for all i = 0,,,... (.8) + * K * (.9) K K * K K K * ad so o Proceedig i similar maer, fially we will be left with + * K + 0 *
6 For a large, the righthad side teds to zero. Thus, + coverges to *. Hece, the proof is complete. Note.3: The iterative method (.4) has a liear rate of covergece. Eample.5: Which of the followig forms will coverge to a root of the equatio Ê pˆ 3 cos = 0 lies i Á0, Ë. Numerical Solutio of Noliear Equatios 55 (a) = cos + (b) = ( + cos )/3 Solutio: Give f () = 3 cos = 0 (.5.) Ê pˆ which has a root i Á0,. Ë (a) The equatio (.5.) is writte as = cos + = f() So that f () = (si + ) Sice f () = (si + ) Ê pˆ for ay i Á0,, the iterative method will ot coverge to a root of (.5.) Ë with this form. (b) I this case, equatio (.5.) is writte as = ( + cos )/3 = f() Now, f () = si /3 si Sice f ( ) = < Ê pˆ for all i 0, 3 Á, the iterative scheme i this case will Ë Ê coverge to a root of the equatio (.5.) by choosig ay 0 i 0, pˆ Á Ë. Eample.6: Use iterative method to fid a root of the equatio + e = 0 up to 5 decimals writig it as (a) = e (b) = ( + + e ) Solutio: Give equatio is f () = + e = 0 (.6.) Ê 3ˆ Sice f Á < 0 Ë 5 ʈ ad f Á > 0 Ë, there eists a root i the iterval Ê 3, ˆ Á Ë 5.
7 56 Numerical Aalysis: Iterative Methods (a) Here, equatio (.6.) is writte as = e = f() Now, f () = e ad f () = e < for all i ( 0.6, 0.5) The iterative scheme for the solutio of (.6.) is + = e (.6.) ( = 0,,, ) If we start with 0 = 0.6, the from (.6.) we ca obtai the followig successive approimatios. Table Hece, the required root of equatio (.6.) correct to five places of decimal is = (b) We ow solve (.6.) cosiderig the form = ( + + e ) = f() Here, f () = + + ( + ) e It ca be verified that f () = + + ( + ) e < for all i ( 0.6, 0.5) Now, takig 0 = 0.6 ad applyig the iterative scheme + = ( + + e ) (.6.3) ( = 0,,, ) the followig iterates are obtaied.
8 Numerical Solutio of Noliear Equatios 57 Table Therefore, the required root correct to 5 decimal places is = Note.4: It may be oted that the scheme (.6.3) will ot coverge to the root if we start with 0 =.5. Remark.: Smaller the value of f (), larger the rate of covergece. Defiitio.: A sequece of approimatios { 0,,,...,,...} is said to coverge to a root * of a equatio f () = 0 with rate of covergece or the order of covergece p p if * K * + for some K > 0. (.0) Defiitio.: If p is the order of the method ad is the umber of fuctioal evaluatios per iteratio by a method, the the efficiecy ide of that method is p..5 ACCELERATION OF CONVERGENCE It is always possible to accelerate the covergece of the method of iteratio (.4) by itroducig a parameter a ad etrapolatig it as + = ( a) +af( ) (or) Ô + = +a( f( ) ) Ô ( = 0,, ) (.) The improvemet of covergece majorly depeds upo the choice of the relaatio factor a subject to costraits of the give problem. The followig are some of the methods which ehace the rate of covergece of the scheme (.4)..6 WEGSTEIN S METHOD I this method, the choice of a i the scheme (.) is take as a = f( ), D= D (.) The followig steps illustrate the workig procedure of this method. Step : Choose a iitial approimatio 0 to a root of f () = 0. Step : Assig Step 3: Calculate = f( )
9 58 Numerical Aalysis: Iterative Methods f( Step 4: Fid ) D= Step 5: Fid a= D Step 6: Calculate + = + a[f( ) ] Step 7: Stop the process if + is egligible up to the tolerace. Step 8: Assig + ad go to step 3. Note.5: Whe a = or D = 0, the above method reduces to the iterative method (.4)..7 AITKEN S D METHOD If the method (.4) coverges liearly ad if f (*) K < where * is a root of (.), the from (.9) approimately we have + * = K( *) * = K( *) Solvig the above equatios for * by elimiatig K from them, we obtai Replacig * by +, we have * = + = + ( + ) + + ( D ) + (.3) D Which is the Aitke s etrapolatio method, for a liearly coverget sequeces, yields approimatios to the root * with = f( 0 ) ad = f( ). Observatio.: It is see that the method (.) will accelerate the covergece of the method (.4) if we choose a proper a i (i) (0.5 < a < ) provided < f () < 0 (ii) (a > ) provided 0 < f () < Remark.3: By Theorem (.), oe ca easily obtai the coditio for covergece of the method (.) as: + a + af () < for all i I (.4) The coditio (.4) is same as < a + af () < 0 < (or) a< (.5) f ( ) for each.
10 60 Numerical Aalysis: Iterative Methods Solutio: Give equatio is We rewrite this equatio as f () = si 6.8 = 0 = si = f() Here f () = cos Now, the iterative method for the solutio of give equatio is The Wegstei s iteratio is where si a=, D= D The Aitke s D process is + = si (.7.) ( = 0,, ) + = + a(6.8 + si ) (.7.) + = ( = 0,, ) + ( + ) + ( = 0,, ) + where = si ad + = si, whereas, the etrapolated iterative method with a=ais ˆ 6.8 si + = cos ( = 0,, ) (.7.3) (.7.4) The first 9 approimatios of these methods are tabulated hereuder takig 0 = 6 Table.7 Method (.7.) Method (.7.) Method (.7.3) + Method (.7.4)
11 Numerical Solutio of Noliear Equatios Remark.5: The true root of the equatio of eample (.7) is approimately. Comparig this value with the above tabulated approimatios, oe ca see that the etrapolated iterative method (.7.4) has a better rate of covergece for obtaiig the root of = si. Eample.8: Fid the largest root of the equatio 6 = 0 correct up to 8 places of decimal, startig with 0 = by usig: (i) Iterative method (ii) Etrapolated iterative method. Solutio: Give Which has largest root i the iterval < <. We rewrite (.8.) as Now, f ( ) = 6 5 ( + ) 6 < f() = 6 = 0 (.8.) 6 = + = f() [say] for all i (, ) The iterative method for solvig (.8.) is + = 6 + ( = 0,,, 3..) Ad the etrapolated iterative method i this case will be of the form where + = +a È 6 + Î ( = 0,,, 3 ) a = È 6 5 { ( ) /6 Í + Î } The computed results for obtaiig the root of equatio (i) are tabulated below:
12 6 Numerical Aalysis: Iterative Methods Table.8 Iterative Method Etrapolated Iterative Method a From the above tabulated values, we have the required largest root of the equatios (.8.) as = which is correct to 8 decimal places..9 METHOD OF FALSEPOSITION (OR) REGULAFALSI METHOD I this method, we eed to fid a sufficietly small iterval (a, b) i which the root of a equatio f () = 0 lies as i the case of bisectio method, so that the curve y = f () crosses the Xais i betwee = a ad = b ad also f (a) f (b) < 0. The falsepositio method is based o the priciple that ay small portio of a smooth curve is practically straight for a short distace. Takig this priciple ito cosideratio, we fit a straight lie passig through the poits P[a, f (a)] ad Q[b, f (b)] as Y y = f ( ) P [ a, f ( a)] = a = c = b Q [ b, f ( b)] X Fig..3
13 64 Numerical Aalysis: Iterative Methods Remark.7: Eve though the rate of covergece of the secat method is.6 approimately, it will fail to coverge whe f ( ) = f ( ) at ay stage. But, oce secat method coverges it will coverge more rapidly tha the RegulaFalsi method which is always guarateed to coverge. Eample.9: Solve the equatio give i eample (.8) by (i) RegulaFalsi method ad (ii) secat method to obtai the ith approimate 9 of the root with 0 = ad =. Solutio: Let f () = 6 = 0 So that f () = 6 > 0 & f () = < 0 therefore a root of the equatio lies i (, ). Takig 0 = = a, = = b, we applied the methods (.) ad (.) ad the successive approimatios up to 9 th approimate are tabulated hereuder. Table.9 C of (.) + of (.) The required root is = which is correct to 8 decimals. Oe ca see that the more rapid covergece of secat method to the root, over falsepositio method. Eample.0: Use secat method to fid a root of the equatio + e = 0 correct to 8 places of decimal, by tabulatig the computed values. Solutio: Give f () = + e = 0 (.0.) Sice f ( ) < 0 ad f (0) > 0, there eists a root i the iterval (, 0). The secat method for the solutio of (.0.) is give by + = È ( ) ÍÎ f Í f( ) f( ) where f ( ) = + e ( =,, 3...) Let us take 0 = ad = 0. The f ( 0 ) = ad f ( ) =. Now, the followig table ehibits further approimatios.
14 Numerical Solutio of Noliear Equatios 65 Table.0 + f ( + ) is Sice f ( 8 ) < , the desired root of the equatio correct to eight decimal places = NEWTONRAPHSON (NR) METHOD To derive the NewtoRaphso method for fidig a root * of the equatio f () = 0, let 0 be a iitial approimatio ad let = 0 + h where h is a small quatity, be the first approimatio to *. If 0 is chose such that 0 lies i the eighbourhood of *, the will be early equal to *. Thus, f ( ) = 0 approimately. i.e., f ( 0 + h) = 0 Epadig the above fuctio by meas of Taylor s series, oe ca have h f ( 0) + hf ( 0) + f ( 0) +...! = 0 (.3) Sice h is small eough, we ca eglect the higher order powers of h startig from h owards. Thus, from (.3), we have which gives f( 0 ) h = f ( ) 0 f ( 0 ) + hf ( 0 ) = 0 Puttig this value of h i = 0 + h, f( 0 ) we obtai = 0. f ( 0 ) Now, for a better approimatio to *, if we let = + h be the secod approimatio ad proceedig i a similar maer as above, oe ca easily obtai f( ) = f ( )
15 .. Coditio for Covergece of the NewtoRaphso Method Comparig the iterative method (.4) with the NR method (.4), Oe ca have f( ) f ( ) = (.6) f ( ) We kow that the iterative method coverges by Theorem (.), if f () < for all i I From (.6), f () = f ( ) f( ) f ( ) f( ) f ( ) = f ( ) f ( ) Therefore, the coditio for covergece of the NR method is f( ) f ( ) < for all i I. [ f ( )] (.7) Observatio.: The covergece of NR method will be faster if f () is large eough, i.e., the graph of f () is early perpedicular to the ais. Observatio.3: By Theorem (.), we ca also have the covergece of NR method provided that the iitial approimatio 0 is chose sufficietly close to the root of f () = NewtoRaphso Method has a Quadratic Covergece Let * be a root of f () = 0 such that f (*) = 0 ad let the small quatities e ad e + be the errors at th ad ( + ) th stages for the approimatios ad + respectively such that By (.8), the NR method (.4) takes the form e + + * = (or) e + = e = * ad e + = + * (.8) * e + * f( e + ) * f ( e + ) * f( +e) e * f ( +e ) Epadig the righthad side fuctio by Taylor s theorem, we have e + = e Numerical Solutio of Noliear Equatios 67 e ( ) +e ( ) + ( ) +... f ( ) +e f ( ) +... * * * f f f * * Takig f (*) = 0 ad eglectig the higher order terms of e startig from e 3 owards as e is small eough, we obtai
16 68 Numerical Aalysis: Iterative Methods e + = * * * e * e f ( ) +e f ( ) +... e f ( ) f ( ) +... f ( ) +e f ( ) * * which give us * È f ( ) e + = e Í * Î f ( ) (.9) e + µ e This relatio shows that the subsequet error is proportioal to the square of the previous error ad hece the NR method has a quadratic or secod order covergece ad its efficiecy ide is NewtoRaphso Method Algorithm Step : Choose a iitial approimatio 0 to obtai the root of f () = 0. Step : Calculate f ( 0 ) ad f ( 0 ). Step 3: Evaluate f( 0 ) = f ( ) 0 0 Step 4: If 0 is egligible up to the tolerace stop the process. Otherwise, go to step 5 Step 5: Icrease the subscripts of s by oe uit i the above 3 steps ad go to step. Eample.: Fid a root of the equatio cos e = 0 by Newto s method. Solutio: Let f () = cos e = 0 The, f () = [si + ( + ) e ] Sice f (0) > 0 ad f () < 0, there is a root i the iterval (0, ). Let us choose 0 = 0.5 The, the NR method (.4) yields For = 0, we obtai + = = = cos e + si + ( + ) e ( = 0,,.) 0.5 cos(0.5) (0.5) e si(0.5) + (0.5 + ) e =
17 70 Numerical Aalysis: Iterative Methods Eample.3: Develop NR method for fidig Square root of a umber M Reciprocal of a umber M ad fid 3 ad correct to 5 decimals. 3 Solutio: (a) The square root of a umber M is a root of the equatio M = 0. Let f () = M The, f () = From (.4), we have + = M (or) + = Ê Á Ë ( = 0,,...) Mˆ + is the Newto s formula for obtaiig square root of a umber M. (.3.) Sice 3 = 9 < 3 < 6 = 4, we take 0 = 3.5 to obtai 3. From (.3.), we have for = 0; = Ê 3ˆ Á0 + Ë 0 = for =; = Ê 3ˆ Á + Ë = for = ; we obtai 3 = Sice = 3, the square root of 3 correct to 5 decimals is (b) The reciprocal of a umber M is the root of Let f( )= M The, f ( )= M =0
18 Numerical Solutio of Noliear Equatios 7 From (.4), we obtai + = Ê ˆ Á M Ë Ê ˆ Á Ë (or) + = ( M ) (.3.) ( = 0,,,...) is the NR formula for gettig reciprocal of a umber M. Sice 0.05 = < < = 0., we choose 0 = to obtai reciprocal of for = 0, (.3.) gives us = 0 ( M 0 ) = for = ; = ( ) = for = ; 3 = Therefore, the required reciprocal of 3 correct to 5 places of decimal is SOME VARIANTS OF NEWTONRAPHSON METHOD I this sectio, we shall discuss some of variats of the NR method ad make ote of the importace of these methods over the NR method i the specific cases whe it requires, cosiderig some eamples for the compariso... Modified NewtoRaphso Method (or) VoMises Method This method cosists of fidig the slope at iitial iteratio ad obtaiig these by usig the formula + = f( ) f ( 0 ) (.30) ( = 0,, ) It ca be see from the formula (.30) that the slopes are ot calculated at each ad every iteratio as i NR method but are obtaied by drawig the parallel lies to f ( 0 ) from the poits o the curve as show i the followig figure.
19 7 Numerical Aalysis: Iterative Methods Y y = f ( ) (, y ) 0 0 Lies parallel to taget Taget of f( ) at ( 0, y0) 0 X Fig..6 Note.8: The VoMises method is useful i the cases whe the evaluatio of f () at every iteratio requires a large amout of computatioal time ad i such cases this modified NR method takes less computatioal time tha the NR method... Higher Order Newto s Method (or) Halley s Method I sectio (.), we have obtaied the value of h to get = 0 + h by eglectig the higher powers of h startig from the secod degree term owards as h = f( 0 ) (.3) f ( ) If we eglect the terms i (.3) from h 3 powers owards, we get Now, h = = 0 f( 0 ) h f ( 0) + f ( 0) f( ) f( 0) f ( 0) f ( 0 ) f ( ) 0 by (.3) (.3) I geeral, = + = 0 f( ) f( 0) f ( 0) f ( 0 ) f ( ) f( ) f( ) f ( ) f ( ) f ( ) ( = 0,, ) which is the Halley s method havig third order covergece. 0 (.33)
20 74 Numerical Aalysis: Iterative Methods From (.30), we have + = 3 3 (.4.) ( = 0,,,...) Let 0 =.5. The, f ( 0 ) = 5.75 The followig approimatios are obtaied by applyig the VoMises formula (.4.). Table. = = = = = = = = = = = = = = = = Sice 5 = 6, the required root of equatios (.4.) is , which is correct to 8 decimal places. Eample.5: Solve the problem give i eample (.4) by usig Halley s method. Solutio: Give f () = 3 = 0 (.5.) The f () = 3 ad f () = 6 The Halley s method (.33) for the solutio of (.5.) is f( ) f ( ) + = f( ) f ( ) f ( ) ( = 0,,,...) Usig this formula with 0 =.5, we obtaied the followig approimatios =.37539, = = , 4 = Sice 3 = 4, the desired root of the equatio is = (.5.) Eample.6: Solve 3 0 = 0 to obtai a root by usig etrapolated NR method. Solutio: Give f () = 3 0 So f () = 3 ad f () = 6
21 The etrapolated NR method (.39) i this case takes the form + = 3 ( 0) ( 0) (6 ) (3 ) 3 (3 ) ( = 0,,, 3...) Sice f () < 0 ad f (3) > 0, there is root i the iterval (, 3). Let us choose 0 =.5 The, the above formula gives us the followig successive approimatios. = , = = , 4 = Therefore, the root of the equatio is 3 = which is correct to 0 places of decimal as error reduces cubically i this method..3 NEWTONRAPHSON METHOD FOR MULTIPLE ROOTS (OR) GENERALIZED NEWTONRAPHSON (GNR) METHOD If * is a root of the equatio f () = 0 with multiplicity m > the f () ca be epressed as f () = ( *) m g() (.40) where g () is bouded ad g (*) π 0 ad f (*) = f (*) = f (*) =... = f (m ) (*) = 0 & f (m) (*) π 0 The geeralized NR method i the case of (.34) is defied by + = f( ) ( ) m f which is the NR method for multiple roots havig secod order covergece..4 GENERALIZED EXTRAPOLATED NEWTONRAPHSON (GENR) METHOD (.4) If h is a root of (.) with multiplicity m, the the geeralized NewtoRaphso method is defied as f( ) + = m (.4) f ( ) ( = 0,, ) Numerical Solutio of Noliear Equatios 75 We develop geeralized etrapolated NewtoRaphso (GENR) method by itroducig computatioal parameters a of the form + = ( a ) + a * + (.43) where * + is + of the geeralized NR method (.4).
22 76 Numerical Aalysis: Iterative Methods Now the GENR method for multiple roots of equatio (.) ca be defied as + = f( ) ( ) ma f.4. Covergece Criteria of GENR Method (.44) As it is well kow that ay iterative method of the form + = f( ) coverges if f ( ) < for all i I. Hece, the method (.44) coverges uder the coditio where m = ma + ma w < for all i I (.45) w = f( ) f ( ) [ f ( )] The fuctio f () i the immediate eighbourhood of = h, ca be writte as f () = k ( h) m where k k(h) is effectively costat. The, f () = k m( h) m (.46) We thus have f( ) f ( ) [ f ( )] f () = k m(m ) ( h) m = m m k km m m ( h) ( )( h) = km h m m [ ( ) ] (.47) We eed to fid a real value of a for each iteratio, which miimizes m of (.45). Sice w of (.46) is positive ad real for all, as oted i the Remark.4 i the immediate viciity of h, we have i geeral m m f( ) f ( ) w [ f ( )] (.48) ( = 0,, ) The process of miimizig m of (.45) keepig i view of (.47) with respect to a, gives the optimal choice for a as ma = fi a = Êm ff ˆ + Ë Á m [ f ] m+ mw ( = 0,, ) (.49)
23 With this optimal choice of a, m of (.45) takes the form Numerical Solutio of Noliear Equatios 77 m = w m + m m+ mw m+ mw = m+ mw m+ mw m+ mw = m( w ) + m( w ) (.50) Which is always less tha uity as log as w of (.46) less tha oe i magitude ad hece the covergece of the GENR method (.44) is assured. Note.9: It ca be see the GENR method (.44) with the choice of a of (.49) i the case whe m = takes the form + = f( ) f( ) f ( ) f ( ) [ f ( ) ] ( = 0,, ) (.5) which is the cubic covergece higher order Newto s method for fidig a simple root of the equatio (.)..4. Rate of Covergece of Geeralized Etrapolated NewtoRaphso Method Let h be the multiple root of the equatio f () = 0 ad e +, e be errors whe +, are the ( + ) th ad th approimates. The, + = h + e +, = h + e (.5) Substitutig these values of + ad i (.44), we have from (.49) f e + = e m ff f m+ m f [ ] ff = e Êm + ˆ [ Á f ] ff Ë m
24 Numerical Solutio of Noliear Equatios 79 È iv 3 Ê f ˆ Ê f ˆ (ii) Whe m = e + µe Í 4 Á Ë f 4 Á Ë f Í Î È iv v 3 Ê f ˆ Ê f ˆ (iii) Whe m = 3 e + µe Í 59 Á Ë f 60 Á Ë f Í Î I geeral, oe ca have e + µ e 3 k where ( m+ ) ( m+ ) Ê f ˆ Ê f ˆ k = ká k m m Ë f Á Ë f where k ad k are costats. Hece, the GENR method has a cubic rate of covergece. Eample.7: Fid the double root of the equatio 3 + = 0 startig with 0 = 0 by GNR method. Solutio: Let f () = The, f () = 3 3 For m =, the GNR method give as + = ( ) ( = 0,,, 3,...) Startig with 0 = 0, we obtai the followig approimatios. = , = = , 4 = Therefore, the required double root of the equatio is which is almost close to the actual double root = of the give equatio. Eample.8: Solve eample.7 by usig the GENR method. Solutio: Let f () = The, f () = 3 3 ad f () = 6 The GENR method (.44) i this case takes the form + = 4 f( ) f ( ) 3 f ( ) f( ) f ( ) (.8.)
25 80 Numerical Aalysis: Iterative Methods For the give problem, (.8.) gives us + = 4( 3 + ) (3 3) 7( ) ( 3 ) (.8.) ( = 0,,,...) If we choose 0 = 0, the oe ca have the followig successive iterates from (.8.) = , = , 3 = Therefore, the double root of the equatio is =. Eample.9: Fid the triple root of = 0 correct to si places of decimal, usig the GENR method. Solutio: Give f () = fi f () = , f () = The GENR method (.44) i this case takes the form + = For the give problem, (.9.) gives us 6 f( ) f ( ) 4[ f ( )] 3 f( ) f ( ) (.9.) ( ) ( ) + = È( ) 4 3 4( ) 3 Í 3 ÍÎ ( ) ( = 0,,,...) (.9.) Usig this formula (.9.) with 0 =, we obtaied the followig approimatios = , = , 3 = Sice the differece betwee d ad 3 rd approimatios are less tha , the required solutio is = TWOSTEP ITERATIVE METHODS FOR SOLVING NONLINEAR EQUATIONS I this sectio, we discuss a twostep iterative methods for solvig oliear equatios of the form (.)..5. Accelerated Iterative Method Let a be the eact root of the equatio (.) i a ope iterval D i which f () is cotiuous ad has well defied first derivative ad let be the th approimate to the root of (.), the
26 8 Numerical Aalysis: Iterative Methods Takig a i (.53) as ( + ) th approimate to the root, from (.53) ad (.60), the twostep accelerated iterative method ca be defied as follows. (i) Calculate f( ) y = (.6) f ( ) (ii) Obtai È Í f( ) Í + = Í f ( ) Í Ê 4 f( y ) ˆ Í+ Í Á f( ) Î Ë ( = 0,,...) (.63) This method is free from the secod derivative ad requires two fuctioal evaluatios ad oe of its first derivatives. The efficiecy ide of this method is Covergece Criteria of Accelerated Iterative Method If a is the root ad is the th approimate to the root, the epadig f ( ) about a usig Taylor s epasio, we have f ( ) = where = e e e e ( ) ( ) ( ) ( ) ( ) ( ) ( )! 3! 4! 5! iv v 6 f a + f a e + f a + f a + f a + f a + Oe iv v È f ( a) f ( a) 3 f ( a) 4 f ( a) 5 6 f ( a ) Íe + e + e + e + e + Oe ( ) Î! f ( a) 3! f ( a) 4! f ( a) 5! f ( a) f ( a ) È Îe + c e + c e + c e + c e + O( e ) (.64) = c j j f ( a) =, ( j =, 3, 4 ) j! f ( a) f ( ) = f ( a )[+ c e + 3c e + 4c e + 5 c e + O( e )] (.65) ad, Now, f( ) f e c e (c c ) e (3c 7c c 4 c ) e O( e ) ( ) = + + From (.53), (.6) ad (.66), we have (.66) y =a+ c e + (c c ) e + (3c 7c c + 4 c ) e + O( e ) (.67) f( y) = f ( a)[ ce (c c) e (7cc 5c 3 c) e + Oe ( ) (.68)
27 84 Numerical Aalysis: Iterative Methods Thus, È f( ) f( y) Í Ê ˆ + 4 f ( ) Í Á Ë f( ) ÍÎ [ e c e (c c ) e (3c 7c c + 4 c ) e + O( e )] = [ ( ) (6 4 3 ) ( )] ce + c c3 e + cc3 c c4 e + O e = e c e (c c ) e (3c 7c c + 4 c ) e + O( e ) [ { c e + (c c ) e + (4c + 3c 6 c c ) e + O( e )] = [ e ce (c3 c) e (3c4 7cc3 + 4 c) e + O( e)] 3 3 [ + ce + (c3 c) e + (4c+ 3c46 cc3) e + ( c e + (c c ) e + c (c c ) e + c (4c + 3c 6 c c ) e + ( c e + c (c c ) e + c (c c ) e ce 4 4 ] = e c e (c c ) e (3c 7c c + 4 c ) e + O( e ) [ + + ( ) + ( ) + ( )] ce c3 c e c c4 cc3 cc3 c c e O e = [ e + c e + c e c e + ( c + 3c 6 c c ) e ce ce ( cc3 c) e (c3 c) e c(c3 c) e (3c4 7cc 3 4 c) e Oe ( )] = [ e + ( c c ) e + (c c c + c c ) e + (c c 4c + c + 3c 3c + 7 ) + (e )] cc 3 cc 3 cc 3 cc 3 e O = e + ( cc c) e + Oe ( ) (.73) From (.53), (.63) ad (.73), we have the rate of covergece of the method (.63) is four..5.3 Variat of Acccelerated Iterative Method By epadig f( y ) appearig i the deomiator of the method (.63), we obtai 4 f ( ) + = Ï Ô f( ) Ô Ì 3 f ( ) Ô ÔÏ f( y) Ê f( y) ˆ Ê f( y) ˆ Ô Ô Ô Ì +... f( ) Á f( ) + Á + f( ) Ô Ô Ô Ë Ë Ó Ó Ô Ô Ô Ô (.74)
28 Numerical Solutio of Noliear Equatios 85 Ad, the above further yields + = 3 f( ) È f( y ) Ê f( y ) ˆ Ê f( y ) ˆ Í 5... Î f ( ) f( ) Á Ë f( ) Á Ë f( ) Í (.75) Cosiderig up to the first ad secod degree terms of the above epressio lyig withi the brackets of the formula (.75), the twostep variat of accelerated iterative method is defied by (i) Calculate y (ii) Obtai f( ) = f ( ) f( ) È f( y ) Ê f( y ) ˆ Í Î + = + + f ( ) f( ) Á Ë f( ) Í ( = 0,,...).5.4 Covergece Criteria of Variat of Accelerated Iterative Method As doe i sectio (.5.), oe ca easily obtai the error relatio as which gives us a + e + = a+ e [ e + ( cc 3 5 c) e + O(e ) +...] (.76) e + µ e 4 (.77) Therefore, the method (.76) has fourth order covergece. Note.0: If we eglect the secod degree term lyig withi the brackets of the variat of accelerated iterative method, oe will be left with the formula + = which has cubic rate of covergece. f( ) È f( y ) Í + f ( ) Î f( ).5.5 TwoStep Etrapolated NewtoRaphso (ENR) Method (.78) Let a be the eact root of the equatio (.) i a ope iterval D i which f () is cotiuous ad has well defied first derivative ad let be the th approimate to the root of (.) If we let y = + h (.79) where h = f( ) f ( )
29 Numerical Solutio of Noliear Equatios 87 iv v È f ( a) f ( a) 3 f ( a) 4 f ( a) 5 6 = f ( a ) Íe + e + e + e + e + Oe ( ) Î! f ( a) 3! f ( a) 4! f ( a) 5! f ( a) = f ( a ) È Îe + ce + ce + ce + ce + Oe ( ) (.85) f ( ) = f ( a ) È Î+ ce + 3ce + 4ce + 5 ce + Oe ( ) (.86) ad j f ( a) c j = j! f ( a) where (j =, 3, 4 ) Now, from (.80) ad (.8), we obtai ad ad f( ) e c e (c c ) e (3c 7c c 4 c ) e O( e ) = f ( ) From (.83), (.84) ad (.87), we have y =a + c e + (c c ) e + (3c 7c c + 4 c ) e + O( e ) (.87) f (y ) = f ( a)[ ce (c c3) e (7cc 3 5c 3 c4) e + Oe ( ) (.88) From (.84) ad (.88), we have f ( ) f (y ) = f ( a ) [ e + ( c c3) e + (7cc 3 5c c4) e + Oe ( )] (.89) f( ) f( ) f( y ) Fially, With (.9), (.8) yields = È Î + ce + c3e + c4e + c5e + O( e) [ e + ( c c) e + (7cc 5c c) e + Oe ( )] = + c e + (c c ) e + (3c + 3c 6 c c ) e + O( e )] (.90) È f( ) f( ) Í Î f( ) f( y) f ( ) e + = c e 3 + O(e 4 ) = e ce Oe ( ) 3 4 Which shows that the method (.8) has third order covergece..5.7 TwoStep Derivative Free Etrapolated Newto s Method (.9) As it is kow that the backward differece approimatio for the first derivative for f () at is f () ª f ( ) f ( h ) (.9) h
30 Numerical Solutio of Noliear Equatios 89 ad, f ( f ( )) = ( c+ c) e + ( cc 3 cc + c) e ( cc + 3cc + cc 4cc c + c) e ( c + c( c + cc ) 5cc 5cc (.98) Subtractig (.96) from (.98), we get f ( ) f ( f ( )) + 6cc 4cc + cc + 6ccc 3 ccc) e + Oe ( ) ce + ( cc + 3 cc) e + ( cc 3cc cc + 4cc + c ) e (.99) = ( c( c + cc ) + 5cc + 5cc 6cc cc cc 6ccc + 3 ccc) e + Oe ( ) [ f( )] = [ ce + ce + ce + ce + ce + Oe ( )] Also = ce + cce + ( c + cc) e + (cc + cc ) e (.00) From (.99) ad (.00), we get [ f( )] ce + cce + ( c + cc) e + (cc + cc ) e + Oe ( ) = f( ) f( f( )) { ce ( cc 3 cc) e ( cc 3cc cc 4cc c ) e c 3 + ( c( c + cc) + 5cc + 5cc 6cc + 4cc 4 cc 6ccc + 3c cc ) e 4 + Oe ( 5 )} ( c + cc ) (cc + cc ) e + e + e + e c c c 3 cc cc cc 3 cc 3 cc + cc 3 + c e c c cc 4 6ccc 3 3 ccc 3) 3 e c = Ï ( + 3 ) ( 3 4 ) Ô + + eô Ô Ô Ô È( c( c + cc ) + 5cc + 5cc 6cc + 4cc Ô Ì Í Ô Í Oe ( Í 4 ) Ô Ô Ô Ô Í Ô ÔÓ ÍÎ Ô = c È c cc cc cc ( + 3) 3 ( 3+ 4) 4 Íe + e + e + e Î c c c 3 È Ï( cc + 3 cc ) ( cc 3 3cc 3 cc + 4cc 3 + c) Í Ì e + e c c Í Ó Í 3 ( cc 3 cc ) ( cc + 3 cc )( cc 3 3cc 3 cc + 4cc 3 + c) Í e + e 4 4 ÍÎ c c
31 Numerical Solutio of Noliear Equatios È Êc ˆ (3cc 3 cc 3cc cc 3 + cc ) 3 + Á c e e Oe ( 4 ) c + ÍÎ Ë c with (.05), (.95) ad (.96) oe ca have È c Ê ˆ 3 e + + a = e +a e + e c Á c ÍÎ Ë which yields (.05) (.06) e + µ e 3 which shows the method (.94) has cubic covergece. Eample.0: Fid a root of the equatio = 0 which is ear about = by usig the twostep accelerated iterative method tabulatig all computatios. Solutio: Let f () = the f () = The twostep accelerated iteratio method is give by where + = y = È Í f( ) Í Í f ( ) Í Ê 4 f( y ) ˆ Í+ Í Á f( ) Î Ë ( = 0,,.) Takig the iitial guess 0 as uity, the computatios for obtaiig the solutio of the give equatio usig the above method are tabulated below: Table.3 f ( ) f ( ) y f (y ) f( y ) 4 f ( ) From the above tabulated results, we thus have the required root of the equatio as =
32 9 Numerical Aalysis: Iterative Methods Eample.: Obtai a root of the equatio e 3 + = 0 tabulatig all computatios, by usig the twostep variat of accelerated iterative method, takig 0 =. Solutio: Let f () = e 3 + The, f () = e 3 The variat of accelerated iterative method is give by where y e = e = f( ) È f( y ) Ê f( y ) ˆ Í Î + + f ( ) f( ) Á Ë f( ) Í ( = 0,, ) Takig 0 = ad applyig the above scheme, the successive approimatios are tabulated below: Table.4 f ( ) f ( ) y f (y ) From the above table, we have the required root = Eample.: Solve si () + = 0 with 0 = 5, by usig (i) Twostep accelerated iterative method (.63) (ii) Variat of twostep accelerated iterative method (.76). Tabulate all computatios. Solutio: (i) with 0 = 5, the computatios of accelerated iterative method are give below: Table.5 f ( ) f ( ) y f (y ) f( y ) 4 f ( )
33 94 Numerical Aalysis: Iterative Methods EXERCISES. Fid graphically the positive root of the equatio = 0. Usig graphical method, fid a approimate root of the equatio = si. 3. Fid the positive real root of the equatio log 0 =. usig bisectio method. 4. By usig bisectio method, fid a approimate root of the equatio si = that lies betwee = ad =.5. Carry out computatios to obtai the root correct to 3 decimals. 5. Fid by the iteratio method, the root ear 3.8 of the equatio log 0 = 7 correct to four decimal places. 6. Solve = + ta by iteratio method. 7. By the Wegstei s method, fid the root of the equatio 3 5 = 0 that is ear about =, correct to 3 decimal places. 8. Fid a real root of cos = 3 by Wegstei s method correct to three decimal places. 9. Fid a root of cos e = 0 correct to 3 decimal places by Aitke s D method, with 0 = Perform Aitke s D process to obtai the root of the equatio + = si + after 3 approimatios to the root are available which are obtaied by iteratio method takig =. How may Aitke D process iteratios are required to obtai the root correct to 6 decimals.. Fid the root of the equatio si = + 3 betwee ad by etrapolated iteratio method, correct to 3 decimal places.. Fid the real root of + log = 0 by etrapolated iteratio method, correct to 5 decimals places. 3. Solve 3 = + 5 for a positive root by etrapolated iteratio method. 4. Fid the real root of the equatio 3 + si e = 0 by the method of falsepositio method correct to four decimal places. 5. Fid all real zeros of the fuctio f () = by RegulaFalsi method. 6. A real root of the equatio f () = = 0 lies i the iterval (0, ). Perform four iteratios of the secat method. 7. Computer the root of the equatio e = i the iterval (0, ) usig the secat method correct to three decimal places. 8. Fid a root of e si = usig NR method correct to 3 decimal places. 9. Usig the NR method, fid the root of the equatio e = 3 that lies betwee 0 ad, correct to 6 decimal places. 0. Fid all real zeros of f () = by NR method.
34 96 Numerical Aalysis: Iterative Methods (iv) Fid the positive root of si + = 0 correct to three decimal places. (v) Fid the real root of the equatio e 4 = 0 correct to three decimals. (vi) Fid the real root of the equatio cos e = 0 correct to three decimals. (vii) Fid a real root of the equatio 3 + si e = 0 correct to four decimal places. (viii) Fid a real root of the equatio e 3 + = 0 correct to three decimal places. (i) Fid the approimate root of 4 0 = 0 give that the root lies betwee.8 ad correct to four decimals. () Fid the real root of the equatio 3 = cos + correct to four decimal places. (i) Fid root of the equatio e si + 3 cos + 5 = 0 correct to four decimal places, give that root lies betwee 0 ad. (ii) Fid to four places of decimal, the smallest root of the equatio e = si. (iii) Fid the root of the equatio si = + 3 betwee ad correct to 3 places of decimal. (iv) Fid a real root of + log = 0 correct to 5 decimals. (v) Fid real root of the equatio cos = 0 correct to three decimal places. (vi) Compute the root of the equatio e three decimal places. = i the iterval (0, ) correct to (vii) ʈ Compute the root of the equatio si Á Ë correct to four decimals. = 0 i the iterval [, ] ad (viii) Solve the cubic = 0 usig =.5 & = correct up to four decimals. (i) Obtai a root of the equatio = 0 usig iitial values ad.5. () The equatio = 0 has two roots close to =, fid these roots to four decimal places. (i) Fid the double root of 3 + = 0 close to 0.8. (ii) Obtai a root, correct to three decimal places for equatio = 0. (iii) Compute the positive root of 3 8 = 0 correct to two decimal places. (iv) Fid a real root of the equatio e si cos si + 8 = 0 correct to three decimal places. (v) Fid a real root of = 0 correct to 4 decimal places. (vi) Fid the root of the equatio e = cos correct to four decimal places. (vii) Fid all real zeros of the fuctio f () = correct to four decimals (viii) Fid the smallest positive root of e = 0 correct to three decimal places. (i) Fid the root of the equatio log +.5 = 0 startig from =, =.50 compute up to 3 decimals. () Fid the fourth root of 3 correct to three decimal places.
35 98 Numerical Aalysis: Iterative Methods Equatio Iitial guess No. of iteratios take by * f () = 0 0 Method.8 Method.94 Root () e cos = () e si = (3) e.5 ta = (i) (ii).0 (iii) 0.6 (iv).404 (v) (vi) 0.55 (vii) (viii) 0.57 (i).8555 () (i).076 (ii) (iii).49 (iv).5574 (v) (vi).49 (vii).9337 (viii).00 (i).965 ().40,.7684 (i) (ii).05 (iii).33 (iv) or 4.6 (v).6875 (vi) (vii).8794, 0.657, 0.53 (viii) (i).359 ().378 (i) (ii) 3.340,.697, (iii) (iv).8 (v).54 (vi).33 (vii).73 (viii).395 (i).4 (l).933 (li) 3.30 (lii) 0.69 (liii) 3. (liv).93
Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationTwo-step Extrapolated Newton s Method with High Efficiency Index
Jour of Adv Research i Damical & Cotrol Systems Vol. 9 No. 017 Two-step Etrapolated Newto s Method with High Efficiecy Ide V.B. Kumar Vatti Dept. of Egieerig Mathematics Adhra Uiversity Visakhapatam Idia.
More informationCS537. Numerical Analysis and Computing
CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be
More informationCS321. Numerical Analysis and Computing
CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationNotes on iteration and Newton s method. Iteration
Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f
More information-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION
NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective
More informationENGI 9420 Lecture Notes 3 - Numerical Methods Page 3.01
ENGI 940 Lecture Notes 3 - Numerical Methods Page 3.0 3. Numerical Methods The majority of equatios of iterest i actual practice do ot admit ay aalytic solutio. Eve equatios as simple as = e ad I = e d
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationSection A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics
X0/70 NATIONAL QUALIFICATIONS 005 MONDAY, MAY.00 PM 4.00 PM APPLIED MATHEMATICS ADVANCED HIGHER Numerical Aalysis Read carefully. Calculators may be used i this paper.. Cadidates should aswer all questios.
More informationSolving a Nonlinear Equation Using a New Two-Step Derivative Free Iterative Methods
Applied ad Computatioal Mathematics 07; 6(6): 38-4 http://www.sciecepublishiggroup.com/j/acm doi: 0.648/j.acm.070606. ISSN: 38-5605 (Prit); ISSN: 38-563 (Olie) Solvig a Noliear Equatio Usig a New Two-Step
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationSome Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations
Copyright, Darbose Iteratioal Joural o Applied Mathematics ad Computatio Volume (), pp -6, 9 http//: ijamc.darbose.com Some Variats o Newto's Method with Fith-Order ad Fourth-Order Covergece or Solvig
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationMathematics Extension 1
016 Bored of Studies Trial Eamiatios Mathematics Etesio 1 3 rd ctober 016 Geeral Istructios Total Marks 70 Readig time 5 miutes Workig time hours Write usig black or blue pe Black pe is preferred Board-approved
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More informationRoot Finding COS 323
Root Fidig COS 323 Remider Sig up for Piazza Assigmet 0 is posted, due Tue 9/25 Last time.. Floatig poit umbers ad precisio Machie epsilo Sources of error Sesitivity ad coditioig Stability ad accuracy
More informationChapter 2: Numerical Methods
Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,
More informationSOLUTIONS OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
96 Egieerig Mathematics through Applicatios 5 SOLUTIONS OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS aaaaa 5. INTRODUCTION The equatios of the form f() = 0 where f() is purely a polyomial i. e.g. 6 4 3 =
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationx x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,
Math Activity 9( Due with Fial Eam) Usig first ad secod Taylor polyomials with remaider, show that for, 8 Usig a secod Taylor polyomial with remaider, fid the best costat C so that for, C 9 The th Derivative
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationFundamental Concepts: Surfaces and Curves
UNDAMENTAL CONCEPTS: SURACES AND CURVES CHAPTER udametal Cocepts: Surfaces ad Curves. INTRODUCTION This chapter describes two geometrical objects, vi., surfaces ad curves because the pla a ver importat
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationAP Calculus BC Review Applications of Derivatives (Chapter 4) and f,
AP alculus B Review Applicatios of Derivatives (hapter ) Thigs to Kow ad Be Able to Do Defiitios of the followig i terms of derivatives, ad how to fid them: critical poit, global miima/maima, local (relative)
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More information(a) (b) All real numbers. (c) All real numbers. (d) None. to show the. (a) 3. (b) [ 7, 1) (c) ( 7, 1) (d) At x = 7. (a) (b)
Chapter 0 Review 597. E; a ( + )( + ) + + S S + S + + + + + + S lim + l. D; a diverges by the Itegral l k Test sice d lim [(l ) ], so k l ( ) does ot coverge absolutely. But it coverges by the Alteratig
More informationTopic 9 - Taylor and MacLaurin Series
Topic 9 - Taylor ad MacLauri Series A. Taylors Theorem. The use o power series is very commo i uctioal aalysis i act may useul ad commoly used uctios ca be writte as a power series ad this remarkable result
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More informationRoot Finding COS 323
Root Fidig COS 33 Why Root Fidig? Solve or i ay equatio: b where? id root o g b 0 Might ot be able to solve or directly e.g., e -0. si3-0.5 Evaluatig might itsel require solvig a dieretial equatio, ruig
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationSOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.
SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationZ ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew
Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationU8L1: Sec Equations of Lines in R 2
MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationInternational Journal of Mathematical Archive-4(9), 2013, 1-5 Available online through ISSN
Iteratioal Joural o Matheatical Archive-4(9), 03, -5 Available olie through www.ija.io ISSN 9 5046 THE CUBIC RATE OF CONVERGENCE OF GENERALIZED EXTRAPOLATED NEWTON RAPHSON METHOD FOR SOLVING NONLINEAR
More informationAlgebra II Notes Unit Seven: Powers, Roots, and Radicals
Syllabus Objectives: 7. The studets will use properties of ratioal epoets to simplify ad evaluate epressios. 7.8 The studet will solve equatios cotaiig radicals or ratioal epoets. b a, the b is the radical.
More informationMIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS
MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will
More informationCastiel, Supernatural, Season 6, Episode 18
13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationTEACHING THE IDEAS BEHIND POWER SERIES. Advanced Placement Specialty Conference. LIN McMULLIN. Presented by
Advaced Placemet Specialty Coferece TEACHING THE IDEAS BEHIND POWER SERIES Preseted by LIN McMULLIN Sequeces ad Series i Precalculus Power Series Itervals of Covergece & Covergece Tests Error Bouds Geometric
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More information(c) Write, but do not evaluate, an integral expression for the volume of the solid generated when R is
Calculus BC Fial Review Name: Revised 7 EXAM Date: Tuesday, May 9 Remiders:. Put ew batteries i your calculator. Make sure your calculator is i RADIAN mode.. Get a good ight s sleep. Eat breakfast. Brig:
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationMATHEMATICS. 61. The differential equation representing the family of curves where c is a positive parameter, is of
MATHEMATICS 6 The differetial equatio represetig the family of curves where c is a positive parameter, is of Order Order Degree (d) Degree (a,c) Give curve is y c ( c) Differetiate wrt, y c c y Hece differetial
More informationx x x 2x x N ( ) p NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS By Newton-Raphson formula
NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS. If g( is cotiuous i [a,b], te uder wat coditio te iterative (or iteratio metod = g( as a uique solutio i [a,b]? '( i [a,b].. Wat
More informationResearch Article A New Second-Order Iteration Method for Solving Nonlinear Equations
Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif
More information+ {JEE Advace 03} Sept 0 Name: Batch (Day) Phoe No. IT IS NOT ENOUGH TO HAVE A GOOD MIND, THE MAIN THING IS TO USE IT WELL Marks: 00. If A (α, β) = (a) A( α, β) = A( α, β) (c) Adj (A ( α, β)) = Sol : We
More informationTopic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist.
Topic 5 [44 marks] 1a (i) Fid the rage of values of for which eists 1 Write dow the value of i terms of 1, whe it does eist Fid the solutio to the differetial equatio 1b give that y = 1 whe = π (cos si
More informationENGI Series Page 6-01
ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,
More informationHigher-order iterative methods by using Householder's method for solving certain nonlinear equations
Math Sci Lett, No, 7- ( 7 Mathematical Sciece Letters A Iteratioal Joural http://dxdoiorg/785/msl/5 Higher-order iterative methods by usig Householder's method for solvig certai oliear equatios Waseem
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationSIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
QUESTION BANK 8 SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayaavaam Road 5758 QUESTION BANK (DESCRIPTIVE Subject with Code : (6HS6 Course & Brach: B.Tech AG Year & Sem: II-B.Tech& I-Sem
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationMaximum and Minimum Values
Sec 4.1 Maimum ad Miimum Values A. Absolute Maimum or Miimum / Etreme Values A fuctio Similarly, f has a Absolute Maimum at c if c f f has a Absolute Miimum at c if c f f for every poit i the domai. f
More informationSome New Iterative Methods for Solving Nonlinear Equations
World Applied Scieces Joural 0 (6): 870-874, 01 ISSN 1818-495 IDOSI Publicatios, 01 DOI: 10.589/idosi.wasj.01.0.06.830 Some New Iterative Methods for Solvig Noliear Equatios Muhammad Aslam Noor, Khalida
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More information( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!
.8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has
More informationTaylor Series (BC Only)
Studet Study Sessio Taylor Series (BC Oly) Taylor series provide a way to fid a polyomial look-alike to a o-polyomial fuctio. This is doe by a specific formula show below (which should be memorized): Taylor
More informationSubject: Differential Equations & Mathematical Modeling -III. Lesson: Power series solutions of Differential Equations. about ordinary points
Power series solutio of Differetial equatios about ordiary poits Subject: Differetial Equatios & Mathematical Modelig -III Lesso: Power series solutios of Differetial Equatios about ordiary poits Lesso
More informationMATH 10550, EXAM 3 SOLUTIONS
MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,
More informationSubject: Differential Equations & Mathematical Modeling-III
Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso
More informationCalculus with Analytic Geometry 2
Calculus with Aalytic Geometry Fial Eam Study Guide ad Sample Problems Solutios The date for the fial eam is December, 7, 4-6:3p.m. BU Note. The fial eam will cosist of eercises, ad some theoretical questios,
More informationf(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim
Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =
More information18.440, March 9, Stirling s formula
Stirlig s formula 8.44, March 9, 9 The factorial fuctio! is importat i evaluatig biomial, hypergeometric, ad other probabilities. If is ot too large,! ca be computed directly, by calculators or computers.
More information1. (25 points) Use the limit definition of the definite integral and the sum formulas 1 to compute
Math, Calculus II Fial Eam Solutios. 5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute 4 d. The check your aswer usig the Evaluatio Theorem. ) ) Solutio: I this itegral,
More information, 4 is the second term U 2
Balliteer Istitute 995-00 wwwleavigcertsolutioscom Leavig Cert Higher Maths Sequeces ad Series A sequece is a array of elemets seperated by commas E,,7,0,, The elemets are called the terms of the sequece
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This
More informationU8L1: Sec Equations of Lines in R 2
MCVU Thursda Ma, Review of Equatios of a Straight Lie (-D) U8L Sec. 8.9. Equatios of Lies i R Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationExample 2. Find the upper bound for the remainder for the approximation from Example 1.
Lesso 8- Error Approimatios 0 Alteratig Series Remaider: For a coverget alteratig series whe approimatig the sum of a series by usig oly the first terms, the error will be less tha or equal to the absolute
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationCHAPTER 1 SEQUENCES AND INFINITE SERIES
CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationSEQUENCE AND SERIES NCERT
9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of
More informationμ are complex parameters. Other
A New Numerical Itegrator for the Solutio of Iitial Value Problems i Ordiary Differetial Equatios. J. Suday * ad M.R. Odekule Departmet of Mathematical Scieces, Adamawa State Uiversity, Mubi, Nigeria.
More informationPhysics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing
Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals
More information10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.
0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece
More informationy = f x x 1. If f x = e 2x tan -1 x, then f 1 = e 2 2 e 2 p C e 2 D e 2 p+1 4
. If f = e ta -, the f = e e p e e p e p+ 4 f = e ta -, so f = e ta - + e, so + f = e p + e = e p + e or f = e p + 4. The slope of the lie taget to the curve - + = at the poit, - is - 5 Differetiate -
More informationSolutions to quizzes Math Spring 2007
to quizzes Math 4- Sprig 7 Name: Sectio:. Quiz a) x + x dx b) l x dx a) x + dx x x / + x / dx (/3)x 3/ + x / + c. b) Set u l x, dv dx. The du /x ad v x. By Itegratio by Parts, x(/x)dx x l x x + c. l x
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationFind a formula for the exponential function whose graph is given , 1 2,16 1, 6
Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More information