This chapter describes different methods to discretize the diffusion equation. f z 2 = 0. y ) x f

Size: px
Start display at page:

Download "This chapter describes different methods to discretize the diffusion equation. f z 2 = 0. y ) x f"

Transcription

1 Chapter 8 Diusio Equatio This chapter describes dieret methods to discretize the diusio equatio 2 t α x y z 2 = 0 which represets a combied boudary ad iitial value problem, i.e., requires to prescribe boudary boudary t ad iitial coditios x,y,z,t = Explicit methods Forward time cetered space scheme I oe dimesio ad usig iite dierece the FTCS scheme is The trucatio error is give by E = α x = + s x 2 L xx s = α/ x 2 s x 4 + O x 4 The ampliicatio actor is k x g = 1 4ssi 2 2 which yields s < 1/2 or stability. 145

2 CHAPTER 8. DIFFUSION EQUATION 146 t +1 Schematic: FTCS -1 i-2 i-1 i i+1 i+2 x Figure 8.1: Represetatio o the FTCS scheme. I two dimesios the same approach ca be used to yield k +1 = k + s x x 2 L xx k + s y y 2 L yy k with s x = α x / x 2, s y = α y / y 2 Stability requires s x + s y 1/2. A improved ie poit scheme ca be oud i α x = α y = αad x = y which or +1 k = αl xx k + αl yy k + α2 2 L xx L yy k yields stability or s 1/2. This scheme ca eicietly be implemeted with k = 1 + αl yy k k +1 = 1 + αl xx k Richardso ad DuFort-Frakel schemes Oe could have the idea that is is more accurate to employ a cetered dierece or the temporal derivative which give the Richardso scheme +1 1 = αl xx = α 2 x ad is secod order accurate or the time derivative. However the stability aalysis shows that this scheme is ucoditioally ustable. A small modiicatio o this scheme where the term 2 is

3 CHAPTER 8. DIFFUSION EQUATION 147 split ito two time levels accordig to 2 = scheme: leads to the so-called Duort-Frakel +1 1 = αl xx = α 2 x Although it appears as i this were implicit it is straightorward to re-arrage terms to yield +1 = 2s 1 + 2s s 1 + 2s 1 This scheme is actually ucoditioally stable. However, carryig out the cosistecy test, i.e., expadig terms i the correspodig Taylor series yields [ t α 2 ] 2 x 2 + α 2 x t 2 + O 2, x 2 = 0 Symbolic represetatio o the DuFort-Frakel scheme. Thus it is ot suiciet to coduct the limit o, x 0 to achieve cosistecy as log as / x remais iite. Usig the relatio 2 α = s x demostrates that cosistecy ca be achieved i s is kept costat ad 0 because x 2 or costat s. The ampliicatio actor or the DuFort-Frakel scheme is Three-level scheme The geeral method suggest a approach such as g = 2scosk 1 + 2s ± 1 1 4s 1 + 2s 2 + 4s 2 cosk a +1 + b + c 1 dl xx + el xx 1 = 0

4 CHAPTER 8. DIFFUSION EQUATION 148 Usig this method ad applyig cosistecy yields the equatio γ +1 1 γ [ = α 1 1 βl xx + βl xx 1 ] The error resultig rom this scheme is 1 E = αs x γ + β s x 4 + O x 4 Symbolic represetatio o the the-level scheme. such that this scheme becomes 4th order accurate or β = 0.5 γ + 1/12s. The equatio or the ampliicatio actor is 1 + γg 2 [1 + 2γ + 2s1 βcosk 1] + [γ 2βscosk 1] = 0 The discussio o the parameter space is somewhat complicated but the geeral result is that there is a stability limit with values o s icreasig rom about 0.35 to 5 i γis raised rom 0 to about 6. s ustable stable γ Figure 8.2: Illustratio o the stability space or the three level scheme. The trucatio error or the previous methods or dieret grid resolutio is show i the ollowig table. It illustrates that or speciic values o s the simple FTCS ad DuFort-Frakel methods ca achieve 4th order accuracy Hopscotch method This is a airly origial method which uses a two stage FTCS algorithm. Here we describe the two-dimesioal variat. I the irst stage which is carried out or + k + = eve the usual FTCS scheme is applied

