Root Finding

Size: px
Start display at page:

Download "Root Finding"

Transcription

1 Root Fndng

2 What s Computer Scence? Computer scence s a dscplne that spans theory and practce. It requres thnkng both n abstract terms and n concrete terms. The practcal sde o computng can be seen everywhere. Computer scence also has strong connectons to other dscplnes. Source:

3 What s Computer Scence? Computer Scence s practced by mathematcans, scentsts and engneers. Mathematcs, the orgns o Computer Scence, provdes reason and logc. Scence provdes the methodology or learnng and renement. Engneerng provdes the technques or buldng hardware and sotware. Source:

4 Numercal Computng/Analyss s the study o algorthms that use numercal appromaton (as opposed to general symbolc manpulatons) or the problems o mathematcal analyss.

5 Root Fndng Gven a real valued uncton o one varable (say ), the dea s to nd an such that: () =

6 Root Fndng Eamples ) Fnd real such that: ) Agan: 3) Agan: tanh 3 0 cos 2 0 Observatons on, 2 and 3?? (two are trck questons)

7 Root Fndng Eamples สมการต วแปรเด ยว = () () = + => root (*) = 0 => * = 0- = - สมการต วแปรไม เช งเส น () = => root (+2)(+) = 0 => * = -,

8 Requrements For An Algorthmc Approach Idea: nd a sequence o, 2, 3, 4. so that or some N, N s close to a root..e. ( N ) <tolerance What do we need?

9 Requrements For Such a Root-Fndng Scheme Intal guess: Relatonshp between n+ and n and possbly n-, n-2, n-3, When to stop the successve guesses?

10 Some Alternatve Methods Bracketng Method (ประมาณแบบช วงคาตอบ) Graphcal Method Incremental Search Method Bsecton False-Poston Method Open Method Newton s Method (ประมาณแบบช วงจ ด: ว งบนความช น) Avodng dervatves n Newton method

11 Intermedate value theorem When you have two ponts connected by a contnuous curve: one pont below the lne the other pont above the lne... then there wll be at least one place where the curve crosses the lne! The ntermedate value theorem tells us that a contnuous uncton s postve at one end o an nterval and s negatve at the other end o the nterval then there s a root somewhere n the nterval

12 Theorem Theorem: An equaton ()=0, where () s a real contnuous uncton, has at least one root between l and u ( l ) ( u ) < 0. () u

13 Theorem I uncton () n ()=0 does not change sgn between two ponts, roots may stll est between the two ponts. () u

14 Theorem I the uncton () n ()=0 does not change sgn between two ponts, there may not be any roots between the two ponts. () () u u

15 Theorem I the uncton () n ()=0 changes sgn between two ponts, more than one root may est between the two ponts. () u

16

17

18 Incremental Search Method I ( ) and ( 2 ) have opposte sgns, there s at least one root n the nterval (, 2 ). I the nterval s small enough, t s lkely contan a sngle root. The zeroes o () or root can be detected by evaluatng the uncton at the nterval d and lookng or changng n sgn. Wrte a program

19 Eample Use ncremental search wth d = 0.2 to bracket the smallest postve zero o () =

20 clear all; close all; clc; =.^3 2*.^2 + 5* - 0'; = nlne(); a = 0; % lower boundary b = 3; % upper boundary d = 0. = [a:d:b]; = (); [; ]' %plot(, ); dsp('press Enter to contnue') pause; Numercal Computng: 2/

21 lag = true; (a)*(b) < 0 = ; c = a + *d; whle (lag) [sgn((a)) sgn((c))] (sgn((a)) ~= sgn((c))) [ c (c)] dsp 'ound root'; lag = alse; end = +; c = a + *d; end else (a)*(b) == 0 dsp 'root s at the boundary'; else dsp 'could not detect root'; end Numercal Computng: 2/2558 2

22 Assgnment-0 Mody Incremental Search code or detectng all roots ound on the gven lst and specyng locaton o each root

23 Algorthm or Bsecton Method

24

25

26 Step Choose and u as two guesses or the root such that ( ) ( u ) < 0, or n other words, () changes sgn between and u. () u

27 Step 2 Estmate the root, m o the equaton () = 0 as the md-pont between and u as () m = 2 u u

28 Step 3 Now check the ollowng () I ( ) ( m ) < 0, then the root les between and m ; then = ; u = m. m u I ( ) ( m ) > 0, then the root les between m and u ; then = m ; u = u. I ( ) ( m ) = 0; then the root s m. Stop the algorthm ths s true.

