Math 257: Finite difference methods

Size: px
Start display at page:

Download "Math 257: Finite difference methods"

Transcription

1 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) +... (2) 2! 3! or, with istead of +: Forward differece f(x ) = f(x) f (x) + 2 2! f (x) 3 f (3) (x) +... (3) 3! O a computer, derivatives are approximated by fiite differece expressios; rearragig (2) gives the forward differece approximatio f(x + ) f(x) = f (x) + O(), (4) where O() meas terms of order, ie. terms which have size similar to or smaller tha whe is small. 1 So the expressio o the left approximates the derivative of f at x, ad has a error of size ; the approximatio is said to be first order accurate. 1 The strict mathematical defiitio of O(δ) is to say that it represets terms y such that ( y ) lim is fiite. δ 0 δ So δ 2 ad δ are O(δ), but δ 1/2 or 1, for istace, are ot. Aother commoly used otatio is o(δ), which represets terms y for which ( y ) lim = 0. δ 0 δ I other words, o(δ) represets terms that are strictly smaller tha δ as δ 0. So δ 2 is o(δ), but δ is ot. 1

2 Backward differece Rearragig (3) similarly gives the backward differece approximatio f(x) f(x ) which is also first order accurate, sice the error is of order. Cetered differece = f (x) + O(), (5) Combiig (2) ad (3) gives the cetered differece approximatio f(x + ) f(x ) 2 = f (x) + O( 2 ), (6) which is secod order accurate, because the error this time is of order 2. Secod derivative, cetered differece Addig (2) ad (3) gives f(x + ) + f(x ) = 2f(x) + 2 f (x) f (4) (x) +... (7) Rearragig this therefore gives the cetered differece approximatio to the secod derivative: f(x + ) 2f(x) + f(x ) 2 = f (x) + O( 2 ), (8) which is secod order accurate. 2 Heat Equatio Dirichlet boudary coditios To fid a umerical solutio to the heat equatio t = 2 u α2, 0 < x < L, (9) x2 u(0, t) = A, u(l, t) = B, u(x, 0) = f(x), (10) approximate the time derivative usig forward differeces, ad the spatial derivative usig cetered differeces; u(x, t + t) u(x, t) t 2 u(x +, t) 2u(x, t) + u(x, t) = α + O( t, 2 ). (11) 2 2

3 t t u k 1 u k u k +1 u 2 1 u 2 0 u 2 N u 2 N+1 u 1 1 u 1 0 u 1 N u 1 N+1 u 0 0 u 0 1 u 0 2 u 0 N x 0 x 1 x 2 x N x = 0 x = L Figure 1: Mesh poits ad fiite differece stecil for the heat equatio. Blue poits are prescribed the iitial coditio, red poits are prescribed by the boudary coditios. For Neuma boudary coditios, fictioal poits at x = ad x = L + ca be used to facilitate the method. This approximatio is secod order accurate i space ad first order accurate i time. The use of the forward differece meas the method is explicit, because it gives a explicit formula for u(x, t + t) depedig oly o the values of u at time t. Divide the iterval 0 < x < L ito N + 1 evely spaced poits, with spacig ; ie. x =, for = 0, 1,..., N, ad divide time ito discrete levels t k = k t for k = 0, 1,.... The seek the solutio by fidig the discrete values From (11), these satisfy the equatios u k t u k = u(x, t k ). (12) = α 2 uk +1 2u k + u k 1 2, (13) or, rearragig, = u k + α2 t ( ) u k u k + u k 1. (14) If the values of u at timestep k are kow, this formula gives all the values at timestep k + 1, ad it ca the be iterated agai ad agai to march forward i time. The iitial coditio gives u 0 = f(x ), (15) 3