5 CHAPTER 8. DIFFUSION EQUATION 149 Table 8.1: RMS errors or dieret explicit schemes ad varyig parameters as a uctio o grid resolutio. Case s γ RMS RMS RMS approx. x = 0.2 x = 0.1 x = 0.05 cov. rate FTCS 1/ FTCS FTCS DuF-F DuF-F DuF-F L-4th L-4th L-4th L-4th k = αl xx k + αl yy k + k + = eve I the secod stage the same scheme is applied but a ow o all grid poits with +k + = odd ad b the secod order derivative is usig the ewly computed time level + 1. This is possible ow i a explicit method because all grid poits adacet to the oe to be updated have bee updated i the irst stage. 1. Stage schematic: 2. stage schematic: k +1 = αl xx +1 k + αl yy k +1, + k + = odd The Figure above shows a schematic o the time update. The grid topology is show i the ollowig igure. Here the irst stage updates or istace all grid poits idicated i blue. The 2d stage the uses the spatial derivative rom those grid poits to update the orage poits. The resultig patter looks like a chess board. Note that this method is ot oly very eiciet ad simple but also ucoditioally stable i 2 dimesios?. The error associated with the scheme is O, x 2, y Implicit methods Fully implicit scheme This method is equivalet to the FCTS method, however, with the 2d derivative operator evaluated at the ew time level.

6 CHAPTER 8. DIFFUSION EQUATION 150 y x Figure 8.3: Represetatio o the grid topology used or the Hopscotch method. Cosistecy yields E = s x 4 ad the ampliicatio actor is g = +1 + O x 4 = αl xx +1 k x 1 Schematic o the ully implicit 1 + 4ssi 2 scheme. 2 which demostrates that the scheme is ucoditioally stable. The solutio to this method ca be oud by solvig 1 + 2s s s 1 + 2s s s 1 + 2s s s 1 + 2s s s 1 + 2s = d 1 d 2 d 3 d 4 d 5 o rak N correspodig to the umber o grid poits. The tridiagoal system is easily solved usig the Thomas algorithm Crak-Nicholso scheme This method uses a mixture o spatial derivative usig time levels ad + 1.

7 CHAPTER 8. DIFFUSION EQUATION = α 2 L xx + +1 which geerates a error o order E = O 2, x 2. Note that the scalig o 2 i the error is caused by the cetered time derivative. The equatio or the ampliicatio actor is or g 1 + 2sgsi 2 k 2 + 2ssi2 k 2 = 0 Schematic o the iite dierece Crak-Nicholso scheme g = 1 2ssi2 k ssi 2 k 2 which implies ucoditioal stability. Fiite elemet Crak-Nicholso Note that this is easily expaded to the iite elemet Crak-Nicholso scheme by applyig the correspodig mass operators to the time derivative term 1 M x +1 = α 1 2 L xx L xx +1 Schematic o the iite elemet Crak-Nicholso scheme The Crak-Nicholso scheme ca also be geeralized i substitutig the actors o 1/2 by a variable parameter i the ollowig maer +1 I this case the method is ucoditioally stable or [ = α 1 βl xx + βl xx +1 ] ad has the restrictio i β > 0.5. s 0 β β

8 CHAPTER 8. DIFFUSION EQUATION Geeralized three level schemes Aother geeralizatio is to cosider a weighted time dierecig over three time levels: where the particular choice 1 + γ +1 γ [ ] = α 1 βl xx + βl xx +1 γ = 1 2 β = 1 yields a error E = O 2, x 2 with ucoditioal stability. Fially we ca apply a geeralized mass operator M x = δ,1 2δ,δ which yields γm x γm x [ ] = α 1 βl xx + βl xx +1 Note that the Crak-Nicholso schemes are recovered usig γ = 0, β = 1/2. The FEM Crak-Nicholso scheme is recovered i this case with δ = 1/6. The error or this scheme is 1 E = αs x γ β + δ 1/12 4 s x 4 + O x 4 Schematic o the geeral three level schemes such that the scheme becomes ourth order accurate or The algebraic equatios or this scheme are β = γ + δ 1/12 s a c = 1 + 2γM x γm x 1 a i = c i = 1 + γδ sβ b = 1 + γ1 2δ + 2sβ L xx = The speciic choice o δ = 1/12 yields ourth order accuracy or β = γ. + 1 βs L xx A summary o the methods implemeted i the program Diim. o implicit schemes is give i the ext table. The ollowig table is a summary o the RMS error obtaied or implicit methods with the program Diim.. All results use s = 1.0