29 Step 4 New estmate m = 2 Absolute Relatve Appromate Error a m new new m u old m 00 old m prevousestmateo root new m current estmateo root

30 Step 5 Check absolute relatve appromate error s less than prespeced tolerance or mamum number o teratons s reached. Yes No Stop Usng the new upper and lower guesses rom Step 3, go to Step

31 Eample Use Bsecton method to nd the root o () = [wthn -:0]

32 clear all; close all; clc; = '.^3-0*.^2+5'; = nlne(); a = 0; % lower boundary b = ; % upper boundary d = 0. = [a:d:b]; = (); [; ]' %plot(, ); dsp('press Enter to contnue') pause; Numercal Computng: 2/

33 lag = true; delta = ; (a)*(b) < 0 = 0; whle (lag) = +; m = (a+b)/2 (m) == 0 dsp 'ound root'; lag = alse; else (a)*(m) > 0 a = m; else b = m; end end [ a b m (m)] % (b-a)/(2.^) < delta end else (a)*(b)== 0 dsp 'root s at the boundary'; else dsp 'could not detect root o non-lnear equaton ; end Numercal Computng: 2/

34 Assgnment-02 Mody Bsecton code or detectng all roots ound on the gven lst and specyng locaton o each root

35 Advantages Always convergent The root bracket gets halved wth each teraton - guaranteed

36 Drawbacks Slow convergence

37 Drawbacks (contnued) I one o the ntal guesses s close to the root, the convergence s slower

38 Drawbacks (contnued) I a uncton () s such that t just touches the -as t wll be unable to nd the lower and upper guesses. ()

39 Bsecton Convergence Rate Every tme we splt the nterval we reduce the search nterval by a actor o two..e. a b a b 0 0 k k 2 k

40 False-Poston Method o Solvng a Nonlnear Equaton Major: All Engneerng Majors Authors: Duc Nguyen Numercal Methods or STEM undergraduates 40

41 False-Poston Method or Regula Fals Method Because o the convergence o Bsecton method s slow. We assume that (a) and (b) have opposte sgns. The Bsecton method used the mdpont o the nterval [a, b] as net terate. A better appromaton s obtaned we nd the pont (c, 0) where the secant lne L jonng the ponts (a, (a)) and (b, (b)) crosses the -as.

42 Introducton ( ) 0 () In the Bsecton method U ( )* ( ) L U 0 (2) O 42 L r U Eact root L Fgure False-Poston Method r L 2 U (3)

43 (c)

44 False-Poston Method Based on two smlar trangles, shown n Fgure, one gets: r ( L ) L r ( U ) The sgns or both sdes o Eq. (4) s consstent, snce: U (4) U ( ( L U ) 0; ) 0; r r L U 0 0 Eact root O L r U 44 L

45 45 L U r U L r U L r U L L U From Eq. (4), one obtans The above equaton can be solved to obtan the net predcted root U L U L L U r r, as (5)

46 Step-By-Step False-Poston Algorthms 46. Choose L that and U 2. Estmate the root, as two guesses or the root such 0 L U m 3. Now check the ollowng (a) I and (b) I and m U 0 L m ; then ; then U L L U L, then the root les between L L and U m 0 L m, then the root les between L m and U U U L m

47 47 (c) I 0 L m, then the root s Stop the algorthm ths s true. 4. Fnd the new estmate o the root m U L L U L U m. Fnd the absolute relatve appromate error as a new m new m old m 00

48 48 where new m old m = estmated root rom present teraton = estmated root rom prevous teraton 5. say 0 3 s I a s, then go to step 3, else stop the algorthm. Notes: The False-Poston and Bsecton algorthms are qute smlar. The only derence s the ormula used to calculate the new estmate o the root, m shown n steps #2 and 4!

49 Assgnment-03 Wrte False Poston code or detectng all roots ound on the gven lst and specyng locaton o each root

50 Newton-Raphson Method Slope Method or Fndng Roots

51 - + Basc Ideas Slope= () A y=() ()=dy/d C B ()-0 X +2 X +

52 Newton-Raphson Method () ( ), = - ( ) ( ) ( - ) +2 + X 52 Geometrcal llustraton o the Newton-Raphson method.