4 for all, ad the boudary coditios require u k 0 = A, u k N = B, (16) for all values of k > 0 (equatio (14) oly has to be solved for 1 N 1). Stability Note, this method will oly be stable, provided the coditio is satisfied; otherwise it will ot work. Neuma boudary coditios α 2 t 2 1 2, (17) To apply (0, t) = C, (18) x istead of (10), otice that the cetered differece versio of this boudary coditio would be u(0 +, t) u(0, t) = C, (19) 2 ad therefore u(, t) = u(, t) 2C. (20) x = is outside the domai of iterest, but kowig the value of u(, t) there allows the discretised equatio (14) to be used also for x = 0 ( = 0), ad it becomes 0 = u k 0 + α2 t 2 ( 2u k 1 2u k 0 2C ). (21) So i this case we must solve (14) for 1 N 1, ad (21) for = 0 at each timestep. If there is a derivative coditio at x = L the same procedure is followed ad a equatio similar to (21) must be solved for = N too. A hady way to implemet this type of boudary coditio, which eables the same formula (14) to be used for all poits, is to itroduce fictioal mesh poits for = 1 ad = N +1, ad to prescribe the value u k 1 give by (20) (or the equivalet for u k N+1 ) at those poits. 4

5 3 Wave equatio For the wave equatio, 2 u t = 2 u 2 c2, x2 0 < x < L, (22) u(0, t) = 0, u(l, t) = 0, (23) u(x, 0) = f(x), (x, 0) = g(x), (24) t discretise x ito N + 1 evely spaced mesh poits x =, discretise time ito evely spaced time levels t k = k t, ad seek the solutio at these mesh poits; u k = u(x, t k ). Usig cetered differece approximatios to the two secod derivatives, the discrete equatio is 2u k + u k 1 t 2 This ca be rearraged to give = c 2 uk +1 2u k + k O( 2, t 2 ). (25) = 2u k u k 1 + c2 t 2 ( ) u k u k + k 1, (26) which gives a explicit method to calculate i terms of the values at the previous two timesteps k ad k 1. This method is secod order accurate i space ad time - it is sometimes referred to as the leap-frog method. Boudary coditios To apply Dirichlet boudary coditios (23), the values of 0 ad N are simply prescribed to be 0; there is o eed to solve a equatio for these ed poits. If the boudary coditios are Neuma, o the other had: (0, t) = 0, x (L, t) = 0, (27) x the (26) ca still be solved for = 0 ad = N if we use the cetered differece approximatios to the boudary coditios i order to determie the fictioal values u k 1 ad u k N+1 respectively. At x = 0, for istace, the discretised coditio (27) is u k 1 u k 1 2 = 0, (28) ad therefore u k 1 = u k 1. Similarly u k N+1 = uk N 1. 5

6 t t u k 1 u k u k +1 u k 1 u 2 1 u 2 0 u 2 N u 2 N+1 u 1 1 u 1 0 u 1 N u 1 N+1 u 0 0 u 0 1 u 0 2 u 0 N x 0 x 1 x 2 x N x = 0 x = L Figure 2: Mesh poits ad fiite differece stecil for the wave equatio. Iitial coditios To apply the iitial coditios, ote that to use (26) for the first timestep k = 1, we eed to kow the values of u 0 ad also u 1. The values of u 0 follow from the iitial coditio o u(x, 0); u 0 = f(x ). (29) The values of u 1 come from cosiderig the cetered differece approximatio to the derivative coditio (24); from which u(x, 0 + t) u(x, 0 t) 2 t = g(x), (30) u 1 = u 1 2 tg(x ). (31) Substitutig this ito the discrete equatio (26), ad rearragig, gives the formula u 1 = u c 2 t 2 ( ) u u tg(x ), (32) for the first timestep. Oce the solutio has bee iitialised i this way, all subsequet timesteps ca be made usig (26). 6