9 CHAPTER 8. DIFFUSION EQUATION 153 Method - me M x β 1 - FDM-2d order 0, 1, γ 2 - FEM-2d order 1/6, 2/3, 1/ γ 3 - FDM-4th order 0,1, γ 1 12s 4 - FEM-4th order 1/6,2/3,1/ γ s 5 - Composite 1/12, 5/6, 1/ γ Table 8.2: Overview o implicit methods implemeted or the oe-dimesioal diusio equatio. Method γ RMS RMS RMS approx. x = 0.2 x = 0.1 x = 0.05 cov. rate Table 8.3: RMS errors or dieret explicit schemes ad varyig parameters as a uctio o grid resolutio Boudary coditios Thus ar we have mostly implied Dirichlet boudary coditios which are straightorward to implemet. Vo Neuma coditios provide more o a challege. The most straightorward implemetatio is a oe sided dierece here or the boudary at x mi = c +1 x which yields a equatio or the boudary value However, this gives oly irst order accuracy while the overall methods usually give at least 2d order accuracy. Better approach: Itroduce artiicial mathematical boudary with = 0 ad = c +1 x where c +1 is the gradiet o at the boudary or time t +1. For the FTCS scheme this gives

10 CHAPTER 8. DIFFUSION EQUATION 154 Similar or the ully implicit method this yields +1 1 = 1 2s 1 + s = 1 2s 1 + 2s 2 c+1 x 1 + 2s 1 +1 s = 1 or 1 + 2s s 2 +1 = 1 2sc+1 x

11 CHAPTER 8. DIFFUSION EQUATION Summary o methods or the oe-dimesioal diusio equatio Scheme Algebraic equatio Trucatio error Ampl. actor g Stability FTCS +1 = αlxx E = α x2 2 s x 4 1 4ssi 2 Θ 2 s 1/2 DuFort-Frakel +1 = 2s 1+2s s 1+2s 1 E = α x2 s x 4 2scosΘ+1 4ssi 2 Θ 1/2 1+2s oe Crak-Nicholso +1 = α 2 L xx + +1 E x2 = α 12 4 x 4 1 2ssi 2 Θ/2 1+2ssi 2 Θ/2 oe 3level implicit = αlxx +1 E x2 = α 12 4 x 4 1± 4 i[ s1 cosθ]1/2 2[1+ 4 s1 cosθ] oe 3 FEM Crak-Nicholso Mx +1 = α 2 L xx + +1 E = α x x 4 2 3s+1+3s cosθ 2+3s+1 3s cosθ oe Remarks s = α x 2 Lxx = 1 1, 2,1 +1 x 2 = +1 Mx = 1/6,2/3,1/6 = 1

12 CHAPTER 8. DIFFUSION EQUATION Splittig schemes ADI method I two-dimesios implicit methods are usually computatioally very expesive. Cosider the two-dimesioal versio o the ully implicit method s x + 2s y k +1 s x 1,k ,k +1 s y,k ,k+1 +1 = k The problem with this equatio is the iversio o the matrix deied by the rhs o the equatio. I the oe-dimesioal case the resultig matrix was a tridiagoal baded matrix. I the twodimesioal case the matrix is ot aymore baded but has elemets that are ar oset o the diagoal eve though the matrix is sparse. While there are some techiques to deal with spares matrices Gauss elimiatio is still rather ad ote prohibitively expesive. The alterative to a ully implicit solutio is the ADI method which is illustrated usig the ollowig basic equatios. k k /2 α xl xx k α yl yy k = 0 k +1 k α x L xx k /2 α yl yy k +! = 0 Here the i the irst equatio is iterpreted as a auxiliary itermediate time level + 1/2. The correspodig algebraic equatios are cast i the orm 1 2 s x 1,k s x k 1 2 s x +1,k = 1 2 s y,k s y k s y,k s y +1,k s y +1 k 1 2 s y +1,k+1 = 1 2 s x 1,k + 1 s x k s x +1,k Note that these equatios are almost idetical to the oes used or the correspodig elliptic equatio solver usig the ADI scheme 7.4 ad 7.5. These equatios are used i two stages to evolve the system rom time level to time level + 1. Note that - as i the prior itroductio o the ADI scheme - each step requires oly the solutio o a implicit equatio i oe dimesio. I the irst step equatio the system is solved or k cosidered ixed. Sice the solutio is sought oly or the x grid, i.e., oe-dimesioal, the resultig matrices are baded tridiagoal ad easy to solve with the Thomas algorithm. Similarly the secod step is coducted oly or the y grid with x or ixed such that the secod step also ivolves oly oe-dimesio ad thus the solutio o a baded tridiagoal matrix. The vo Neuma stability aalysis is used to determie a ampliicatio actor or each hal step. The product o the resultig ampliicatio actors yields