53 Dervaton () ( ) B tan( AB AC '( ) ( ) C + A X ( ) ( ) Dervaton o the Newton-Raphson method. 53

54 Algorthm or Newton-Raphson Method 54

55 Step Evaluate () symbolcally. 55

56 Step 2 Use an ntal guess o the root,, to estmate the new value o the root,, as =

57 Step 3 Fnd the absolute relatve appromate error as a - a =

58 Step 4 Compare the absolute relatve appromate error wth the pre-speced relatve error tolerance. s Is a s? Yes No Go to Step 2 usng new estmate o the root. Stop the algorthm Also, check the number o teratons has eceeded the mamum number o teratons allowed. I so, one needs to termnate the algorthm and noty the user. 58

59 Eample You are workng or DOWN THE TOILET COMPANY that makes loats or ABC commodes. The loatng ball has a specc gravty o 0.6 and has a radus o 5.5 cm. You are asked to nd the depth to whch the ball s submerged when loatng n water. 59 Floatng ball problem.

60 Eample Cont. The equaton that gves the depth n meters to whch the ball s submerged under water s gven by Floatng ball problem. Use the Newton s method o ndng roots o equatons to nd a) the depth to whch the ball s submerged under water. Conduct three teratons to estmate the root o the above equaton. b) The absolute relatve appromate error at the end o each teraton, and c) The number o sgncant dgts at least correct at the end o each teraton. 60

61 Eample Cont. Soluton To ad n the understandng o how ths method works to nd the root o an equaton, the graph o () s shown to the rght, where Graph o the uncton () 6

62 Eample Cont. Solve or ' ' Let us assume the ntal guess o the root o s 0.05m 0. Ths s a reasonable guess (dscuss why 0 and 0.m are not good choces) as the etreme values o the depth would be 0 and the dameter (0. m) o the ball

63 Eample Cont. Iteraton The estmate o the root s '

64 Eample Cont. Fgure 5 Estmate o the root or the rst teraton. 64

65 Eample Cont. The absolute relatve appromate error a at the end o Iteraton s a % 00 The number o sgncant dgts at least correct s 0, as you need an absolute relatve appromate error o 5% or less or at least one sgncant dgts to be correct n your result. 65

66 Eample Cont. Iteraton 2 The estmate o the root s 2 '

67 Eample Cont. Fgure 6 Estmate o the root or the Iteraton 2. 67

68 Eample Cont. The absolute relatve appromate error a at the end o Iteraton 2 s a % 00 2m The mamum value o m or whch a 0.50 s Hence, the number o sgncant dgts at least correct n the answer s 2. 68

69 Eample Cont. Iteraton 3 The estmate o the root s 3 2 '

70 Eample Cont. Estmate o the root or the Iteraton 3. 70

71 Eample Cont. The absolute relatve appromate error a at the end o Iteraton 3 s a % The number o sgncant dgts at least correct s 4, as only 4 sgncant dgts are carred through all the calculatons. 7

72 ต วอย าง หาค ารากของสมการ 2e + 4 = 0 ว ธ ท า ให () = 2e + 4 () = 2e + จากส ตรการท าซ า ก าหนด 0 = 0 r r (r ) ( ) r ( 0 ) = 2e = -2 ( 0 ) = 2e 0 + = 3 = 0 (-2/3) = 0.67

73 ( ) = (0.67) = ( ) = = 0.67 (0.578/4.908) = ( 2 ) = ( 2 ) = = ( /4.473) = ( 3 ) = 4.82 * 0-5 ( 3 ) = = (4.82*0-5/4.454) =

74 Algorthm ของการหาค ารากของสมการ ()=0 ด วยระเบ ยบว ธ น วต น-ราฟส น Input : 0 เป นค าเร มต น = ขอบเขตของความคลาดเคล อน N = จ านวนคร งส งส ดของการทาซ า = ค าขอบเขตของฟ งก ช น Output : ค ารากของ ()=0

75 Algorthm r = 0 Do r < N then r+ = r ( r ) / ( r ) r = r+ else error( Out o Range ) Untl r r- < and ( r ) < Return r

76 Advantages and Drawbacks o Newton Raphson Method 76

77 Advantages Converges ast (quadratc convergence), t converges. We wll show that the rate o convergence s much aster than the bsecton method. However as always, there s a catch. The method uses a local lnear appromaton, whch clearly breaks down near a turnng pont. Small ( n ) makes the lnear model very lat and wll send the search ar away Requres only one guess 77

78 Drawbacks: Avodng dervatves. Dvergence at nlecton ponts Selecton o the ntal guess or an teraton value o the root that s close to the nlecton pont o the uncton may start dvergng away rom the root n ther Newton-Raphson method. 0 For eample, to nd the root o the equaton The Newton-Raphson method reduces to Table shows the terated values o the root o the equaton. The root starts to dverge at Iteraton 6 because the prevous estmate o s close to the nlecton pont o. Eventually ater 2 more teratons the root converges to the eact value o

