Chapter 9: Numerical Differentiation
|
|
- Alicia Warren
- 5 years ago
- Views:
Transcription
1 178 Chapter 9: Numerical Differetiatio Numerical Differetiatio Formulatio of equatios for physical problems ofte ivolve derivatives (rate-of-chage quatities, such as velocity ad acceleratio). Numerical solutio of such problems ivolves umerical evaluatio of the derivatives. Oe method for umerically evaluatig derivatives is to use Fiite DIffereces: From the defiitio of a first derivative dy = y' ( x) dx we ca take a fiite approximatio as y' ( x) which is called Forward DIfferece Approximatio. Similarly, we could use the Backward Differece Approximatio: ( yx + ) y( x) lim y( x + ) y( x) y( x) y( x ) y' ( x) Ad, i either case, we ca reduce a roudoff errors i the computatios by choosig to be a small value that ca be exactly represeted i biary (for example ot 0.1).
2 179 Also, i additio to a x differece that ca be exactly represeted i biary, we ca get a somewhat better approximatio to the first derivative with a Cetral Fiite Differece: y' ( x) y( x + ) y( x ) Example: Give a expressio for the fuctio f(x, y) i the equatio: dy = f ( x, y) dx we ca umerically approximate y values over the rage of x, with the differece equatio: y( x + ) y( x) = f ( x, y) Assumig we kow the iitial value y 0 ad we subdivide the x rage from x 0 to x ito equal itervals, we ca solve for each successive y value as y k = y k 1 + f ( x k 1, y k 1 ), k = 1, 2,, I geeral, such problems ca be solved with ouiform x subitervals ad with kow iitial or boudary coditos.
3 180 Usig similar methods, we ca evaluate equatios ivolvig partial derivatives, ad we ca set up fiite differece approximatios for higher order derivatives. For istace, for secod derivatives, we ca use the approximatio y' ( x) y( x + ) 2y( x ) Derivative Fuctios i Mathematica Numerical evaluatio of differet equatios accomplished with NDSolve[ eqs, y, {x, ymi, xmax]} - umerically solves eqs (which iclude iitial or boudary equatios) for y with idepedet variable x i the rage xmi to xmax. NDSolve[ eqs, {y1, y2,...}, {x, xmi, xmax}] - solves the set of eqs for values y1, y2, etc. Example: NDSolve[{y [x]==exp[x],y[0]==1},y,{x,0,5}] {{y -> IterpolatigFuctio[{0., 5.}, <>]}} Solutio the stored as a iterpolatio table, ad we retrieve values with statemets such as y[1.0 /. % { }
4 181 Also, we ca use statemets such as Plot[Evaluate[y[x] /. %], {x,xmi, xmax}] to plot the umeric solutio. Symbolic differece performed with D[, x] - evaluates first derivative of with respect to x. (Ca also be applied to f(x1, x2,...).) D[, {x, } ] - evaluates th derivative of with respect to x. Examples: (Also ca use D fuctio to obtai partial derivatives.) D[Exp[x],x] E x D[x^3, x] 3 x 2 D[x^3, {x, 2}] 6 x {secod derivative D[x^2 y, x] {partial derivative 2 x y
5 182 Chapter 9: Numerical Itegratio Numerical Itegratio Most itegrals arisig from solutios of problems i egieerig ad sciece caot be represeted i closed form - they must be evaluated umerically. For fuctio of a sigle variable, we seek a approximatio to the area uder the curve: Area = b a f ( x) dx a b x For fuctio of several variables, we seek approximatio to the size of the volume for the specified itegratio regio. We will cosider oly algorithms for fuctios of a sigle variable:.
6 183 Numerical evaluatio procedures for a fuctio of a sigle variable ivolve summatio of small subareas, usig simple fuctios to approximate. For example, by defiitio of itegral: b f ( x ) dx = lim f ( x k ) k a a k = 1 with k = x k x k 1 We ca approximate itegral with a fiite umber of subitervals usig a costat value for i each subiterval: f ( x) = f ( x 1 ) x k 1 x x k, k = 1, 2,, x 0 =a x 1 x 2 x 3 x -1 x =b I this case, we approximate itegral by addig the areas of a set of approximatig rectagles.
7 184 Example: f ( x) = 1 x 2, a = 1, b = 1 A = 1 1 g( x) dx x Selectig equal width itervals with with = 5, we have b a 2 k = = -- = 0.4 k 5 The area is the approximated as A k = 1 with x k = x k 1 + k ad x 0 = -1. f ( x k ) k x The A f ( x k ) 0.4( ) k = Actual size of area: A πr
8 185 We ca improve umerical estimate of itegral by Icreasig umber of itervals. Usig a more accurate approximatio of i each iterval. Commo Approximatio Methods: Liear Quadratic or Higher-Order Polyomial Trapezoidal Rule Approximate with liear fuctio over each subiterval. Area is the calculated as the sum of the areas of resultig trapezoids: Takig equal-width itervals: b a = x 0 = a x 1 x 2 x 3... Thus, or Area of each trapezoid is A k f ( x k 1) + f ( x k ) = , 2 k = 1, 2,, b f ( x) dx [ f ( x 2 0 ) + f ( x 1 ) ] + [ f ( x 1 ) + f ( x 2 ) ] + a + [ f ( x 1 ) + f ( x )] } b f ( x) x [ f ( a d ) + f ( b) ] + f ( x k ) a k = 1
9 186 Example: Trapezoidal Rule to evaluate Width of each iterval is 1 ( 1) = = Itegral is the evaluated as 1 1 x 2 x, = 5 1 x 0 = 1, x k = x k 1 +, k = 1, 2, 3, 4, 5 1 f ( x) x f ( 1) + f ( 1) 4 d + 2 f ( x ) k 1 k = 1 0.4( ) 1.42 (Same result as obtaied usig rectagular areas. Why?)
10 187 Simpso s Rule Approximates with a quadratic fuctio. More accurate evaluatio of itegral tha Trapezoidal Rule (a liear approximatio). Simpso s Rule (parabola) Trapezoidal Rule (liear) x k-1 x k 1 + x k x k I this case, the itegral is approximated as x k b f ( x) dx ( α 0 + α 2 x + α 2 x 2 ) dx a k = 1 x k 1 To evaluate the summatio, we eed to determie the parabola coefficiets α 0, α 1, α 2 i each of the subdivisios. We ca accomplish this with three boudary coditios that require the parabola to itersect at the edpoits ad at the midpoit of each subdidivisio.
11 188 Applyig Simpso s Rule: 1. Divide iterval (a, b) ito equal subitervals, with a multiple of Approximate with parabola across every two subitervals. α 0 + α 1 x + α 2 x 2 x k-1 x k x k+1 Obtai coefficiets α 0, α 1, α 2 by solvig 2 α 0 + α 1 x k 1 + α 2 x k 1 = f ( x k 1 ) 2 α 0 + α 1 x k + α 2 x k = f ( x k ) 2 α 0 + α 1 x k α 2 x k + 1 = f ( x k + 1 ) over each of the itervals (x k-1, x k+1 ).
12 189 We the approximate itegral as x k + 1 f x dx 1 ( α 0 + α 1 x + α 2 x 2 ) dx a k = 1 x k 1 kodd 1 k = 1 kodd α 0 x + a 1 x 2 x α x k + 1 x k 1 Substitutig the solutio for α 0, α 1, α 2 over itervals (x k-1, x k+1 ), we obtai b s 1 1 f ( x) dx -- [ f ( x 3 k 1 ) + 4 f ( x k ) + f ( x k + 1 )] k = 1 kodd where = x k+1 - x k = x k - x k-1 {Note: A easy way to derive this result is to cosider a parabols specified over the iterval (- x, x ). Hece, b f ( x) dx [( f f 1 + f 2 ) + ( f f 3 + f 4 ) + ] a Collectig terms, we have Simpso s Rule: b a f ( x) dx f ( a) + f b ( ) 4 f ( x) + 2 f ( x k ) k = 1 k = 2 ( odd) ( eve) with each successive x value calculated as x k = x k 1 + ( k = 1, 2,, ) 2
13 190 Example: Simpso s Rule Evaluatio of 1 1 x 2 d x, = 4 The, Ad 1 1 ( 1) = = x 0 = 1, x k = x k = 1 +, k = 1, 2, 3, f ( x) dx f ( 1) + f ( 1) + 4 f ( x 3 k ) + 2 f ( x k ) 1 k = 1 k = 2 ( odd) ( eve) { 4[ f ( x 3 1 ) + f ( x 3 )] + 2 f ( x 2 )} 1 -- [ 4( ) + 2( 1) ] ( 8.96) where f ( x) d x 1.57 Thus Simplso with =4 is better tha Trapezoidal with =5. 1
14 191 Psuedocode Algorithm - Simpso s Rule Iput f, a, b, (* fc, iteger limits, o. of itervals *) dx = (b-a)/ dx2 = dx + dx odds = 0.0; eves = 0.0 x = a Do k=2, -2, 2 x = x + dx2 eves = eves + Edofdo x = a - dx Do k = 1, -1, 2 x = x + dx2 odds = odds + Edofdo simpsoarea=(dx/3.0)*(f(a)+f(b)+4.0*odds+2.0*eves) Summary of Itegratio Methods Approximate = f(x k ) (costat) over each iterval A b a f ( x ) k k = 1 x 0 = a, x = b x k = x k = 1 + ( b a) Trapezoidal Rule: Liear Approximatio A b a f ( a) + f ( b) f ( x ) k k = 1 Simpso s Rule: Quadratic Approximatio, eve A f ( a) + f ( b) + 4 f ( x 3 k ) + 2 f ( x k ) k = 1 k = 2 = (b-a)/ ( odd) ( eve)
15 192 Numerical Itegratio Errors For small, error is primarily due to approx. of (width of subitervals large). For large, roudoff errors become sigificat; i.e., area of each subiterval small, ad this value ca get lost i precisio of larger accumulated area: accumulated area ext subiterval a b x Error Magitude Plot: error roudoff error approximatio error (due to width of subitervals) ideal umber of subitervals Ideal value for depeds o: Form of Itegratio method used Computer System
16 193 Numerical Itegratio Improvemets Repeatedly icrease umber of subitervals util area estimate is withi specified tolerace. A method for accomplishig this is to start with large subitervals ad the double the umber of itervals at each step: Iput compute: area oldarea = area = 2 compute: area relerror = (oldarea - area) o relerror < tolerace yes retur Also, could use higher-order polyomials to approximate over each of the subitervals. Ad we could use higher precisio i calculatios to reduce roudoff errors. (Tradeoff: more calculatio time.)
17 194 Numerical Evaluatio of Ifiite Itegrals Divide itegral ito parts ad apply a umerical itegratio techique to each part util cotributios ted to zero. For example: a f ( x) dx = a 1 a 1 f ( x) dx + a 2 a 1 f ( x) dx + a 1 a 1 f ( x) dx + If itegral is fiite, the we must have f ( x) 0 as x, That is, we ca compute the itegral as a fiite umber of terms: a f ( x) dx = f ( x) dx + ε a a k 1 k = 1 whter the error term is less tha some specified tolerace.
18 195 Mote Carlo Methods Examples: Use of radom umbers to solve determiistic problems. This approach useful for umerically evaluatig complex itegrals. Multiple Itegratio b 1 b b 1 b f ( x 1, x 2,, x ) x 1 Fuctios with High-Frequecy Oscillatios b b d d x 2 dx a b x Basic Approach: Geerate uiformly distributed radom poits i a area cotaiig ad the iterval (a, b) -- where area is ot too large compared to itegral area. The compute: h a b x b f ( x) dx a h( b a) = lim umber of poits uder where (b-a) may be positive or egative, ad we might have < 0 over part or all of the iterval (a, b).
19 196 Algorithm: Mote Carlo Itegratio 1. Geerate two uiformly distributed radom umbers r 1, r 2 i the iterval (0,1). x = a + r 1 ( b a) 2. Assumig 0, calculate coordiate positios (x,y) as: y = r 2 h h f(x,y) a b x Cout poit (x,y) as uder if 0 y f ( x) f ( x) 0 3. If < 0 for a value of x i the iterval (a,b), calculate coordiate positio as h = y max y mi y max x = a + r 1 ( b a) a f(x,y) b y = y mi + r 2 h y mi Cout poit (x,y) as uder if 0 y f ( x) for f ( x) < 0 I this case, we subtract 1 from the poit cout; i.e., ptcout =, - where is the umber of poits below the x axis.
20 197 Pseudocode Algorithm - Mote Carlo Itegratio Iput f, a, b, h, (* assume > 0; how width = b - a ca this be modified ptcout = 0 for < 0 also? *) Do k = 1, x = a + width * Radom( ) y = h * Radom( ) If (y < ) The ptcout = ptcout + 1 Edofif Edofdo area = h * width * ptcout / 1 Example: 1 x 2 dx 1 y mi = 0, y max = 1 a = 1, b = 1, h = 1, = 10 y x r 1 r 2 x = r 1 y = r 2 = 1 - x 2 ptcout
21 198 r 1 r 2 x = r 1 y = r 2 = 1 - x 2 ptcout Itegratio Fuctios i Mathematica Itegrate[, x] - idefiite itegral of Itegrate[, {x, xmi, xmax}] - defiite itegral of with itegratio limits xmi ad xmax Itegrate[f(x, y), {x, xmi, xmax}, {y, ymi, ymax}] - multiple itegral of fuctio f(x, y) Nitegrate[... ] - umerically evaluate itegral Examples: Itegrate[x^3,x] x Itegrate[x^3,{x,a,b}] x 4 b Itegrate[x^3,{x,0,1}]
22 199 Itegrate[Sqrt[1-x^2],{x,-1,1}] Pi NItegrate[Sqrt[1-x^2],{x,-1,1}] f[x_, y_1] := x y^2 Itegrate[f[x,y], {x,0,a}, {y,0,b}] a 2 b Itegrate[f[x,y], {x,0,3}, {y,0,2}] 12 NItegrate[f[x,y], {x,0,3}, {y,0,2}] (roudoff error)
Math 1314 Lesson 16 Area and Riemann Sums and Lesson 17 Riemann Sums Using GeoGebra; Definite Integrals
Math 1314 Lesso 16 Area ad Riema Sums ad Lesso 17 Riema Sums Usig GeoGebra; Defiite Itegrals The secod questio studied i calculus is the area questio. If a regio coforms to a kow formula from geometry,
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 information18.01 Calculus Jason Starr Fall 2005
Lecture 18. October 5, 005 Homework. Problem Set 5 Part I: (c). Practice Problems. Course Reader: 3G 1, 3G, 3G 4, 3G 5. 1. Approximatig Riema itegrals. Ofte, there is o simpler expressio for the atiderivative
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
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 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 informationFor example suppose we divide the interval [0,2] into 5 equal subintervals of length
Math 1206 Calculus Sec 1: Estimatig with Fiite Sums Abbreviatios: wrt with respect to! for all! there exists! therefore Def defiitio Th m Theorem sol solutio! perpedicular iff or! if ad oly if pt poit
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 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 informationINTRODUCTORY MATHEMATICAL ANALYSIS
INTRODUCTORY MATHEMATICAL ANALYSIS For Busiess, Ecoomics, ad the Life ad Social Scieces Chapter 4 Itegratio 0 Pearso Educatio, Ic. Chapter 4: Itegratio Chapter Objectives To defie the differetial. To defie
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 informationMonte Carlo Integration
Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce
More informationSection 13.3 Area and the Definite Integral
Sectio 3.3 Area ad the Defiite Itegral We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate
More informationMath 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums)
Math 176 Calculus Sec. 5.1: Areas ad Distaces (Usig Fiite Sums) I. Area A. Cosider the problem of fidig the area uder the curve o the f y=-x 2 +5 over the domai [0, 2]. We ca approximate this area by usig
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 informationFor example suppose we divide the interval [0,2] into 5 equal subintervals of length
Math 120c Calculus Sec 1: Estimatig with Fiite Sums I Area A Cosider the problem of fidig the area uder the curve o the fuctio y!x 2 + over the domai [0,2] We ca approximate this area by usig a familiar
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 information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationAreas and Distances. We can easily find areas of certain geometric figures using well-known formulas:
Areas ad Distaces We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate the area of the regio
More informationNumerical Methods in Fourier Series Applications
Numerical Methods i Fourier Series Applicatios Recall that the basic relatios i usig the Trigoometric Fourier Series represetatio were give by f ( x) a o ( a x cos b x si ) () where the Fourier coefficiets
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationLøsningsførslag i 4M
Norges tekisk aturviteskapelige uiversitet Istitutt for matematiske fag Side 1 av 6 Løsigsførslag i 4M Oppgave 1 a) A sketch of the graph of the give f o the iterval [ 3, 3) is as follows: The Fourier
More informationMachine Learning Brett Bernstein
Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio
More informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
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 informationNumerical Methods for Ordinary Differential Equations
Numerical Methods for Ordiary Differetial Equatios Braislav K. Nikolić Departmet of Physics ad Astroomy, Uiversity of Delaware, U.S.A. PHYS 460/660: Computatioal Methods of Physics http://www.physics.udel.edu/~bikolic/teachig/phys660/phys660.html
More informationMath 257: Finite difference methods
Math 257: Fiite differece methods 1 Fiite Differeces Remember the defiitio of a derivative f f(x + ) f(x) (x) = lim 0 Also recall Taylor s formula: (1) f(x + ) = f(x) + f (x) + 2 f (x) + 3 f (3) (x) +...
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 information10-701/ Machine Learning Mid-term Exam Solution
0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationMath 21B-B - Homework Set 2
Math B-B - Homework Set Sectio 5.:. a) lim P k= c k c k ) x k, where P is a partitio of [, 5. x x ) dx b) lim P k= 4 ck x k, where P is a partitio of [,. 4 x dx c) lim P k= ta c k ) x k, where P is a partitio
More informationNANYANG TECHNOLOGICAL UNIVERSITY SYLLABUS FOR ENTRANCE EXAMINATION FOR INTERNATIONAL STUDENTS AO-LEVEL MATHEMATICS
NANYANG TECHNOLOGICAL UNIVERSITY SYLLABUS FOR ENTRANCE EXAMINATION FOR INTERNATIONAL STUDENTS AO-LEVEL MATHEMATICS STRUCTURE OF EXAMINATION PAPER. There will be oe 2-hour paper cosistig of 4 questios.
More informationNumerical Integration Formulas
Numerical Itegratio Formulas Berli Che Departmet o Computer Sciece & Iormatio Egieerig Natioal Taiwa Normal Uiversity Reerece: 1. Applied Numerical Methods with MATLAB or Egieers, Chapter 19 & Teachig
More information4.1 SIGMA NOTATION AND RIEMANN SUMS
.1 Sigma Notatio ad Riema Sums Cotemporary Calculus 1.1 SIGMA NOTATION AND RIEMANN SUMS Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each
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 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 informationName: Math 10550, Final Exam: December 15, 2007
Math 55, Fial Exam: December 5, 7 Name: Be sure that you have all pages of the test. No calculators are to be used. The exam lasts for two hours. Whe told to begi, remove this aswer sheet ad keep it uder
More informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More informationMath 10A final exam, December 16, 2016
Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the
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 informationA) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set.
M.A./M.Sc. (Mathematics) Etrace Examiatio 016-17 Max Time: hours Max Marks: 150 Istructios: There are 50 questios. Every questio has four choices of which exactly oe is correct. For correct aswer, 3 marks
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 informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationUNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014
UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 6C Problem Set 4 Bejami Stahl November 6, 4 BOAS, P. 63, PROBLEM.-5 The Laguerre differetial equatio, x y + ( xy + py =, will be solved
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 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 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 informationCalculus 2 - D. Yuen Final Exam Review (Version 11/22/2017. Please report any possible typos.)
Calculus - D Yue Fial Eam Review (Versio //7 Please report ay possible typos) NOTE: The review otes are oly o topics ot covered o previous eams See previous review sheets for summary of previous topics
More information5 3B Numerical Methods for estimating the area of an enclosed region. The Trapezoidal Rule for Approximating the Area Under a Closed Curve
5 3B Numerical Methods for estimatig the area of a eclosed regio The Trapezoidal Rule for Approximatig the Area Uder a Closed Curve The trapezoidal rule requires a closed o a iterval from x = a to x =
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationLecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods
Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace
More informationThe Definite Integral. Day 3 Riemann Sums
The Defiite Itegral Day 3 Riema Sums 2 2 1. If x xy y 9, the a vertical taget exists at ( A) 2 3, 3 ( B) 3,2 3 ( C) 2 3, 3 ( D) 3,2 3 ( E) 2 3, 3 2. Use a local lieariazatio for f x 9 ta x about x 0, the
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
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 informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationy = f(x), below by y = -1 and on the sides by x = 1/2n and x = 1. This area n~x
124 CHAP. II. AREAS 11.58. Show that bcf (x) dx = Clb f (x) dx where C is a costat. Assume J thatf(x) is such that the defiitio of the itegral i (11.34) applies, ad use this defiitio to prove the above
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Ifiite Series 9. Sequeces a, a 2, a 3, a 4, a 5,... Sequece: A fuctio whose domai is the set of positive itegers = 2 3 4 a = a a 2 a 3 a 4 terms of the sequece Begi with the patter
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
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 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 informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
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 informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationPC5215 Numerical Recipes with Applications - Review Problems
PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,
More informationME NUMERICAL METHODS Fall 2007
ME - 310 NUMERICAL METHODS Fall 2007 Group 02 Istructor: Prof. Dr. Eres Söylemez (Rm C205, email:eres@metu.edu.tr ) Class Hours ad Room: Moday 13:40-15:30 Rm: B101 Wedesday 12:40-13:30 Rm: B103 Course
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
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 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 informationCarleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.
Carleto College, Witer 207 Math 2, Practice Fial Prof. Joes Note: the exam will have a sectio of true-false questios, like the oe below.. True or False. Briefly explai your aswer. A icorrectly justified
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationSolutions to Final Exam Review Problems
. Let f(x) 4+x. Solutios to Fial Exam Review Problems Math 5C, Witer 2007 (a) Fid the Maclauri series for f(x), ad compute its radius of covergece. Solutio. f(x) 4( ( x/4)) ( x/4) ( ) 4 4 + x. Sice the
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 informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for
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 informationArchimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion
Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,
More informationMATH 31B: MIDTERM 2 REVIEW
MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate x (x ) (x 3).. Partial Fractios Solutio: The umerator has degree less tha the deomiator, so we ca use partial fractios. Write x (x ) (x 3) = A x + A (x ) +
More informationECE Spring Prof. David R. Jackson ECE Dept. Notes 20
ECE 6341 Sprig 016 Prof. David R. Jackso ECE Dept. Notes 0 1 Spherical Wave Fuctios Cosider solvig ψ + k ψ = 0 i spherical coordiates z φ θ r y x Spherical Wave Fuctios (cot.) I spherical coordiates we
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More information10.6 ALTERNATING SERIES
0.6 Alteratig Series Cotemporary Calculus 0.6 ALTERNATING SERIES I the last two sectios we cosidered tests for the covergece of series whose terms were all positive. I this sectio we examie series whose
More informationInfinite Series and Improper Integrals
8 Special Fuctios Ifiite Series ad Improper Itegrals Ifiite series are importat i almost all areas of mathematics ad egieerig I additio to umerous other uses, they are used to defie certai fuctios ad to
More informationChapter 2 The Monte Carlo Method
Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful
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 informationChapter 5.4 Practice Problems
EXPECTED SKILLS: Chapter 5.4 Practice Problems Uderstad ad kow how to evaluate the summatio (sigma) otatio. Be able to use the summatio operatio s basic properties ad formulas. (You do ot eed to memorize
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 informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationFind quadratic function which pass through the following points (0,1),(1,1),(2, 3)... 11
Adrew Powuk - http://www.powuk.com- Math 49 (Numerical Aalysis) Iterpolatio... 4. Polyomial iterpolatio (system of equatio)... 4.. Lier iterpolatio... 5... Fid a lie which pass through (,) (,)... 8...
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
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 information