13 CHAPTER 8. DIFFUSION EQUATION 157 k+1 k k Figure 8.4: Schematic o the two stages o the simple iite dierece ADI method. [ ][ ] g = g g 1 2s y si 2 k y/2 1 2s x si 2 k x/2 = 1 + 2s x si 2 k x/ s y si 2 k y/2 which implies g 1 ad thereore ucoditioal stability. The scheme has a error o O 2, x 2, y 2. Note that boudary coditios eed to to be cosidered careully to isure that the global error ideed remais secod order. Usig Dirichlet coditios the evaluatio o the boudary at x max = 1 or the itermediate step usig x,k = b+1/2 k yields a error o O. The correct approach or this boudary should be x,k = Geeralized two level scheme b k + b +1 1 k 4 L yy b k + b +1 k As i the case o the oe-dimesioal schemes splittig schemes ca easily be geeralized by itroducig weights or the spatial ad temporal derivatives at dieret time levels. For two time levels this geeralizatio is +1 k = 1 β[α x L xx + α y L yy ] k + β [α xl xx + α y L yy ] +1 k 8.1 agai with k +1 = k +1 k +1. Oe ca rewrite this as a equatio or k terms to the let side i the ollowig maer by movig the β [1 β α x L xx + α y L yy ] +1 k = α x L xx + α y L yy k

14 CHAPTER 8. DIFFUSION EQUATION 158 Up to O 2 this ca be rewritte as 1 βα x L xx 1 βα y L yy +1 k = α x L xx + α y L yy k where we have added a term β 2 2 α x α y L xx L yy k +1 which however is O 2. With the deiitio k = 1 βα yl yy k +1 oe obtais the ollowig two stage scheme: 1 1 βα x L xx k = α xl xx + α y L yy k 2 1 βα y L yy k +1 = k Each o these steps oly ivolves the iversio o a tridiagoally baded matrix. Similar to the oe-dimesioal equivalet the resultig scheme is ucoditioally stable or β 0.5 also i 3D ad the resultig error is o the order O 2, x 2, y 2 or β = 0.5. Note that a extesio to three time levels is straightorward as i prior examples o oe-dimesioal schemes 1 + γ k +1 γ k [ ] = 1 β α x L xx k + α yl yy k [ ] +β α x L xx k +1 + α y L yy k +1 yields with some mior algebra β 1 + γ α xl xx k = 1 + γ α xl xx + α y L yy k + γ 1 + γ k 1 β 1 + γ α yl yy k +1 = k Agai this scheme requires oly a oe-dimesioal implicit solutio at each stage Fiite elemet methods Similar to oe-dimesioal implicit schemes it is straightorward to exted two or three-dimesioal implicit schemes to iite elemets. I geeral the iclusio o iite elemets ca be doe usig a mass operator such that the diusio equatio i operator orm becomes M x M y t = α x M y L xx k + α y M x L yy k k

15 CHAPTER 8. DIFFUSION EQUATION 159 k+1 k k Figure 8.5: Schematic o the two stages o the two level iite dierece ADI method. where this operator or liear iite elemets is give by M x = 1/6,2/3,1/6 ad as usual the secod derivative operator is L xx = 1 x 2 1, 2,1. Aother way to express the operatio is M x k = +1 k+1 m i ik, M y k = m m mk i= 1 m=k 1 Applyig the mass operator i combiatios with the secod derivative operator yields or istace M y L xx k = 1 6 L xx,k L xx,k L xx,k+1 Note that oe ca urther geeralize the approach by usig istead o the em mass operator a operator deied as M x = δ,1 2δ,δ. Usig the mass operator or the two level scheme 8.1 yields k +1 M x M y [ = α x M y L xx + α y M x L yy 1 β k + β k +1 Similar to the iite dierece two level scheme oe ca re-arrage terms ad add a term o order O 2 to yield ] M x βα x L xx M y βα y L yy +1 k = M x + 1 βα x L xx M y + 1 βα y L yy k 8.2 Note that the terms proportioal to 2 have bee added compared to the origial equatio which limits the accuracy to O 2 which, however was ayhow the accuracy o the origial equatio. Similar to the iite dierece approach oe ca ow solve this equatio i two stages