79 Drawbacks Inlecton Ponts Table Dvergence near nlecton pont. Iteraton Number Dvergence at nlecton pont or

80 Drawbacks Dvson by Zero 2. Dvson by zero For the equaton the Newton-Raphson method reduces to or For, the denomnator wll equal zero. Ptall o dvson by zero or near a zero number 80

81 Drawbacks Oscllatons near local mamum and mnmum 3. Oscllatons near local mamum and mnmum Results obtaned rom the Newton-Raphson method may oscllate about the local mamum or mnmum wthout convergng on a root but convergng on the local mamum or mnmum. Eventually, t may lead to dvson by a number close to zero and may dverge. For eample or roots the equaton has no real 8

82 Drawbacks Oscllatons near local mamum and mnmum Table 3 Oscllatons near local mama and mmma n Newton-Raphson method. Iteraton Number % a () Oscllatons around local mnma or

83 Drawbacks Root Jumpng 4. Root Jumpng In some cases where the uncton s oscllatng and has a number o roots, one may choose an ntal guess close to a root. However, the guesses may jump and converge to some other root. For eample sn 0 Choose It wll converge to nstead o () Root jumpng rom ntended locaton o root or sn. 0 83

84 Secant Method Roots o a Nonlnear Equaton /5/

85 Secant Method The Newton-Raphson algorthm s based on the evaluaton o dervaton. The Newton-Raphson algorthm requres the evaluaton o two unctons per teraton, () and (). It s desrable to have method that converge as ast as Newton s method yet nvolves only evaluatons o () and not o ().

