lecture 16

# lecture 16 - CE 30125 - Lecture 16 LECTURE 16 NUMERICAL...

This preview shows pages 1–6. Sign up to view the full content.

CE 30125 - Lecture 16 p. 16.1 LECTURE 16 NUMERICAL SOLUTION OF THE TRANSIENT DIFFUSION EQUATION US- ING THE FINITE DIFFERENCE (FD) METHOD • Solve the p.d.e. • Initial conditions (i.c.’s) • Boundary conditions (b.c.’s) • Notes • We can also specify derivative b.c.’s but we must have at least one functional value b.c. for uniqueness. • This p.d.e. is classified as a parabolic type p.d.e. • The equation can represent heat conduction and mass diffusion. u t ----- D 2 u x 2 -------- = uxt = t o , () u * o x = ux = x 1 t , u ** = 1 t = x 2 t , u ** 2 t =

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CE 30125 - Lecture 16 p. 16.2 Explicit Solution Procedure • Evaluate the p.d.e. at point ( and ) • Let’s use a forward difference approximation to evaluate at : accurate ij , () i spatial index = j temporal index = t j+1 j j-1 2 1 j=0 (i,j) i=0 1 2 i-1 i i+1 n-1 n i=n+1 x Dt Dx known values unknown values u t ----- , u t , u 1 + , u , Δ t ---------------------------- = O Δ t
CE 30125 - Lecture 16 p. 16.3 • Use a central difference approximation to evaluate at : accurate • Substituting into the p.d.e.: • Solving for unknown represents the solution at the node and the time level. 2 u x 2 -------- ij , 2 u x 2 , u i 1 j , + 2 u , u i 1 j , + Δ x () 2 ----------------------------------------------------- = O Δ x 2 1 Δ t ----- u 1 + , u , D Δ x 2 ------------- u i 1 j , + 2 u , u i 1 j , + = u 1 + , i th j 1 + u 1 + , Δ tD Δ x 2 u i 1 j , + 1 2 Δ Δ x 2 -------------- u , Δ Δ x 2 u i 1 j , ++ =

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CE 30125 - Lecture 16 p. 16.4 • Notes on solving the discrete approximations to the p.d.e. • Let’s examine the FD molecule: • One discrete equation can be written for each node (such that the number of unknowns equals the number of equations) • We can compute unknown nodal values of at the new time level directly from values of the previous time level (i.e. they are not coupled at the new time level). The order in which the computations are performed in space does not matter since the values at the new time level are entirely dependent on values at previous time levels. • Explicit Formula - one unknown pivotal (or nodal) value is directly expressed in terms of known pivotal values. j+1 j-1 j i-1 i i+1 known values unknown values u
CE 30125 - Lecture 16 p. 16.5 • Notes on time marching and accuracy • The process advancing from a known time level(s) to the unknown time level is called “time marching”. • The solution is known at time level , starting with the initial conditions at .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/02/2012 for the course CE 30125 taught by Professor Westerink,j during the Fall '08 term at Notre Dame.

### Page1 / 18

lecture 16 - CE 30125 - Lecture 16 LECTURE 16 NUMERICAL...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online