16 CHAPTER 8. DIFFUSION EQUATION M x βα x L xx k = M y + 1 βα y L yy k M y βα y L yy +1 k = M x + 1 βα x L xx k 8.4 Here oe ca easily that this set o equatios is idetical to 8.2 by multiplyig the secod stage equatio with M x βα x L xx ad isert k rom the irst stage. Note that the choice o β = 0.5 yields the ADI iite elemet method. The two level iite elemet scheme with M x = δ,1 2δ,δ is ucoditioally stable or or x = y ad α x = α y. β δ 0.25 s Fially ote that the iite elemet method ca also easily be applied to a liear versio computig k +1 istead o the equatios 8.3 ad 8.4. Equatio 8.2 is easily re-writte as M x βα x L xx M y βα y L yy k +1 = α x M y L xx + α y M x L yy k R k which with the deiitio o k = M y βα y L yy k +1 leds itsel to the ollowig two stage splittig scheme 1 M x βα x L xx k = R k 2 M y βα y L yy k +1 = k k+1 k k Figure 8.6: Schematic o the two stages o the two level iite elemet ADI method. The scheme is basically idetical with the oliear ormulatio. The advatage o the liear ormulatio is usually a better accuracy. The ollowig igure shows a schematic o the iite

17 CHAPTER 8. DIFFUSION EQUATION 161 elemet scheme. Dieret rom the iite dierece method the irst stage ivolves all odes i the viciity o, k. The overall umerical eort o the various splittig schemes i two dimesios is very comparable. Although the iite elemet method ivolve some more odes or the 1st stage step the dierece with iite dierece methods is ot sigiicat. Thus the evetual choice is more determied by properties o thee resultig schemes. Fially it is worth poitig out that oe area o icreased complexity is that o boudary coditios. These eed to be ormulated i agreemet with the discretizatio ad the solutio method. Thus choice o particular boudary coditios alters the algebraic equatios at the boudaries ad must be take ito accout i the solutio o the tridiagoal matrices or splittig schemes.

Solutions Numerical Simulation - Homework, 4/15/ The DuFort-Frankel method is given by. f n. x 2. (a) Truncation error: Taylor expansion