86 Secant Method ) ( ) ( - = () ( ) ( - ) +2 + X, ) ( ) ( ) ( ) ( ) ( ) )( ( Newton s Method Appromate the dervatve

87 Secant Method ) ( ) ( ) )( ( Geometrc Smlar Trangles () ( ) ( - ) + - X B C E D A ) ( ) ( DE DC AE AB

88 Algorthm or Secant Method

89 Step 00 - = a Calculate the net estmate o the root rom two ntal guesses Fnd the absolute relatve appromate error ) ( ) ( ) )( (

90 Step 2 Fnd the absolute relatve appromate error s greater than the prespeced relatve error tolerance. I so, go back to step, else stop the algorthm. Also check the number o teratons has eceeded the mamum number o teratons.

91 Eample To nd the nverse o a number a, one can use the equaton ( ) a 0 where s the nverse o a.

92 Soluton Use the Secant method o ndng roots o equatons to Fnd the nverse o a = 2.5. Conduct three teratons to estmate the root o the above equaton. Fnd the absolute relatve appromate error at the end o each teraton, and The number o sgncant dgts at least correct at the end o each teraton.

93 0 a Graph o uncton () () ( ) 0. ) ( a a a a ) ( ) ( ) ( a a ) ( a

94 Iteraton # ( ) ( ) ( ) 7.5 secant( ) ( ) , ( a ) (2.5(0.6) ) ' () ', (rst guess) 0, (prevous guess) Secant lne, (new guess) a 9.09%

95 Iteraton #2 ( ) ( ) ( ) secant( ) ( ) , ( a ) (2.5(0.55) ) () (guess) 0 (prevous guess) Secant lne 2 (new guess) a 69.23%

96 Iteraton # Entered uncton along gv en nterv al w th current and net root and the tangent lne o the curv e at the current root ( ) ( ) ( ) secant( ) ( ) , (2.5(0.325 )) a 2 2 ( a % ) () 2 (guess) (prevous guess) Secant lne 3 (new guess)

97 Advantages Converges ast, t converges Requres two guesses that do not need to bracket the root

98 Summary We have looked at our ways to nd the root o a sngle valued, sngle parameter uncton We consdered a robust, but slow bsecton method and then a aster but less robust Newton s and Secant method

Summary with Examples for Root finding Methods -Bisection -Newton Raphson -Secant

Summary with Examples for Root finding Methods -Bisection -Newton Raphson -Secant Summary wth Eamples or Root ndng Methods -Bsecton -Newton Raphson -Secant Nonlnear Equaton Solvers Bracketng Graphcal Open Methods Bsecton False Poston (Regula-Fals) Newton Raphson Secant All Iteratve

More information

Lecture 2 Solution of Nonlinear Equations ( Root Finding Problems )

Lecture 2 Solution of Nonlinear Equations ( Root Finding Problems ) Lecture Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton o Methods Analytcal Solutons Graphcal Methods Numercal Methods Bracketng Methods Open Methods Convergence Notatons Root Fndng

More information

: Numerical Analysis Topic 2: Solution of Nonlinear Equations Lectures 5-11:

: Numerical Analysis Topic 2: Solution of Nonlinear Equations Lectures 5-11: 764: Numercal Analyss Topc : Soluton o Nonlnear Equatons Lectures 5-: UIN Malang Read Chapters 5 and 6 o the tetbook 764_Topc Lecture 5 Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton

More information

CHAPTER 4d. ROOTS OF EQUATIONS

CHAPTER 4d. ROOTS OF EQUATIONS CHAPTER 4d. ROOTS OF EQUATIONS A. J. Clark School o Engneerng Department o Cvl and Envronmental Engneerng by Dr. Ibrahm A. Assakka Sprng 00 ENCE 03 - Computaton Methods n Cvl Engneerng II Department o

More information

CISE301: Numerical Methods Topic 2: Solution of Nonlinear Equations

CISE301: Numerical Methods Topic 2: Solution of Nonlinear Equations CISE3: Numercal Methods Topc : Soluton o Nonlnear Equatons Dr. Amar Khoukh Term Read Chapters 5 and 6 o the tetbook CISE3_Topc c Khoukh_ Lecture 5 Soluton o Nonlnear Equatons Root ndng Problems Dentons

More information

Single Variable Optimization

Single Variable Optimization 8/4/07 Course Instructor Dr. Raymond C. Rump Oce: A 337 Phone: (95) 747 6958 E Mal: rcrump@utep.edu Topc 8b Sngle Varable Optmzaton EE 4386/530 Computatonal Methods n EE Outlne Mathematcal Prelmnares Sngle

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Numerical Methods Solution of Nonlinear Equations

Numerical Methods Solution of Nonlinear Equations umercal Methods Soluton o onlnear Equatons Lecture Soluton o onlnear Equatons Root Fndng Prolems Dentons Classcaton o Methods Analytcal Solutons Graphcal Methods umercal Methods Bracketng Methods Open

More information

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or

More information

Chapter 3 Differentiation and Integration

Chapter 3 Differentiation and Integration MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton

More information

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to ChE Lecture Notes - D. Keer, 5/9/98 Lecture 6,7,8 - Rootndng n systems o equatons (A) Theory (B) Problems (C) MATLAB Applcatons Tet: Supplementary notes rom Instructor 6. Why s t mportant to be able to

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson

More information

Review of Taylor Series. Read Section 1.2

Review of Taylor Series. Read Section 1.2 Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the

More information

Shuai Dong. Isaac Newton. Gottfried Leibniz

Shuai Dong. Isaac Newton. Gottfried Leibniz Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots

More information

Chapter 4: Root Finding

Chapter 4: Root Finding Chapter 4: Root Fndng Startng values Closed nterval methods (roots are search wthn an nterval o Bsecton Open methods (no nterval o Fxed Pont o Newton-Raphson o Secant Method Repeated roots Zeros of Hgher-Dmensonal

More information

Physics 2A Chapter 3 HW Solutions

Physics 2A Chapter 3 HW Solutions Phscs A Chapter 3 HW Solutons Chapter 3 Conceptual Queston: 4, 6, 8, Problems: 5,, 8, 7, 3, 44, 46, 69, 70, 73 Q3.4. Reason: (a) C = A+ B onl A and B are n the same drecton. Sze does not matter. (b) C

More information

Mathematics Intersection of Lines

Mathematics Intersection of Lines a place of mnd F A C U L T Y O F E D U C A T I O N Department of Currculum and Pedagog Mathematcs Intersecton of Lnes Scence and Mathematcs Educaton Research Group Supported b UBC Teachng and Learnng Enhancement

More information

= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]

= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W] Secton 1.3: Acceleraton Tutoral 1 Practce, page 24 1. Gven: 0 m/s; 15.0 m/s [S]; t 12.5 s Requred: Analyss: a av v t v f v t a v av f v t 15.0 m/s [S] 0 m/s 12.5 s 15.0 m/s [S] 12.5 s 1.20 m/s 2 [S] Statement:

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson

More information

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222

More information

ORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD

ORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD Numercal Analss or Engneers German Jordanan Unverst ORDINARY DIFFERENTIAL EQUATIONS We wll eplore several metods o solvng rst order ordnar derental equatons (ODEs and we wll sow ow tese metods can be appled

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions 5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

ME 501A Seminar in Engineering Analysis Page 1

ME 501A Seminar in Engineering Analysis Page 1 umercal Solutons of oundary-value Problems n Os ovember 7, 7 umercal Solutons of oundary- Value Problems n Os Larry aretto Mechancal ngneerng 5 Semnar n ngneerng nalyss ovember 7, 7 Outlne Revew stff equaton

More information

Finite Difference Method

Finite Difference Method 7/0/07 Instructor r. Ramond Rump (9) 747 698 rcrump@utep.edu EE 337 Computatonal Electromagnetcs (CEM) Lecture #0 Fnte erence Method Lecture 0 These notes ma contan coprghted materal obtaned under ar use

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

6.1 The function can be formulated as a fixed-point iteration as

6.1 The function can be formulated as a fixed-point iteration as CHAPTER 6 6. The functon can be formulated as a fed-pont teraton as sn Usng an ntal guess of 0 = 0.5, the frst teraton s 0.5. 9974 sn a.9974 0.5 00% 6.57%.9974 The remanng teratons are summarzed below.

More information

Unit 5: Quadratic Equations & Functions

Unit 5: Quadratic Equations & Functions Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Newton s Method for One - Dimensional Optimization - Theory

Newton s Method for One - Dimensional Optimization - Theory Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,

More information

Topic 5: Non-Linear Regression

Topic 5: Non-Linear Regression Topc 5: Non-Lnear Regresson The models we ve worked wth so far have been lnear n the parameters. They ve been of the form: y = Xβ + ε Many models based on economc theory are actually non-lnear n the parameters.

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Kim Gaik Universiti Tun Hussein Onn Malaysia

SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Kim Gaik Universiti Tun Hussein Onn Malaysia SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Km Gak Unverst Tun Hussen Onn Malaysa Kek Se Long Unverst Tun Hussen Onn Malaysa Rosmla Abdul-Kahar

More information

Week 11: Chapter 11. The Vector Product. The Vector Product Defined. The Vector Product and Torque. More About the Vector Product

Week 11: Chapter 11. The Vector Product. The Vector Product Defined. The Vector Product and Torque. More About the Vector Product The Vector Product Week 11: Chapter 11 Angular Momentum There are nstances where the product of two vectors s another vector Earler we saw where the product of two vectors was a scalar Ths was called the

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

General Tips on How to Do Well in Physics Exams. 1. Establish a good habit in keeping track of your steps. For example, when you use the equation

General Tips on How to Do Well in Physics Exams. 1. Establish a good habit in keeping track of your steps. For example, when you use the equation General Tps on How to Do Well n Physcs Exams 1. Establsh a good habt n keepng track o your steps. For example when you use the equaton 1 1 1 + = d d to solve or d o you should rst rewrte t as 1 1 1 = d

More information

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(

More information

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong

More information

Chapter 9: Statistical Inference and the Relationship between Two Variables

Chapter 9: Statistical Inference and the Relationship between Two Variables Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,

More information

ACTM State Calculus Competition Saturday April 30, 2011

ACTM State Calculus Competition Saturday April 30, 2011 ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward

More information

A MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

A MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF

More information

Section 3.6 Complex Zeros

Section 3.6 Complex Zeros 04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute

More information

Physics 2A Chapter 9 HW Solutions

Physics 2A Chapter 9 HW Solutions Phscs A Chapter 9 HW Solutons Chapter 9 Conceptual Queston:, 4, 8, 13 Problems: 3, 8, 1, 15, 3, 40, 51, 6 Q9.. Reason: We can nd the change n momentum o the objects b computng the mpulse on them and usng

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown

More information

Work is the change in energy of a system (neglecting heat transfer). To examine what could

Work is the change in energy of a system (neglecting heat transfer). To examine what could Work Work s the change n energy o a system (neglectng heat transer). To eamne what could cause work, let s look at the dmensons o energy: L ML E M L F L so T T dmensonally energy s equal to a orce tmes

More information

Line Drawing and Clipping Week 1, Lecture 2

Line Drawing and Clipping Week 1, Lecture 2 CS 43 Computer Graphcs I Lne Drawng and Clppng Week, Lecture 2 Davd Breen, Wllam Regl and Maxm Peysakhov Geometrc and Intellgent Computng Laboratory Department of Computer Scence Drexel Unversty http://gcl.mcs.drexel.edu

More information

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2) 1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

AS-Level Maths: Statistics 1 for Edexcel

AS-Level Maths: Statistics 1 for Edexcel 1 of 6 AS-Level Maths: Statstcs 1 for Edecel S1. Calculatng means and standard devatons Ths con ndcates the slde contans actvtes created n Flash. These actvtes are not edtable. For more detaled nstructons,

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Module 14: THE INTEGRAL Exploring Calculus

Module 14: THE INTEGRAL Exploring Calculus Module 14: THE INTEGRAL Explorng Calculus Part I Approxmatons and the Defnte Integral It was known n the 1600s before the calculus was developed that the area of an rregularly shaped regon could be approxmated

More information

Spring Force and Power

Spring Force and Power Lecture 13 Chapter 9 Sprng Force and Power Yeah, energy s better than orces. What s net? Course webste: http://aculty.uml.edu/andry_danylov/teachng/physcsi IN THIS CHAPTER, you wll learn how to solve problems

More information

Chapter 14 Simple Linear Regression

Chapter 14 Simple Linear Regression Chapter 4 Smple Lnear Regresson Chapter 4 - Smple Lnear Regresson Manageral decsons often are based on the relatonshp between two or more varables. Regresson analss can be used to develop an equaton showng

More information

of Nebraska - Lincoln

of Nebraska - Lincoln Unversty of Nebraska - Lncoln DgtalCommons@Unversty of Nebraska - Lncoln MAT Exam Expostory Papers Math n the Mddle Insttute Partnershp 008 The Square Root of Tffany Lothrop Unversty of Nebraska-Lncoln

More information

THE SUMMATION NOTATION Ʃ

THE SUMMATION NOTATION Ʃ Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the

More information

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule: 15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before

More information

SIMPLE LINEAR REGRESSION

SIMPLE LINEAR REGRESSION Smple Lnear Regresson and Correlaton Introducton Prevousl, our attenton has been focused on one varable whch we desgnated b x. Frequentl, t s desrable to learn somethng about the relatonshp between two

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018 MATH 5630: Dscrete Tme-Space Model Hung Phan, UMass Lowell March, 08 Newton s Law of Coolng Consder the coolng of a well strred coffee so that the temperature does not depend on space Newton s law of collng

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

PHYS 1101 Practice problem set 12, Chapter 32: 21, 22, 24, 57, 61, 83 Chapter 33: 7, 12, 32, 38, 44, 49, 76

PHYS 1101 Practice problem set 12, Chapter 32: 21, 22, 24, 57, 61, 83 Chapter 33: 7, 12, 32, 38, 44, 49, 76 PHYS 1101 Practce problem set 1, Chapter 3: 1,, 4, 57, 61, 83 Chapter 33: 7, 1, 3, 38, 44, 49, 76 3.1. Vsualze: Please reer to Fgure Ex3.1. Solve: Because B s n the same drecton as the ntegraton path s

More information

CHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG

CHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG Chapter 7: Constraned Optmzaton CHAPER 7 CONSRAINED OPIMIZAION : SQP AND GRG Introducton In the prevous chapter we eamned the necessary and suffcent condtons for a constraned optmum. We dd not, however,

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Solutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1

Solutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1 Solutons to Homework 7, Mathematcs 1 Problem 1: a Prove that arccos 1 1 for 1, 1. b* Startng from the defnton of the dervatve, prove that arccos + 1, arccos 1. Hnt: For arccos arccos π + 1, the defnton

More information

Chapter 7: Conservation of Energy

Chapter 7: Conservation of Energy Lecture 7: Conservaton o nergy Chapter 7: Conservaton o nergy Introucton I the quantty o a subject oes not change wth tme, t means that the quantty s conserve. The quantty o that subject remans constant

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Numerical Transient Heat Conduction Experiment

Numerical Transient Heat Conduction Experiment Numercal ransent Heat Conducton Experment OBJECIVE 1. o demonstrate the basc prncples of conducton heat transfer.. o show how the thermal conductvty of a sold can be measured. 3. o demonstrate the use

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

More information

A Tale of Friction Basic Rollercoaster Physics. Fahrenheit Rollercoaster, Hershey, PA max height = 121 ft max speed = 58 mph

A Tale of Friction Basic Rollercoaster Physics. Fahrenheit Rollercoaster, Hershey, PA max height = 121 ft max speed = 58 mph A Tale o Frcton Basc Rollercoaster Physcs Fahrenhet Rollercoaster, Hershey, PA max heght = 11 t max speed = 58 mph PLAY PLAY PLAY PLAY Rotatonal Movement Knematcs Smlar to how lnear velocty s dened, angular

More information

Chapter 8. Potential Energy and Conservation of Energy

Chapter 8. Potential Energy and Conservation of Energy Chapter 8 Potental Energy and Conservaton of Energy In ths chapter we wll ntroduce the followng concepts: Potental Energy Conservatve and non-conservatve forces Mechancal Energy Conservaton of Mechancal

More information

ECEN 5005 Crystals, Nanocrystals and Device Applications Class 19 Group Theory For Crystals

ECEN 5005 Crystals, Nanocrystals and Device Applications Class 19 Group Theory For Crystals ECEN 5005 Crystals, Nanocrystals and Devce Applcatons Class 9 Group Theory For Crystals Dee Dagram Radatve Transton Probablty Wgner-Ecart Theorem Selecton Rule Dee Dagram Expermentally determned energy

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Mathematical Economics MEMF e ME. Filomena Garcia. Topic 2 Calculus

Mathematical Economics MEMF e ME. Filomena Garcia. Topic 2 Calculus Mathematcal Economcs MEMF e ME Flomena Garca Topc 2 Calculus Mathematcal Economcs - www.seg.utl.pt/~garca/economa_matematca . Unvarate Calculus Calculus Functons : X Y y ( gves or each element X one element

More information

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1) Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For

More information

Computational Biology Lecture 8: Substitution matrices Saad Mneimneh

Computational Biology Lecture 8: Substitution matrices Saad Mneimneh Computatonal Bology Lecture 8: Substtuton matrces Saad Mnemneh As we have ntroduced last tme, smple scorng schemes lke + or a match, - or a msmatch and -2 or a gap are not justable bologcally, especally

More information

Neural networks. Nuno Vasconcelos ECE Department, UCSD

Neural networks. Nuno Vasconcelos ECE Department, UCSD Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X

More information

Journal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.

Journal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co. Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by

More information

THE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE

THE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Math 261 Exercise sheet 2

Math 261 Exercise sheet 2 Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Linear Correlation. Many research issues are pursued with nonexperimental studies that seek to establish relationships among 2 or more variables

Linear Correlation. Many research issues are pursued with nonexperimental studies that seek to establish relationships among 2 or more variables Lnear Correlaton Many research ssues are pursued wth nonexpermental studes that seek to establsh relatonshps among or more varables E.g., correlates of ntellgence; relaton between SAT and GPA; relaton

More information

Period & Frequency. Work and Energy. Methods of Energy Transfer: Energy. Work-KE Theorem 3/4/16. Ranking: Which has the greatest kinetic energy?

Period & Frequency. Work and Energy. Methods of Energy Transfer: Energy. Work-KE Theorem 3/4/16. Ranking: Which has the greatest kinetic energy? Perod & Frequency Perod (T): Tme to complete one ull rotaton Frequency (): Number o rotatons completed per second. = 1/T, T = 1/ v = πr/t Work and Energy Work: W = F!d (pcks out parallel components) F

More information

Statistics for Economics & Business

Statistics for Economics & Business Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable

More information

Physics 2A Chapters 6 - Work & Energy Fall 2017

Physics 2A Chapters 6 - Work & Energy Fall 2017 Physcs A Chapters 6 - Work & Energy Fall 017 These notes are eght pages. A quck summary: The work-energy theorem s a combnaton o Chap and Chap 4 equatons. Work s dened as the product o the orce actng on

More information

Introduction to Regression

Introduction to Regression Introducton to Regresson Dr Tom Ilvento Department of Food and Resource Economcs Overvew The last part of the course wll focus on Regresson Analyss Ths s one of the more powerful statstcal technques Provdes

More information

Section 8.1 Exercises

Section 8.1 Exercises Secton 8.1 Non-rght Trangles: Law of Snes and Cosnes 519 Secton 8.1 Exercses Solve for the unknown sdes and angles of the trangles shown. 10 70 50 1.. 18 40 110 45 5 6 3. 10 4. 75 15 5 6 90 70 65 5. 6.

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

PHYS 1443 Section 004 Lecture #12 Thursday, Oct. 2, 2014

PHYS 1443 Section 004 Lecture #12 Thursday, Oct. 2, 2014 PHYS 1443 Secton 004 Lecture #1 Thursday, Oct., 014 Work-Knetc Energy Theorem Work under rcton Potental Energy and the Conservatve Force Gravtatonal Potental Energy Elastc Potental Energy Conservaton o

More information