7 Stability This method is stable provided c t 1, (33) which is ofte called the Courat-Friedrichs-Levy (or CFL) coditio. 4 Laplace s equatio Laplace s equatio o a square domai is with boudary coditios, for istace, 2 u x + 2 u = 0, 0 < x < L, 0 < y < L, (34) 2 y2 u(0, y) = 0, u(l, y) = 0, u(x, 0) = f(x), u(x, L) = 0. (35) Choose a mesh with spacig i the x directio, y i the y directio (ofte it is sesible to choose = y), so grid poits are x = for = 0, 1,... N, ad y m = m y for m = 0, 1,... M. The seek solutio values u m = u(x, y m ). Usig secod order accurate cetered differeces for the two derivatives, the discrete equatio is u +1 m 2u m + u 1 m 2 ad if = y this simplifies to + u m+1 2u m + u m 1 y 2 = O( 2, y 2 ), (36) u m = 1 4 (u +1 m + u 1 m + u m+1 + u m 1 ) (37) Note this equatio shows that the solutio has the property that the value at each poit (x, y m ) is the average of the values at its four eighbourig poits. This is a importat property of Laplace s equatio. Boudary coditios The boudary coditios (35) determie the values u m o each of the four boudaries, so (37) does ot have to be solved at these mesh poits: u 0 m = 0, u N m = 0, u 0 = f(x ), u M = 0. (38) Neuma boudary coditios ca be icorporated by calculatig values for u 1 m (for istace), as for the heat equatio. 7

8 y = L y M u 0 M u N M u m+1 y u 1 m u m u +1 m u m 1 y 1 u 0 1 y = 0 y 0 u 0 0 u 1 0 u 2 0 u N 0 x 0 x 1 x 2 x N x = 0 x = L Figure 3: Mesh poits ad fiite differece stecil for Laplace s equatio. Jacobi Iteratio Note (37) is ot a explicit formula, sice the solutio at each poit depeds o the ukow values at other poits, ad it is therefore harder to solve tha the previous explicit methods. Oe way to do it, however, is to take a guess at the solutio (eg. u m = 0 everywhere), ad the go through each of the mesh poits updatig the solutio accordig to (37) by takig the values of the previous guess o the right had side. Iteratig this process may times, the successive approximatios will hopefully chage by less ad less, ad the values they coverge to provide the solutio. Give a iitial guess u (0) m, the successive iteratios u (1) m,..., u (k) m, u (k+1) m,..., are give by u (k+1) m = 1 ( ) u (k) +1 m + u (k) 1 m + u (k) m+1 + u (k) m 1. (39) 4 Here the superscript (k) deotes the values for the kth iteratio. The process is cotiued util the chage betwee successive iteratios is less tha some desired tolerace. 8

Lecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods

Lecture 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 information

62. 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 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 information

6.3 Testing Series With Positive Terms

6.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 information

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =! .8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has

More information

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

THE 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 information

Chapter 4. Fourier Series

Chapter 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 information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

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,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Mathematics 116 HWK 21 Solutions 8.2 p580

Mathematics 116 HWK 21 Solutions 8.2 p580 Mathematics 6 HWK Solutios 8. p580 A abbreviatio: iff is a abbreviatio for if ad oly if. Geometric Series: Several of these problems use what we worked out i class cocerig the geometric series, which I

More information

Løsningsførslag i 4M

Lø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 information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A

More information

Chapter 10: Power Series

Chapter 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 information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 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 information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL 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 information

Solutions to Final Exam Review Problems

Solutions 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 information

Math 113 Exam 3 Practice

Math 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 information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences 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

Practice Problems: Taylor and Maclaurin Series

Practice Problems: Taylor and Maclaurin Series Practice Problems: Taylor ad Maclauri Series Aswers. a) Start by takig derivatives util a patter develops that lets you to write a geeral formula for the -th derivative. Do t simplify as you go, because

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 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 information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

Math 113 Exam 3 Practice

Math 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 information

Computational Fluid Dynamics. Lecture 3

Computational Fluid Dynamics. Lecture 3 Computatioal Fluid Dyamics Lecture 3 Discretizatio Cotiued. A fourth order approximatio to f x ca be foud usig Taylor Series. ( + ) + ( + ) + + ( ) + ( ) = a f x x b f x x c f x d f x x e f x x f x 0 0

More information

Chapter 9: Numerical Differentiation

Chapter 9: Numerical Differentiation 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

More information

Chapter 2: Numerical Methods