Solutions Numerical Simulation - Homework, 4/15/ The DuFort-Frankel method is given by. f n. x 2. (a) Truncation error: Taylor expansion Solutios Numerical Simulatio - Homework, 4/15/211 36. The DuFort-Frakel method is give by +1 1 = αl = α ( 2 t 2 1 1 +1 + +1 (a Trucatio error: Taylor epasio i +1 t = m [ m ] m= m! t m. (1 i Sice we cosider

More information

Accuracy. Computational Fluid Dynamics. Computational Fluid Dynamics. Computational Fluid Dynamics

Accuracy. Computational Fluid Dynamics. Computational Fluid Dynamics. Computational Fluid Dynamics http://www.d.edu/~gtryggva/cfd-course/ Computatioal Fluid Dyamics Lecture Jauary 3, 7 Grétar Tryggvaso It is clear that although the umerical solutio is qualitatively similar to the aalytical solutio,

More information

More Elementary Aspects of Numerical Solutions of PDEs!

More Elementary Aspects of Numerical Solutions of PDEs! ttp://www.d.edu/~gtryggva/cfd-course/ Outlie More Elemetary Aspects o Numerical Solutios o PDEs I tis lecture we cotiue to examie te elemetary aspects o umerical solutios o partial dieretial equatios.

More information

Partial Differential Equations

Partial Differential Equations Partial Differetial Equatios Part 2 Massimo Ricotti ricotti@astro.umd.edu Uiversity of Marylad Partial Differetial Equatios p.1/15 Upwid differecig I additio to amplitude errors (istability or dampig),

More information

The Discrete-Time Fourier Transform (DTFT)

The Discrete-Time Fourier Transform (DTFT) EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad

More information

Math 257: Finite difference methods

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

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

FFTs in Graphics and Vision. The Fast Fourier Transform

FFTs in Graphics and Vision. The Fast Fourier Transform FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product

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

Topic 9 - Taylor and MacLaurin Series

Topic 9 - Taylor and MacLaurin Series Topic 9 - Taylor ad MacLauri Series A. Taylors Theorem. The use o power series is very commo i uctioal aalysis i act may useul ad commoly used uctios ca be writte as a power series ad this remarkable result

More information

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let. Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which

More information

Time-Domain Representations of LTI Systems

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

A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION

A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION U.P.B. Sci. Bull., Series A, Vol. 79, Iss. 4, 7 ISSN -77 A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION Cristia ŞERBĂNESCU, Marius BREBENEL A alterate

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

Some Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations

Some Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations Copyright, Darbose Iteratioal Joural o Applied Mathematics ad Computatio Volume (), pp -6, 9 http//: ijamc.darbose.com Some Variats o Newto's Method with Fith-Order ad Fourth-Order Covergece or Solvig

More 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

FIR Filter Design: Part I

FIR Filter Design: Part I EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some

More information

Lecture 11. Solution of Nonlinear Equations - III

Lecture 11. Solution of Nonlinear Equations - III Eiciecy o a ethod Lecture Solutio o Noliear Equatios - III The eiciecy ide o a iterative ethod is deied by / E r r: rate o covergece o the ethod : total uber o uctios ad derivative evaluatios at each step

More information

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway?

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway? Where do eigevalues/eigevectors/eigeuctios come rom, ad why are they importat ayway? I. Bacgroud (rom Ordiary Dieretial Equatios} Cosider the simplest example o a harmoic oscillator (thi o a vibratig strig)

More information

5. Fast NLMS-OCF Algorithm

5. Fast NLMS-OCF Algorithm 5. Fast LMS-OCF Algorithm The LMS-OCF algorithm preseted i Chapter, which relies o Gram-Schmidt orthogoalizatio, has a compleity O ( M ). The square-law depedece o computatioal requiremets o the umber

More information

CS537. Numerical Analysis and Computing

CS537. Numerical Analysis and Computing CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

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

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

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

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

CALCULATING FIBONACCI VECTORS

CALCULATING FIBONACCI VECTORS THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet

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

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

CS321. Numerical Analysis and Computing

CS321. Numerical Analysis and Computing CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca

More information

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets Australia Joural of Basic ad Applied Scieces, 5(): 98-5, ISSN 99-878 Numerical Solutio of the Two Poit Boudary Value Problems By Usig Wavelet Bases of Hermite Cubic Splie Wavelets Mehdi Yousefi, Hesam-Aldie

More information

Numerical Methods for Ordinary Differential Equations

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

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

Assignment 2 Solutions SOLUTION. ϕ 1  = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ. PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio

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

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

PRELIMINARY MATHEMATICS LECTURE 5

PRELIMINARY MATHEMATICS LECTURE 5 SCHOOL OF ORIENTAL AND AFRICAN STUDIES UNIVERSITY OF LONDON DEPARTMENT OF ECONOMICS 5 / - 6 5 MSc Ecoomics PRELIMINARY MATHEMATICS LECTURE 5 Course website: http://mercur.soas.ac.uk/users/sm97/teachig_msc_premath.htm

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314

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

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

Algebra of Least Squares

Algebra of Least Squares October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal

More information

7. Modern Techniques. Data Encryption Standard (DES)

7. Modern Techniques. Data Encryption Standard (DES) 7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

b i u x i U a i j u x i u x j

b i u x i U a i j u x i u x j M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

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

Taylor Polynomials and Approximations - Classwork

Taylor Polynomials and Approximations - Classwork Taylor Polyomials ad Approimatios - Classwork Suppose you were asked to id si 37 o. You have o calculator other tha oe that ca do simple additio, subtractio, multiplicatio, or divisio. Fareched\ Not really.

More information

You may work in pairs or purely individually for this assignment.

You may work in pairs or purely individually for this assignment. CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or

More information

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig

More information

CHAPTER 6d. NUMERICAL INTERPOLATION

CHAPTER 6d. NUMERICAL INTERPOLATION CHAPER 6d. NUMERICAL INERPOLAION A. J. Clark School o Egieerig Departmet o Civil ad Evirometal Egieerig by Dr. Ibrahim A. Assakka Sprig ENCE - Computatio Methods i Civil Egieerig II Departmet o Civil ad

More information

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1) 5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper

More information

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e. Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse

More information

Phys. 201 Mathematical Physics 1 Dr. Nidal M. Ershaidat Doc. 12

Phys. 201 Mathematical Physics 1 Dr. Nidal M. Ershaidat Doc. 12 Physics Departmet, Yarmouk Uiversity, Irbid Jorda Phys. Mathematical Physics Dr. Nidal M. Ershaidat Doc. Fourier Series Deiitio A Fourier series is a expasio o a periodic uctio (x) i terms o a iiite sum

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2 Geeral remarks Week 2 1 Divide ad First we cosider a importat tool for the aalysis of algorithms: Big-Oh. The we itroduce a importat algorithmic paradigm:. We coclude by presetig ad aalysig two examples.

More information

Algorithms and Data Structures 2014 Exercises and Solutions Week 13

Algorithms and Data Structures 2014 Exercises and Solutions Week 13 Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig

More information

Numerical Methods! for! Elliptic Equations-II! Multigrid! Methods! f Analytic Solution of! g = bk. da k dt. = α. ( t)

Numerical Methods! for! Elliptic Equations-II! Multigrid! Methods! f Analytic Solution of! g = bk. da k dt. = α. ( t) http://www.d.edu/~gtryggva/cfd-course/! umerical Methods! or! Elliptic Equatios-II! Grétar Tryggvaso! Sprig 13! Examples o elliptic equatios! Direct Methods or 1D problems! Elemetary Iterative Methods!

More information

Bernoulli, Ramanujan, Toeplitz e le matrici triangolari

Bernoulli, Ramanujan, Toeplitz e le matrici triangolari Due Giori di Algebra Lieare Numerica www.dima.uige.it/ dibeede/gg/home.html Geova, 6 7 Febbraio Beroulli, Ramauja, Toeplitz e le matrici triagolari Carmie Di Fiore, Fracesco Tudisco, Paolo Zellii Speaker:

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

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

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

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

ADVANCED TOPICS ON VIDEO PROCESSING

ADVANCED TOPICS ON VIDEO PROCESSING ADVANCED TOPICS ON VIDEO PROCESSING Image Spatial Processig FILTERING EXAMPLES FOURIER INTERPRETATION FILTERING EXAMPLES FOURIER INTERPRETATION FILTERING EXAMPLES FILTERING EXAMPLES FOURIER INTERPRETATION

More information

g () n = g () n () f, f n = f () n () x ( n =1,2,3, ) j 1 + j 2 + +nj n = n +2j j n = r & j 1 j 1, j 2, j 3, j 4 = ( 4, 0, 0, 0) f 4 f 3 3!

g () n = g () n () f, f n = f () n () x ( n =1,2,3, ) j 1 + j 2 + +nj n = n +2j j n = r & j 1 j 1, j 2, j 3, j 4 = ( 4, 0, 0, 0) f 4 f 3 3! Higher Derivative o Compositio. Formulas o Higher Derivative o Compositio.. Faà di Bruo's Formula About the ormula o the higher derivative o compositio, the oe by a mathematicia Faà di Bruo i Italy o about

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

Mon Apr Second derivative test, and maybe another conic diagonalization example. Announcements: Warm-up Exercise:

Mon Apr Second derivative test, and maybe another conic diagonalization example. Announcements: Warm-up Exercise: Math 2270-004 Week 15 otes We will ot ecessarily iish the material rom a give day's otes o that day We may also add or subtract some material as the week progresses, but these otes represet a i-depth outlie

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

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie

More information

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example: 74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig

More information

CHAPTER 6c. NUMERICAL INTERPOLATION

CHAPTER 6c. NUMERICAL INTERPOLATION CHAPTER 6c. NUMERICAL INTERPOLATION A. J. Clark School o Egieerig Departmet o Civil ad Evirometal Egieerig y Dr. Irahim A. Assakka Sprig ENCE - Computatio Methods i Civil Egieerig II Departmet o Civil

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

More information

Chimica Inorganica 3

Chimica Inorganica 3 himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule

More information

Caputo s Implicit Solution of Time-Fractional Diffusion Equation Using Half-Sweep AOR Iteration

Caputo s Implicit Solution of Time-Fractional Diffusion Equation Using Half-Sweep AOR Iteration Global Joural o Pure ad Applied Mathematics. ISSN 0973-768 Volume Number 4 (06) pp. 3469-3479 Research Idia Publicatios http://www.ripublicatio.com/gpam.htm Caputo s Implicit Solutio o Time-Fractioal Diusio

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

A numerical Technique Finite Volume Method for Solving Diffusion 2D Problem

A numerical Technique Finite Volume Method for Solving Diffusion 2D Problem The Iteratioal Joural Of Egieerig d Sciece (IJES) Volume 4 Issue 10 Pages PP -35-41 2015 ISSN (e): 2319 1813 ISSN (p): 2319 1805 umerical Techique Fiite Volume Method for Solvig Diffusio 2D Problem 1 Mohammed

More information

THE KALMAN FILTER RAUL ROJAS

THE KALMAN FILTER RAUL ROJAS THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider

More information

Explicit scheme. Fully implicit scheme Notes. Fully implicit scheme Notes. Fully implicit scheme Notes. Notes

Explicit scheme. Fully implicit scheme Notes. Fully implicit scheme Notes. Fully implicit scheme Notes. Notes Explicit cheme So far coidered a fully explicit cheme to umerically olve the diffuio equatio: T + = ( )T + (T+ + T ) () with = κ ( x) Oly table for < / Thi cheme i ometime referred to a FTCS (forward time

More information

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows

More information

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

More information

End-of-Year Contest. ERHS Math Club. May 5, 2009

End-of-Year Contest. ERHS Math Club. May 5, 2009 Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,

More information

GUIDELINES ON REPRESENTATIVE SAMPLING

GUIDELINES ON REPRESENTATIVE SAMPLING DRUGS WORKING GROUP VALIDATION OF THE GUIDELINES ON REPRESENTATIVE SAMPLING DOCUMENT TYPE : REF. CODE: ISSUE NO: ISSUE DATE: VALIDATION REPORT DWG-SGL-001 002 08 DECEMBER 2012 Ref code: DWG-SGL-001 Issue

More information

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-

More information

Exact Solutions for a Class of Nonlinear Singular Two-Point Boundary Value Problems: The Decomposition Method

Exact Solutions for a Class of Nonlinear Singular Two-Point Boundary Value Problems: The Decomposition Method Exact Solutios for a Class of Noliear Sigular Two-Poit Boudary Value Problems: The Decompositio Method Abd Elhalim Ebaid Departmet of Mathematics, Faculty of Sciece, Tabuk Uiversity, P O Box 741, Tabuki

More information

PHY4905: Nearly-Free Electron Model (NFE)

PHY4905: Nearly-Free Electron Model (NFE) PHY4905: Nearly-Free Electro Model (NFE) D. L. Maslov Departmet of Physics, Uiversity of Florida (Dated: Jauary 12, 2011) 1 I. REMINDER: QUANTUM MECHANICAL PERTURBATION THEORY A. No-degeerate eigestates

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

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by

More information

Taylor polynomial solution of difference equation with constant coefficients via time scales calculus

Taylor polynomial solution of difference equation with constant coefficients via time scales calculus TMSCI 3, o 3, 129-135 (2015) 129 ew Treds i Mathematical Scieces http://wwwtmscicom Taylor polyomial solutio of differece equatio with costat coefficiets via time scales calculus Veysel Fuat Hatipoglu

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

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

A Block Cipher Using Linear Congruences

A Block Cipher Using Linear Congruences Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &

More information

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent. REVIEW, MATH 00. Let a = +. a) Determie whether the sequece a ) is coverget. b) Determie whether a is coverget.. Determie whether the series is coverget or diverget. If it is coverget, fid its sum. a)

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get

More information

x x x 2x x N ( ) p NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS By Newton-Raphson formula

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

The Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005

The Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005 The Jorda Normal Form: A Geeral Approach to Solvig Homogeeous Liear Sstems Mike Raugh March 2, 25 What are we doig here? I this ote, we describe the Jorda ormal form of a matrix ad show how it ma be used

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

Section 7. Gaussian Reduction

Section 7. Gaussian Reduction 7- Sectio 7 Gaussia eductio Paraxial aytrace Equatios eractio occurs at a iterace betwee two optical spaces. The traser distace t' allows the ray height y' to be determied at ay plae withi a optical space

More information

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU Thursda Ma, Review of Equatios of a Straight Lie (-D) U8L Sec. 8.9. Equatios of Lies i R Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio

More information