L 5 & 6: RelHydro/Basel. f(x)= ( ) f( ) ( ) ( ) ( ) n! 1! 2! 3! If the TE of f(x)= sin(x) around x 0 is: sin(x) = x - 3! 5!

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

Power Series: A power series about the center, x = 0, is a function of x of the form

e to approximate (using 4

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

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

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 +

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

f t dt. Write the third-degree Taylor polynomial for G

Chapter 10: Power Series

Section 11.8: Power Series

Notes on iteration and Newton s method. Iteration

Curve Sketching Handout #5 Topic Interpretation Rational Functions

, 4 is the second term U 2

Computational Fluid Dynamics. Lecture 3

9.3 Power Series: Taylor & Maclaurin Series

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Calculus 2 - D. Yuen Final Exam Review (Version 11/22/2017. Please report any possible typos.)

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

lecture 3: Interpolation Error Bounds

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

PRELIM PROBLEM SOLUTIONS

Chapter 4. Fourier Series

Lesson 10: Limits and Continuity

Streamfunction-Vorticity Formulation

Numerical Solution of the First-Order Hyperbolic Partial Differential Equation with Point-Wise Advance

PC5215 Numerical Recipes with Applications - Review Problems

Numerical Solutions of Second Order Boundary Value Problems by Galerkin Residual Method on Using Legendre Polynomials

Polynomial Functions and Their Graphs

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

Taylor Series (BC Only)

ENGI 9420 Engineering Analysis Assignment 3 Solutions

Quiz. Use either the RATIO or ROOT TEST to determine whether the series is convergent or not.

μ are complex parameters. Other

Math 113 Exam 3 Practice

f(w) w z =R z a 0 a n a nz n Liouville s theorem, we see that Q is constant, which implies that P is constant, which is a contradiction.

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

CS537. Numerical Analysis and Computing

10-701/ Machine Learning Mid-term Exam Solution

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?

POWER SERIES SOLUTION OF FIRST ORDER MATRIX DIFFERENTIAL EQUATIONS

The Phi Power Series

Castiel, Supernatural, Season 6, Episode 18

Chapter 9: Numerical Differentiation

CO-LOCATED DIFFUSE APPROXIMATION METHOD FOR TWO DIMENSIONAL INCOMPRESSIBLE CHANNEL FLOWS

Linear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form

(Figure 2.9), we observe x. and we write. (b) as x, x 1. and we write. We say that the line y 0 is a horizontal asymptote of the graph of f.

Example 2. Find the upper bound for the remainder for the approximation from Example 1.

Infinite Sequences and Series

An efficient time integration method for extra-large eddy simulations

CS321. Numerical Analysis and Computing

Notes 8 Singularities

Find quadratic function which pass through the following points (0,1),(1,1),(2, 3)... 11

AP Calculus Chapter 9: Infinite Series

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation

6.3 Testing Series With Positive Terms

(c) Write, but do not evaluate, an integral expression for the volume of the solid generated when R is

Calculus II - Problem Drill 21: Power Series, Taylor and Maclaurin Polynomial Series

f x x c x c x c... x c...

Sequences. A Sequence is a list of numbers written in order.

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

Monte Carlo Optimization to Solve a Two-Dimensional Inverse Heat Conduction Problem

Numerical Methods for Partial Differential Equations

Sequences and Series of Functions

Continuous Functions

A NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Mathematical Series (You Should Know)

Finite Difference Approximation for Transport Equation with Shifts Arising in Neuronal Variability

Chapter 8. Uniform Convergence and Differentiation.

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

COMM 602: Digital Signal Processing

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

j=1 dz Res(f, z j ) = 1 d k 1 dz k 1 (z c)k f(z) Res(f, c) = lim z c (k 1)! Res g, c = f(c) g (c)

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

Analytic Continuation

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

Math 257: Finite difference methods

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy

Lecture 4 Conformal Mapping and Green s Theorem. 1. Let s try to solve the following problem by separation of variables

Chapter 2: Numerical Methods

AE/ME 339 Computational Fluid Dynamics (CFD)

Finite Difference Approximation for First- Order Hyperbolic Partial Differential Equation Arising in Neuronal Variability with Shifts

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

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

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

The type of limit that is used to find TANGENTS and VELOCITIES gives rise to the central idea in DIFFERENTIAL CALCULUS, the DERIVATIVE.

Section A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics

MATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS

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.

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Chapter 10 Partial Differential Equations and Fourier Series

Math 113 Exam 3 Practice

U8L1: Sec Equations of Lines in R 2

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

Ma 530 Introduction to Power Series

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

The Advection-Diffusion equation!

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

Transcription:

aylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. At ay poit i the eighbourhood of =0, the fuctio ca be represeted as a power series of the followig form: X 0 f(a) f() ƒ() f()= ( ) f( ) ( ) ( ) ( ) () f ( 0) f ( 0) f ( 0) f ( 0) 0 0 0 0 0 0! 1!!! where! stads for the factorial of ad f () ( 0 ) for the -th derivative of f at = 0. Eamples: he fuctio f()= e i the eighborhood of =0 has the followig aylor series: 4 e 1+ + 6 4 Q: 5 If the E of f()= si() aroud 0 is: si() = -! 5! e What is the aylor epasio E of f()= aroud =0? si( ) Hit: Let e si( ) e c +c +c +c si( ) has a epasio of the form: 1 5 e c 1+c +c +c -! 5! S.1

Iterpolatio techiques By iterpolatio we mea a procedure for estimatig the value of the fuctio at itermediate values. If for < < the fuctios f ( ) 1 1 ad f ( ) are used to evaluate f (), the the procedure is called iterpolatio. f(x 1) 1 F =? ( f(x ) By etrapolatio we mea a procedure for estimatig the fuctio f() at a eterior ew value: If for < < or < < the 1 1 fuctios f ( ) ad f ( ) are used to 1 evaluate f (), the the procedure is called EXRA-polatio. f(x 1) f(x ) F =? Liear iterpolatio ca be used for both procedures: y( ) - y( 1) y() - y( 1) = 1 1 1 y( ) - y( 1) = y() - y( 1) 1 1 y() = y( 1) - y( ) - y( 1) 1 1 S.

Polyomial iterpolatio: Assume we are give the followig +1 poits: (,y ), (,y ),, (,y ). 0 0 1 1 With the help of these poits, we wat to have a approimatio for the additioal poit (, y). he strategy here is to costruct a polyomial of degree, such that y() = a + a +... a. -1-1 0 As this polyomial goes through the above +1 poits, it therefore must satisfy the followig equatios: a + a +... a = y 1 0-1 0 0 0 1 1 0 0 0 1-1 1 0 1 1 1 1 1 a + a +... a = y a + a +... a = y 1-1 0 1 a y0 1 a 1 y1 1 1 1 a0 y `X Q1: what does it mea, whe the matri X is sigular? Give eamples! Q : Assume we are give the followig poits: (,y ) = (1,) Use these poits to fid a 0 0 (,y ) = (,) polyomial approimatio for 1 1 (,y ) = (,1) y at = 5/? S.

Lagrage iterpolatio: Assume we are give the followig poits: (,y ), (,y ),, (,y ). 0 0 1 1 Based o these poits, Lagrage suggested the followig approimatio for y at : N y =y( ) y() = y = y (), where - Eample k =0 () k - k Give are the followig set of poits (,y): 1 4 y 8 7 6 5 - - - 1 1 0() ( 0-1 0-0- 6 - - - 1 0 1() ( 1)( )( 4) 1-0 1-1- - - - 1 0 1 () ( 1)( )( 4) - 0-1 - )( )( 4) - 0-1 - 1 () ( 1)( )( ) - 0-1 - 6 1 1 y() = 8 ( )( )( 4) 7 ( 1)( )( 4) 6 1 1 + 6 ( 1)( )( 4) 5 ( 1)( )( ) 6 S.4

Fiite differece discretizatio: L 5 & 6: RelHydro/Basel How to represet u i fiite space? Forward differece (u < 0): fiite space = = Backward differece (u > 0): Δ ( ) - ( ) - Δ - h fiite space = -1-1 -1 Ad how good is this approatio? aylor epasio -1 = ( -1)= ( -h) = h + + O(h ) Subtitute this epressio: rucatio error Δ - -1 (- h +(h /) ) = + O(h) Δ h h Δ ( ) - ( ) - Δ - h +1 +1 +1 But how good is this approatio? aylor epasio +1 = ( +1)= ( h) = h + + O(h ) Subtitutig this epressio: rucatio error Δ +1 - h +(h /) = + O(h) Δ h h he scheme is first order accurate. h h = he scheme is first order accurate also. = S.5

Higher order derivatives: L 5 & 6: RelHydro/Basel F ( ) F, where F fiite space ΔF F( ) - F( -1) F +1 - F F = Δ - h F -1 Δ - Δ -, F -1 +1 +1 Δ = h Δ = h +1 Subtitute these epressio: ΔF F - F-1 1 1 = F - F -1 +1 - -1 Δ h h h But how good is this approatio? aylor epasio 1 = ( 1)= ( h) = h + + O(h ) h Δ Δ 1 ( ) +1 - -1 = + O(h ) Δ Δ h he scheme is secod order accurate. S.6

he oe-dimesioal heat equatio: Cosider the followig heat diffusio equatio: t. I the absece of trasport, the heat diffuses i a symmetric maer, provided the diffusio coefficiet, χ, ad the BC are symmetric too. If advectio (trasport) is icluded, the this symmetry will be broke as there is a preferable directio for heat trasport, which is eemplified i the followig two figures. u > 0 Assume that both edges of the metal rod are kept at certai costat temperatures u ad d. Let the rod be heated at the ceter for a certai period of time. How do the iitial, itermediate ad fial profiles of the temperature look like? S.7

Ituitively (without performig aalytical or umerical calculatio) we may epect that: the BCs ad the ICs may play a essetial role i determiig the form ad evolutio of the solutio at ay time t. here are two types of problems: Iitial value ad boudary value problems. he stregth of depedece o the ICs ad BCs determie the type of the problem. he heat equatio: discretizatio: he temperature depeds o t as well as o, i.e, = (t,). hus for each value of ad value of t there is a suitable value for (hopefully a uique value). t (t, ) = t t S.8

A eplicit discretizatio of this equatio yields the followig form: 1 1 1 1 ( ) f t (poitwise) ime Eplicit t where s = discretizatio 1 s 1 (1 s) s 1, Predictio power of eplicit procedures: Accuracy more poit to iclude larger domai (like weather forecast) he weather i Basel: time versus domai t S.9

t L a() = + O( t) + O( ) Cosistecy: he fiite space represetatio L ( ) a = χ is of the equatio t said to be cosistet, if the trucatio error goes to zero as t, 0. (local aalysis) Stability: he fiite space represetatio L ( ) a of the equatio t rucatio error = χ is said to be umerically stable, if accumulated errors do ot grow with time (o-local). S.10

Weak ad strog solutios of Navier-Stokes equatios he equatios describig the evolutio of icompressible viscous fluid flows are called the Navier-Stokes equatios (that were formulated aroud 180s) ad read: where u u u = (u,u y,u z), t, = viscosity, p = pressure, = domai i R, = boudary, I =(0, ) ad u 0= iitial value. For a give data, it was prove by Leray (194) that the Navier-Stokes equatios have at least oe weak solutio. However, it is still ot clear, whether the weak solutio is uique or ot. Now by a weak solutio we mea a solutio that satisfies the above partial differetial equatios o average, but ot ecessary i a poitwise maer. For eample, the derivatives may ot eist at certai poits. However, a strog solutio is said to satisfy the equatios everywhere ad at each poit of the domai La-Wedroff theorem: he umerical solutio Lq ( ) q is said to be a weak solutio for the aalytical equatio, if the umerical scheme employed is coservative, cosistet ad the umerical procedure coverges. Coservatio covergece weak solutio La theorem: If q has bee obtaied usig a coservative ad cosistet scheme, the q coverges to a weak solutio of the aalytical problem whe, i.e., whe the umber of grid poits goes to ifiity. For umerical mathematicias, the above-metioed theorems implies the followig: Differet coservative umerical methods may yield differet solutios, provided the umber of grid poits is relatively small. Differet coservative umerical methods that are umerically stable ad cosistet must coverge to the same weak solutio if the umber of grid poits goes to ifiity. You caot claim to have foud a solutio for the physical problem, uless you carried out the caculatios with sufficietly large umber of grid poits, beyod which doublig the umber of grid poits yield o oticeable improvemet. From Fletcher : Computatioal techiques... (1990) S.11

S.1

Q : Give is the heat equatio: i the domai D=[t] [] [0,1] [0,1] together with t the IC ad BC: (t=0) = 1, (t,0) =, (t,1)=. 1 Solve the equatio usig the FCS formulatio, i.e., s (1 s) s, where followig s-values: s = 0.1, 0., 0.4, 0.8, 1.., 1 1 s = t /, =1 ad N ( umber of grid poits i -directio) 100 for the Plot the solutios at times: t = 0.1, 0., 0.4 ad 1.0. S.1