Chapter 2: Numerical Methods Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(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 information

Lecture 6: Integration and the Mean Value Theorem. slope =

Lecture 6: Integration and the Mean Value Theorem. slope = Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose

More information

Lecture 2: Finite Difference Methods in Heat Transfer

Lecture 2: Finite Difference Methods in Heat Transfer Lecture 2: Fiite Differece Methods i Heat Trasfer V.Vuorie Aalto Uiversity School of Egieerig Heat ad Mass Trasfer Course, Autum 2016 November 1 st 2017, Otaiemi ville.vuorie@aalto.fi Overview Part 1 (

More information

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

MIDTERM 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 information

4.1 SIGMA NOTATION AND RIEMANN SUMS

4.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 information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 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 information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Lesson 10: Limits and Continuity

Lesson 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 information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

Riemann Sums y = f (x)

Riemann 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 information

9.3 Power Series: Taylor & Maclaurin Series

9.3 Power Series: Taylor & Maclaurin Series 9.3 Power Series: Taylor & Maclauri Series If is a variable, the a ifiite series of the form 0 is called a power series (cetered at 0 ). a a a a a 0 1 0 is a power series cetered at a c a a c a c a c 0

More information

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we

More information

( 1) n (4x + 1) n. n=0

( 1) n (4x + 1) n. n=0 Problem 1 (10.6, #). Fid the radius of covergece for the series: ( 1) (4x + 1). For what values of x does the series coverge absolutely, ad for what values of x does the series coverge coditioally? Solutio.

More information

Math 113 Exam 4 Practice

Math 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 information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

For example suppose we divide the interval [0,2] into 5 equal subintervals of length

For 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 information

1 Approximating Integrals using Taylor Polynomials

1 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 information

Part I: Covers Sequence through Series Comparison Tests

Part I: Covers Sequence through Series Comparison Tests Part I: Covers Sequece through Series Compariso Tests. Give a example of each of the followig: (a) A geometric sequece: (b) A alteratig sequece: (c) A sequece that is bouded, but ot coverget: (d) A sequece

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

f(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 information

Series Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1

Series Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1 Defiitio: We say that the series S = Series Review i= a i is the sum of the first terms. i= a i coverges if lim S exists ad is fiite, where The above is the defiitio of covergece for series. order to see

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

More information

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e) Math 0560, Exam 3 November 6, 07 The Hoor Code is i effect for this examiatio. All work is to be your ow. No calculators. The exam lasts for hour ad 5 mi. Be sure that your ame is o every page i case pages

More information

-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION

-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, 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 information

Section 11.8: Power Series

Section 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 information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

Numerical Method for Blasius Equation on an infinite Interval

Numerical Method for Blasius Equation on an infinite Interval Numerical Method for Blasius Equatio o a ifiite Iterval Alexader I. Zadori Omsk departmet of Sobolev Mathematics Istitute of Siberia Brach of Russia Academy of Scieces, Russia zadori@iitam.omsk.et.ru 1

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

P.3 Polynomials and Special products

P.3 Polynomials and Special products Precalc Fall 2016 Sectios P.3, 1.2, 1.3, P.4, 1.4, P.2 (radicals/ratioal expoets), 1.5, 1.6, 1.7, 1.8, 1.1, 2.1, 2.2 I Polyomial defiitio (p. 28) a x + a x +... + a x + a x 1 1 0 1 1 0 a x + a x +... +

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

18.01 Calculus Jason Starr Fall 2005

18.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 information

SOLUTIONS 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. 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 information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 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 information

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n. 0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate

More information

Nonlinear regression

Nonlinear regression oliear regressio How to aalyse data? How to aalyse data? Plot! How to aalyse data? Plot! Huma brai is oe the most powerfull computatioall tools Works differetly tha a computer What if data have o liear

More information

Please do NOT write in this box. Multiple Choice. Total

Please do NOT write in this box. Multiple Choice. Total Istructor: Math 0560, Worksheet Alteratig Series Jauary, 3000 For realistic exam practice solve these problems without lookig at your book ad without usig a calculator. Multiple choice questios should

More information

Taylor expansion: Show that the TE of f(x)= sin(x) around. sin(x) = x - + 3! 5! L 7 & 8: MHD/ZAH

Taylor expansion: Show that the TE of f(x)= sin(x) around. sin(x) = x - + 3! 5! L 7 & 8: MHD/ZAH Taylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. A ay poit i the eighbourhood of 0, the fuctio ƒ() ca be represeted by a power series of the followig form: X 0 f(a) f() f() ( ) f( ) ( )

More information

Numerical Astrophysics: hydrodynamics

Numerical Astrophysics: hydrodynamics Numerical Astrophysics: hydrodyamics Part 1: Numerical solutios to the Euler Equatios Outlie Numerical eperimets are a valuable tool to study astrophysical objects (where we ca rarely do direct eperimets).

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP 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 information

Analysis of a Numerical Scheme An Example

Analysis of a Numerical Scheme An Example http://www.d.edu/~gtryggva/cfd-course/ Computatioal Fluid Dyamics Lecture 3 Jauary 5, 7 Aalysis of a Numerical Scheme A Example Grétar Tryggvaso Numerical Aalysis Example Use the leap-frog method (cetered

More information

Sigma notation. 2.1 Introduction

Sigma 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 information

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL

More information

9.3 The INTEGRAL TEST; p-series

9.3 The INTEGRAL TEST; p-series Lecture 9.3 & 9.4 Math 0B Nguye of 6 Istructor s Versio 9.3 The INTEGRAL TEST; p-series I this ad the followig sectio, you will study several covergece tests that apply to series with positive terms. Note

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

More information

Notes on iteration and Newton s method. Iteration

Notes on iteration and Newton s method. Iteration Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Roberto s Notes on Series Chapter 2: Convergence tests Section 7. Alternating series

Roberto s Notes on Series Chapter 2: Convergence tests Section 7. Alternating series Roberto s Notes o Series Chapter 2: Covergece tests Sectio 7 Alteratig series What you eed to kow already: All basic covergece tests for evetually positive series. What you ca lear here: A test for series

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct M408D (54690/54695/54700), Midterm # Solutios Note: Solutios to the multile-choice questios for each sectio are listed below. Due to radomizatio betwee sectios, exlaatios to a versio of each of the multile-choice

More information

5.6 Absolute Convergence and The Ratio and Root Tests

5.6 Absolute Convergence and The Ratio and Root Tests 5.6 Absolute Covergece ad The Ratio ad Root Tests Bria E. Veitch 5.6 Absolute Covergece ad The Ratio ad Root Tests Recall from our previous sectio that diverged but ( ) coverged. Both of these sequeces

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive 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 information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

Chapter 14: Chemical Equilibrium

Chapter 14: Chemical Equilibrium hapter 14: hemical Equilibrium 46 hapter 14: hemical Equilibrium Sectio 14.1: Itroductio to hemical Equilibrium hemical equilibrium is the state where the cocetratios of all reactats ad products remai

More information

Integrable 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

Integrable 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 information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

The Advection-Diffusion equation!

The Advection-Diffusion equation! ttp://www.d.edu/~gtryggva/cf-course/! Te Advectio-iffusio equatio! Grétar Tryggvaso! Sprig 3! Navier-Stokes equatios! Summary! u t + u u x + v u y = P ρ x + µ u + u ρ y Hyperbolic part! u x + v y = Elliptic

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

Rearranging the Alternating Harmonic Series

Rearranging the Alternating Harmonic Series Rearragig the Alteratig Harmoic Series Da Teague C School of Sciece ad Mathematics teague@cssm.edu 00 TCM Coferece CSSM, Durham, C Regroupig Ifiite Sums We kow that the Taylor series for l( x + ) is x

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Numerical Methods in Geophysics: Implicit Methods

Numerical Methods in Geophysics: Implicit Methods Numerical Methods i Geophysics: What is a implicit scheme? Explicit vs. implicit scheme for Newtoia oolig rak-nicholso Scheme (mixed explicit-implicit Explicit vs. implicit for the diffusio equatio Relaxatio

More information

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics: Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information

INFINITE SEQUENCES AND SERIES

INFINITE 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 information

Math 25 Solutions to practice problems

Math 25 Solutions to practice problems Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information