Lecture 2 Solution of Nonlinear Equations ( Root Finding Problems )
|
|
- Arleen Blake
- 5 years ago
- Views:
Transcription
1 Lecture Soluton o Nonlnear Equatons Root Fndng Problems Dentons Classcaton o Methods Analytcal Solutons Graphcal Methods Numercal Methods Bracketng Methods Open Methods Convergence Notatons
2 Root Fndng Problems Many problems n Scence and Engneerng are epressed as: Gven a nd the value contnuous r uncton such that r, These problems are called root ndng problems.
3 Roots o Equatons A number r that satses an equaton s called a root o the equaton. The equaton : has our roots :, 3, 3, and..e., The equaton has two smple roots and and a repeated root 3 wth multplcty. 3 3
4 Zeros o a Functon Let be a real-valued uncton o a real varable. Any number r or whch r s called a zero o the uncton. Eamples: and 3 are zeros o the uncton
5 Graphcal Interpretaton o Zeros The real zeros o a uncton are the values o at whch the graph o the uncton crosses or touches the - as. Real zeros o 5
6 Smple Zeros has two smple zeros one at and one at 6
7 Multple Zeros has double zeros zero wth mulplcty at 7
8 Multple Zeros 3 3 has a zero wth mulplcty 3 at 8
9 Facts Any n th order polynomal has eactly n zeros countng real and comple zeros wth ther multplctes. Any polynomal wth an odd order has at least one real zero. I a uncton has a zero at r wth multplcty m then the uncton and ts rst m- dervatves are zero at r and the m th dervatve at r s not zero. 9
10 Roots o Equatons & Zeros o Functon Gven theequaton : Move all terms to one sde o the equaton : Dene as : The zeros o are the same as the roots o theequaton Whch are, 3, 3, and
11 Soluton Methods Several ways to solve nonlnear equatons are possble: Analytcal Solutons Possble or specal equatons only Graphcal Solutons Useul or provdng ntal guesses or other methods Numercal Solutons Open methods Bracketng methods
12 Analytcal Methods Analytcal Solutons are avalable or specal equatons only. Analytcal soluton o : a b c roots b ± b a 4ac No analytcal soluton s avalable or : e
13 Graphcal Methods Graphcal methods are useul to provde an ntal guess to be used by other methods. Solve e The root root [,].6 e Root 3
14 Numercal Methods Many methods are avalable to solve nonlnear equatons: Bsecton Method Newton s Method Secant Method False poston Method Muller s Method Barstow s Method Fed pont teratons. These wll be covered here 4
15 Bracketng Methods In bracketng methods, the method starts wth an nterval that contans the root and a procedure s used to obtan a smaller nterval contanng the root. Eamples o bracketng methods: Bsecton method False poston method 5
16 Open Methods In the open methods, the method starts wth one or more ntal guess ponts. In each teraton, a new guess o the root s obtaned. Open methods are usually more ecent than bracketng methods. They may not converge to a root. 6
17 Convergence Notaton A sequence,,..., n,... s sad to converge to to every ε > there ests N such that : n < ε n > N 7
18 8 Convergence Notaton C P C C p n n n n n n : order Convergence o Quadratc Convergence : Lnear Convergence :. to converge,...,, Let
19 Speed o Convergence We can compare derent methods n terms o ther convergence rate. Quadratc convergence s aster than lnear convergence. A method wth convergence order q converges aster than a method wth convergence order p q>p. Methods o convergence order p> are sad to have super lnear convergence. 9
20 Bsecton Method The Bsecton method s one o the smplest methods to nd a zero o a nonlnear uncton. It s also called nterval halvng method. To use the Bsecton method, one needs an ntal nterval that s known to contan a zero o the uncton. The method systematcally reduces the nterval. It does ths by dvdng the nterval nto two equal parts, perorms a smple test and based on the result o the test, hal o the nterval s thrown away. The procedure s repeated untl the desred nterval sze s obtaned.
21 Intermedate Value Theorem Let be dened on the nterval [a,b]. a Intermedate value theorem: a uncton s contnuous and a and b have derent sgns then the uncton has at least one zero n the nterval [a,b]. a b b
22 Eamples I a and b have the same sgn, the uncton may have an even number o real zeros or no real zeros n the nterval [a, b]. Bsecton method can not be used n these cases. a b The uncton has our real zeros a b The uncton has no real zeros
23 Two More Eamples I a and b have derent sgns, the uncton has at least one real zero. a b Bsecton method can be used to nd one o the zeros. The uncton has one real zero a b The uncton has three real zeros 3
24 Bsecton Method I the uncton s contnuous on [a,b] and a and b have derent sgns, Bsecton method obtans a new nterval that s hal o the current nterval and the sgn o the uncton at the end ponts o the nterval are derent. Ths allows us to repeat the Bsecton procedure to urther reduce the sze o the nterval. 4
25 Bsecton Method Assumptons: Gven an nterval [a,b] s contnuous on [a,b] a and b have opposte sgns. These assumptons ensure the estence o at least one zero n the nterval [a,b] and the bsecton method can be used to obtan a smaller nterval that contans the zero. 5
26 Bsecton Algorthm Assumptons: s contnuous on [a,b] a b < a Algorthm: Loop. Compute the md pont cab/. Evaluate c 3. I a c < then new nterval [a, c] I a c > then new nterval [c, b] End loop a c b b b a a a 6
27 Eample
28 Flow Chart o Bsecton Method Start: Gven a,b and ε u a ; v b c ab / ; w c no yes s u w < no s b-a /<ε yes Stop bc; v w ac; u w 8
29 Eample Can you use Bsecton method to nd a zero o : 3 3 n the nterval [,]? Answer: s contnuous on [,] and * 3 3> Assumptons are not satsed Bsecton method can not be used 9
30 3 Eample Answer: [,]? nterval n the 3 : o zero a nd to method Bsecton use you Can 3 used can be method Bsecton satsed are Assumptons - * and on [,] contnuous s <
31 Best Estmate and Error Level Bsecton method obtans an nterval that s guaranteed to contan a zero o the uncton. The best estmate o the zero o the uncton ater the rst teraton o the Bsecton method s the md pont o the ntal nterval: b a Estmate o the zero : r b a Error 3
32 Stoppng Crtera Two common stoppng crtera. Stop ater a ed number o teratons. Stop when the absolute error s less than a speced value How are these crtera related? 3
33 Stoppng Crtera c n : s the mdpont o the nterval at the n th teraton c n s usually used as the estmate o the root. r : s the zero o the uncton. Ater n teratons : error r -c n E n a b a n n 33
34 Convergence Analyss Gven, a, b, and ε How many teratons are needed such that : - r ε where r s the zero o and s the bsecton estmate.e., c k? log b a log ε n log 34
35 Convergence Analyss Alternatve Form log b a log ε n log wdth o ntal nterval n log log desred error b a ε 35
36 Eample a 6, b 7, ε.5 How many teratons are needed such that : - r ε? n log b a log ε log log log.5 log.9658 n 36
37 Eample Use Bsecton method to nd a root o the equaton cos wth absolute error <. assume the ntal nterval [.5,.9] Queston : What s? Queston : Are the assumptons satsed? Queston 3: How many teratons are needed? Queston 4: How to compute the new estmate? 37
38 CISE3_Topc 38
39 Bsecton Method Intal Interval a b.784 a.5 c.7 b.9 Error < Error < Error <.5 39
40 Bsecton Method Error <.5 Error <.5 Intal nterval contanng the root: [.5,.9] Ater 5 teratons: Interval contanng the root: [.75,.75] Best estmate o the root s.7375 Error <.5 4
41 A Matlab Program o Bsecton Method a.5; b.9; ua-cosa; vb-cosb; or k:5 cab/ cc-cosc u*c< bc ; vc; else ac; uc; end end c.7 c c.8 c.33 c.75 c.83 c.75 c
42 4 Eample Fnd the root o: root the nd to used can be method Bsecton, * contnuous s * nterval:[,] n the 3 3 < b a
43 Eample Iteraton a b c ab c b-a E E E
44 Bsecton Method Advantages Smple and easy to mplement One uncton evaluaton per teraton The sze o the nterval contanng the zero s reduced by 5% ater each teraton The number o teratons can be determned a pror No knowledge o the dervatve s needed The uncton does not have to be derentable Dsadvantage Slow to converge Good ntermedate appromatons may be dscarded 44
45 Newton-Raphson Method Also known as Newton s Method Gven an ntal guess o the root, Newton-Raphson method uses normaton about the uncton and ts dervatve at that pont to nd a better guess o the root. Assumptons: s contnuous and the rst dervatve s known An ntal guess such that s gven 45
46 Newton Raphson Method - Graphcal Depcton - I the ntal guess at the root s, then a tangent to the uncton o that s s etrapolated down to the -as to provde an estmate o the root at. 46
47 Dervaton o Newton s Method Gven: Queston Taylor Therorem : Fnd h h : such that ' A new guess an ntal How do we obtan a o guess the root : o h h the root o. better estmate ' h ' Newton Raphson Formula? 47
48 48 Newton s Method end n or Assumputon Gven ' : ', ', end X FP X F X X k or X PROGRAM MATLAB / :5 4 % X X FP X FP FP uncton X X F X F F uncton 6* ^ 3* ] [ ^ 3* ^3 ] [ F.m FP.m
49 49 Eample ' Iteraton 3: ' Iteraton : ' Iteraton : 4 3 ' 4, 3 the uncton zero o Fnd a 3 3
50 Eample k Iteraton k k k k k k
51 5 Convergence Analyss ' mn ' ' ma such that ests then there '. where r at be contnuous ' ' ', Let Theorem : C C -r -r -r r I r and -r -r k k δ δ δ δ >
52 Proo 5 ' '' '' ' ' '' '! : Raphson - Newton ;! ], [ : about o epanson Taylor seres The r r r r r r r r r r r r ξ ξ ξ ξ
53 Convergence Analyss Remarks When the guess s close enough to a smple root o the uncton then Newton s method s guaranteed to converge quadratcally. Quadratc convergence means that the number o correct dgts s nearly doubled at each teraton. 53
54 Problems wth Newton s Method I the ntal guess o the root s ar rom the root the method may not converge. Newton s method converges lnearly near multple zeros { r r }. In such a case, moded algorthms can be used to regan the quadratc convergence. 54
55 Multple Roots 3 has three zeros at zeros has two at - 55
56 Problems wth Newton s Method - Runaway - The estmates o the root s gong away rom the root. 56
57 Problems wth Newton s Method - Flat Spot - The value o s zero, the algorthm als. I s very small then wll be very ar rom. 57
58 Problems wth Newton s Method - Cycle The algorthm cycles between two values and 58
59 59 Newton s Method or Systems o Non Lnear Equatons [ ] M M M ',,...,,..., ' ' root o the o guess an ntal : X F X F X F X F X X Iteraton s Newton F X Gven k k k k
60 6 Eample Solve the ollowng system o equatons:, guess Intal 5 5 y y y. y, 5 5 ', 5 5 X y F y y. y F
61 6 Soluton Usng Newton s Method ', : Iteraton ', : Iteraton X F F. X y F. y y. y F
62 6 Eample Try ths Solve the ollowng system o equatons:, Intal guess y y y y, 4 ', X y F y y y F
63 63 Eample Soluton X k Iteraton
64 Newton s Method Revew Assumptons :, ', Newton' s Method new estmate: Problem : ' ' s not avalable, or dcult to obtan analytcally. ' are avalable, 64
65 65 Secant Method ' ponts : are two ntal ' and h h
66 66 Secant Method New estmate Secant Method : ponts ntal Two Assumptons : that such and
67 67 Secant Method.5
68 68 Secant Method - Flowchart ;,, <ε Stop NO Yes
69 69 Moded Secant Method the method may dverge. properly, not selected I? How to select Problem : ' needed : guess s only one ntal moded Secant method, ths In δ δ δ δ δ δ δ
70 Eample 5 Fnd the roots o : Intal ponts 5 and wth error <
71 Eample
72 Convergence Analyss The rate o convergence o the Secant method s super lnear: r r α C, α.6 r : root : estmate o the root at the th teraton. It s better than Bsecton method but not as good as Newton s method. 7
73 Summary Method Pros Cons Bsecton Newton Secant - Easy, Relable, Convergent - One uncton evaluaton per teraton - No knowledge o dervatve s needed - Fast near the root - Two uncton evaluatons per teraton - Fast slower than Newton - One uncton evaluaton per teraton - No knowledge o dervatve s needed - Slow - Needs an nterval [a,b] contanng the root,.e., ab< - May dverge - Needs dervatve and an ntal guess such that s nonzero - May dverge - Needs two ntal ponts guess, such that - s nonzero 73
74 74 Eample.5 ponts ntal Two : root o the nd to Secant method Use 6 and
75 Soluton k k k
76 76 Eample.. or., or teratons, three ater Stop. : pont ntal the Use : root o a nd to Method Newton's Use 3 < < k k k
77 Fve Iteratons o the Soluton k k k k ERROR
78 78 Eample.. or., or teratons, three ater Stop. : pont ntal Use the : root o a nd to Method Newton's Use < < k k k e
79 79 Eample ' ' ', : root o a nd to Method Newton's Use k k k k k e e
80 Eample Estmates o the root o: -cos..6 Intal guess correct dgt correct dgts correct dgts correct dgts 8
81 Eample In estmatng the root o: -cos, to get more than 3 correct dgts: 4 teratons o Newton.8 43 teratons o Bsecton method ntal nterval [.6,.8] 5 teratons o Secant method.6,.8 8
: 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 informationCISE301: 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 informationNumerical 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 informationSummary 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 informationCHAPTER 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 informationReview 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 informationSingle 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 informationChapter 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 informationRoot Finding
Root Fndng 886307 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
More informationFinite 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 informationChapter 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 informationOPTIMISATION. 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 information36.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 informationSection 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 informationChapter 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 informationEE 330 Lecture 24. Small Signal Analysis Small Signal Analysis of BJT Amplifier
EE 0 Lecture 4 Small Sgnal Analss Small Sgnal Analss o BJT Ampler Eam Frda March 9 Eam Frda Aprl Revew Sesson or Eam : 6:00 p.m. on Thursda March 8 n Room Sweene 6 Revew rom Last Lecture Comparson o Gans
More informationShuai 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 informationCIS526: 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 informationChapter 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 information2. PROBLEM STATEMENT AND SOLUTION STRATEGIES. L q. Suppose that we have a structure with known geometry (b, h, and L) and material properties (EA).
. PROBEM STATEMENT AND SOUTION STRATEGIES Problem statement P, Q h ρ ρ o EA, N b b Suppose that we have a structure wth known geometry (b, h, and ) and materal propertes (EA). Gven load (P), determne the
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA 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 informationSOLVING 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( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.
3 Interpolaton {( y } Gven:,,,,,, [ ] Fnd: y for some Mn, Ma Polynomal Appromaton Theorem (Weerstrass Appromaton Theorem --- estence ε [ ab] f( P( , then there ests a polynomal
More informationSolution 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 informationNewton 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 informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationME 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 informationKernel 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 informationOn 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 informationLecture 26 Finite Differences and Boundary Value Problems
4//3 Leture 6 Fnte erenes and Boundar Value Problems Numeral derentaton A nte derene s an appromaton o a dervatve - eample erved rom Talor seres 3 O! Negletng all terms ger tan rst order O O Tat s te orward
More informationORDINARY 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 informationTopic 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 informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More informationCHAPTER 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 informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationCommon 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 informationChapter 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 informationEEE 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 informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationChapter 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 informationChapter 4 The Wave Equation
Chapter 4 The Wave Equaton Another classcal example of a hyperbolc PDE s a wave equaton. The wave equaton s a second-order lnear hyperbolc PDE that descrbes the propagaton of a varety of waves, such as
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationPractical Newton s Method
Practcal Newton s Method Lecture- n Newton s Method n Pure Newton s method converges radly once t s close to. It may not converge rom the remote startng ont he search drecton to be a descent drecton rue
More informationAnouncements. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers
Anouncements ultgrd Solvers The readng semnar starts ths week: o Usuall t wll e held n NEB 37 o Ths week t wll e n arland 3 chael Kazhdan (6657 ultgrd Solvers Recall: To compute the soluton to the osson
More informationLeast squares cubic splines without B-splines S.K. Lucas
Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationNUMERICAL 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 informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationThe 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 informationChapter 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 informationMathematical 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 informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationSpring 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 informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationPopulation element: 1 2 N. 1.1 Sampling with Replacement: Hansen-Hurwitz Estimator(HH)
Chapter 1 Samplng wth Unequal Probabltes Notaton: Populaton element: 1 2 N varable of nterest Y : y1 y2 y N Let s be a sample of elements drawn by a gven samplng method. In other words, s s a subset of
More informationWeek3, 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= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationGrid Generation around a Cylinder by Complex Potential Functions
Research Journal of Appled Scences, Engneerng and Technolog 4(): 53-535, 0 ISSN: 040-7467 Mawell Scentfc Organzaton, 0 Submtted: December 0, 0 Accepted: Januar, 0 Publshed: June 0, 0 Grd Generaton around
More informationDepartment of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6
Department of Quanttatve Methods & Informaton Systems Tme Seres and Ther Components QMIS 30 Chapter 6 Fall 00 Dr. Mohammad Zanal These sldes were modfed from ther orgnal source for educatonal purpose only.
More informationAS-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 informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationDifference 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 informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationPropagation of error for multivariable function
Propagaton o error or multvarable uncton ow consder a multvarable uncton (u, v, w, ). I measurements o u, v, w,. All have uncertant u, v, w,., how wll ths aect the uncertant o the uncton? L tet) o (Equaton
More information: 5: ) A
Revew 1 004.11.11 Chapter 1: 1. Elements, Varable, and Observatons:. Type o Data: Qualtatve Data and Quanttatve Data (a) Qualtatve data may be nonnumerc or numerc. (b) Quanttatve data are always numerc.
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLecture 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 informationLecture 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 informationComputational 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 informationStatistics 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 informationNumerical Differentiation
Part 5 Capter 19 Numercal Derentaton PowerPonts organzed by Dr. Mcael R. Gustason II, Duke Unversty Revsed by Pro. Jang, CAU All mages copyrgt Te McGraw-Hll Companes, Inc. Permsson requred or reproducton
More informationPhysics 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 informationPHYS 1441 Section 002 Lecture #15
PHYS 1441 Secton 00 Lecture #15 Monday, March 18, 013 Work wth rcton Potental Energy Gravtatonal Potental Energy Elastc Potental Energy Mechancal Energy Conservaton Announcements Mdterm comprehensve exam
More informationInternational 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= 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 informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationChapter 15 Student Lecture Notes 15-1
Chapter 15 Student Lecture Notes 15-1 Basc Busness Statstcs (9 th Edton) Chapter 15 Multple Regresson Model Buldng 004 Prentce-Hall, Inc. Chap 15-1 Chapter Topcs The Quadratc Regresson Model Usng Transformatons
More informationStatistics for Business and Economics
Statstcs for Busness and Economcs Chapter 11 Smple Regresson Copyrght 010 Pearson Educaton, Inc. Publshng as Prentce Hall Ch. 11-1 11.1 Overvew of Lnear Models n An equaton can be ft to show the best lnear
More informationMATH 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 informationIntroduction 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 information6.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 informationMath1110 (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 informationEE 330 Fall 2016 Seating
EE 0 Fall 06 Seatng 4 5 6 7 8 9 Brandon Bater Zachar Bennett Steven Warren Jakub Hladk Tmoth Lndqust Jacob Johnson Wllam Henthorn Danel Gren Xang L Y Qu Benjamn Gsler Davd Clark Benjamn Zckeoose Karla
More informationUnit 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 informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationANALYSIS OF SOURCE LOCATION ALGORITHMS Part II: Iterative methods
ANALYSIS OF SOURCE LOCATION ALGORITHMS Part II: Iteratve methods MAOCHEN GE Pennsylvana State Unversty, Unversty Park PA 1680 Abstract Iteratve algorthms are o partcular mportance n source locaton as they
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationJournal 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 informationTEST 5 (phy 240) 2. Show that the volume coefficient of thermal expansion for an ideal gas at constant pressure is temperature dependent and given by
ES 5 (phy 40). a) Wrte the zeroth law o thermodynamcs. b) What s thermal conductvty? c) Identyng all es, draw schematcally a P dagram o the arnot cycle. d) What s the ecency o an engne and what s the coecent
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationSection 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 informationComplex Variables. Chapter 18 Integration in the Complex Plane. March 12, 2013 Lecturer: Shih-Yuan Chen
omplex Varables hapter 8 Integraton n the omplex Plane March, Lecturer: Shh-Yuan hen Except where otherwse noted, content s lcensed under a BY-N-SA. TW Lcense. ontents ontour ntegrals auchy-goursat theorem
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More information