The Finite Difference Method
|
|
- Meryl McGee
- 6 years ago
- Views:
Transcription
1 Chapter 5. The Finite Difference Method This chapter derives the finite difference equations that are used in the conduction analyses in the next chapter and the techniques that are used to overcome computational instabilities encountered when using the algorithm. A two-dimensional heat-conduction problem at steady state is governed by the following partial differential equation. T T + = 0 (5.1.1) This is the Laplace equation, and this type of problem is classified as an elliptic system. The finite difference equations and solution algorithms necessary to solve a simple elliptic system can be found in the literature. Because of the way that the present problem is defined two boundary conditions specified in one of the two dimensions, a new solution algorithm becomes necessary. The following steps explain how the equations are derived, and the algorithm is formulated. 5.1 Derivation of the Finite Difference Equations Interior nodes A finite difference equation (FDE) presentation of the first derivative can be derived in the following manner. In a descritized domain, if the temperature at the node i is T(i), the temperature at the node i+1, spatially separated from node i by in the x-direction (fictitious direction in space), can be approximated as the Taylor series expansion. 60
2 T T T T T (i + 1) = T(i) (5.1.)!!! Similarly at the node i-1, T T T T T (i 1) = T(i) + + (5.1.)!!! Here, represents the distance between centers of adjacent nodes. Adding Eqns. (5.1.) and (5.1.) results in the following form. T T T (i + 1) + T(i 1) = T(i) (5.1.)!! Solving for the second derivative term, T T(i + 1) T(i) + T(i 1) =! T (5.1.5) The nature of the Taylor series expansion lets higher order terms be truncated because magnitudes of the higher order terms are smaller. If one truncated all the right-hand-side terms, except the first, in Eqn. (5), it would look like the following. T T(i + 1) T(i) + T(i 1) = + O( ) (5.1.5 ) Here, O( ) contains all the truncated terms, or is regarded as the truncation error due to the approximation of the original derivative. This finite difference approximation of the x-derivative may be classified as central difference and of second order accuracy with truncation of the order of magnitude. The central difference indicates that the derivative approximation is centered at node i. As partial derivatives are used thoroughly in the above derivation, the same procedure applies in the y-direction. Hence, Equation (5.1.5 ) and the corresponding expression in the y-direction can be substituted into Eqn. (5.1.1). It yields the following, while dropping the higher order terms. T(i + 1, j) T(i, j) + T(i 1, j) T(i, j + 1) T(i, j) + T(i, j 1) + = 0 (5.1.6) 61
3 j+1 Direction of Parabolicity j j 1 i 1 i i+1 Figure 5.1 Neighboring nodes for the finite difference presentation of the Laplace equation about the node (i,j). indicates the node at which the temperature is to be calculated based on those at the nodes indicated with. Figure 5.1 shows the relative positioning of the points involved in Eqn. (5.1.6) to approximate the Laplace equation with the order and about the node (i,j). Because of the way the problem is defined, the calculation proceeds from one side of the domain where j=1 to the other where j=nj. Therefore, Equation (5.1.6) must be solved for T(i,j+1). (i, j + 1) = T(i, j) T(i, j 1) T { T(i + 1, j) T(i, j) + T(i 1, j) } (5.1.7) This, then, is the form in which the Laplace equation is implemented in the computational code. 6
4 5.1. Nodes at boundaries Equation (5.1.7) cannot be applied to nodes at boundaries. Therefore, modified equations suitable for capturing the conditions at the boundaries must be derived. In the problem, there are three types of boundaries and four boundaries. The first type is a boundary at which both temperature and heat flux are specified. The calculation algorithm starts with this boundary and proceeds in the direction of parabolicity that is indicated in Fig The second type applies to the side boundaries, i = 1 and NI. At the side boundaries, doubly connected or zero-flux boundary conditions can be specified. The doubly connected boundaries mean that both temperature and heat flux are specified. Detailed procedures can be found in Hoffmann and Chiang (1998). The last type is at the end of the calculation, j = NJ. There is no need to derive a finite difference equation at this level since each value will be computed from Eqn. (5.1.7). First, at the starting level, both temperature and heat flux are prescribed, and the to-be-derived finite difference equation must reflect that. Considering very small area elements indicated by the dashed lines in Fig. 5.1, transport of heat can be looked at in terms of Fourier s law, which states: T T q x " = ka ; q y " = ka (5.1.8) and (5.1.9) Heat transfer crossing the dashed line between the nodes (i,j) and (i,j+1) can be approximated as, assuming a linear temperature distribution: T(i, JN 1) T(i, JN) q S = k (5.1.10) Here, the S (South) indicates the relative location from node (i,j) of the surface through which the heat flows. Positive values indicate northerly (increasing j) flow. Similar expressions can be derived for all four directions. However, the prescribed temperature at level j=jn is uniform; therefore, q W and q E are both zero. The heat flow on the north boundary, from the gas to the wall, is: q N [ T T(i, JN) ] = h (i) (5.1.11) o g 6
5 h o (i) is a local value of heat transfer coefficient, and T g is the freestream temperature of gas. The positive sign indicates northerly flow when T g > T(I,JN). Now, conservation of energy can be applied, considering positive heat flow to be in +x and +y directions, i.e. Substituting, q N + q E + qs q W = 0 [ ] T(i, JN 1) T(i, JN) T T(i, JN) + 0 k h(i) g = Solving for T(i,), T(i,JN [ T T(i, JN) ] (5.1.1) (5.1.1) h o (i) 1) = T(i, JN) g (5.1.1) k The side boundaries are doubly connected, which means that both temperature and heat flux match between the side boundaries. In other words, the node (1, j) is identical to node (NI, j). To achieve this condition, Eqn. (5.1.7) can be modified as follows. At i=1, for example, there is no such node as i-1, so this is replaced with IN-1. (1, j + 1) = T(1, j) T(1, j 1) T Similarly at i=in, { T(, j) T(1, j) + T(IN 1, j) } (5.1.15) (IN, j + 1) = T(IN, j) T(IN, j 1) T { T(, j) T(IN, j) + T(IN 1, j) } (5.1.16) Now that all boundaries seem to have been addressed, the question remains, How to deal with the corner nodes. At j = JN, Eqns. (5.1.15) and (5.1.16) are applicable as is Eqn. (5.1.7) to the nodes at the j = JN level. At j = 1 then, as seen from the comparison between Eqns. (5.1.15) and (5.1.16), the corresponding equations do not lead to having the corner nodes being identical since the heat transfer coefficients may be different at I=1 and IN. Therefore, for the present study, one of the two possible values of the heat transfer coefficients either h(1) or h(in) is used. 6
6 5. Pre-Computation Analyses Before the above finite difference equations are implemented into the computational code, there are a few analyses one can do to check whether the equations are consistent with the original partial differential equation (consistency analysis) and to derive stability criteria for the computation (perturbation analysis) Consistency analysis This analysis confirms that the derived finite difference equation is consistent with the original governing partial differential equation the Laplace equation. Equation (5.1.7) is going to be applied to most of the nodes in the computation. Thus, this analysis looks at Eqn. (5.1.7) only. Equations (5.1.1), (5.1.15) and (5.1.16), are merely modified cases of Eqn. (5.1.7). To test the consistency, the Taylor series expansions of T(i+1, j), T(i-1, j), T(i, j+1) and T(i, j-1) are substituted into Eqn. (7). The resulting form is: T (i, j) + +! T +! T T T(i, j) +! T + = T(i, j) T! T + T T T T(i, j) T(i, j)!! Rearranging to get, T T(i, j) +! T! T (5..1)! T +! T! T +! = T (5..) 65
7 Multiplying the both sides by and dividing by, T + 1 T T T + = 0 (5..) Consistency is confirmed if the original partial differential equation is recovered when and go to zero. This is true for Eqn. (5..), and the consistency is confirmed. 5.. Perturbation analysis A perturbation analysis is a way to determine a criterion for computational stability. This is achieved by introducing a small perturbation into the finite difference equation, in this case Eqn. (5.1.7). Looking at propagation of the perturbation in the direction of computation, a stability criterion can be derived in terms of combinations of and. This procedure is based on Chapter in Hoffmann and Chiang (1998) where they derive stability criteria for one-dimensional, transient heat conduction computations. They introduce different types of perturbations at a particular time and examine how they grow or decay. Certainly, the larger the decay, the more stable is the algorithm. They find that the criterion that they derive for spatially oscillating perturbations is the strictest. Following their procedure, such perturbations are introduced into level j of Eqn. (5.1.7). A small perturbation is denoted by ε, and +ε is introduced at node (i, j), -ε at (i-1, j) and (i+1, j). The values before the level j are zero; therefore, T(i, j-1) is equal to 0. Equation (5.1.7) then becomes: (i, j + 1) = ( + ε) 0 {( ε) ( +ε) + ( ε) } (5..) T Rearranging to obtain the ratio of T(i, j+1) to ε, T(i, j + 1) ε = + (5..5) This ratio represents a propagation of the error. If the ratio is less than unity, the error decays with continued calculation. If the ratio is greater than unity, the error grows, and 66
8 the calculation becomes unstable. Thus, a proper combination of and must be sought from Eqn. (5..5). The requirement then is to limit the magnitude of Eqn. (5..5) to less than unity: T(i, j_ + 1) < 1 (5..6) ε In other words, + < 1 (5..7) There are two possible conditions: + < 1 and < 1 + x (5..8) From the second condition, y 1 > (5..9) This is always satisfied since both length scales are positive values. However, from the first condition, y 1 < (5..10) This cannot be satisfied by any combination of and. In conclusion, this perturbation analysis did not lead to a criterion for computational stability; rather, it is anticipated that the computation will be unstable since Eqn. (5..10) cannot be satisfied. At this point, it has become necessary to derive a technique to overcome the anticipated instability. The next section deals with this issue. 67
9 5. Smoothing the Temperature Profile Solutions, or temperature fields, calculated with the above finite difference equation will surely produce errors. The growth of the errors is similar to that of a system governed by a parabolic partial differential equation such as a one-dimensional, transient heat conduction system. In both cases, computational instability produces oscillating errors. They may not be visible during an earlier stage when a profile is plotted. When the stability criterion is not met, these errors grow as the calculation progresses, and the solutions diverge. An idea to improve the situation is to smooth the temperature profile over each layer when the calculation on each layer is done. The oscillations are purely computational. By smoothing the temperature profile on each layer of the calculations, the oscillating errors are prevented from growing Smoothing parameter MATLAB is used for the computations, and the smoothing function chosen for this conduction problem within MATLAB has the function name CSAPS.M. The function returns smoothed new values of dependent variables based on a vector of independent variables, a vector of old dependent variables (or data) and a smoothing parameter. The smoothing parameter can be any value between 0.0 and 1.0. The new values of dependent variables fully depend of a choice of the parameter. This section reviews how the smoothing parameter affects the resulting profiles of dependent variables. The smoothing function has two extreme modifying routines built in. One is to take the least-square straight line. This routine can be selected by setting the smoothing parameter to zero. With this parameter value, the new dependent variable will be a straight line through the range of independent variables. Therefore, this would not be accurate unless the dependent variables are expected to be linear functions. The other extreme is to follow all the old values of the dependent variable. This can be selected by setting the parameter to unity. However, the vector of the new dependent variable would 68
10 be identical to one of the old values, and there would be no smoothing. Any value between results in a weighed average of the two extreme cases. In Fig. 5., observations are made of two different values of the smoothing parameters using simple functions. In (a) and (b), smoothing parameters of 0.1 and 0.9 are respectively applied to a linear function with oscillating errors. In (c) and (d), the same pair of the smoothing parameters, 0.1 and 0.9, is applied to a combination of linear functions peaking at the middle point. In any case, the data points are indicated with, and they deviate by 0.06 from the true functions, which are plotted as the solid lines. The smoothing function generates the dashed lines based only on the data points given by. Therefore, performance of smoothing function is measured by how close the smoothed lines are to the true profile. 69
11 1 (a) 1 (b) Node No Node No. 1 (c) 1 (d) Node No Node No. Figure 5. Smoothing parameters and their effects on the smoothing. The solid line is the true profile, the crosses the original data points with oscillating errors from the true profile and the dashed line the smoothed profile intended to recover the true profile. (a) and (c) use a smoothing parameter of 0.1 and (b) and (d) 0.9. In (a) and (b), the effects of the different smoothing parameters are minor while they are quite significant in (c) and (d). It seems that the smoothing function is better at dealing with simply increasing or decreasing functions than it is at dealing with peaks in the functions. Properly recovering a peak is an important issue. The actual conduction problem in the main project has much higher heat fluxes around the leading edge of the airfoil. The peak is expected to give rise to strong temperature variations in that region. If there is such a phenomenon, it is important to properly capture it. 70
12 By comparing (c) and (d), it is obvious that the higher value of the smoothing parameter, 0.9, does a much better job. However, the true value will not be recovered even with the value 1.0 since the smoothed line with the value 1.0 merely goes through all the data points. Therefore, in the main project, it is important to have many data points within a peak so that such a peak can be recovered. In other words, the goal of implementing this smoothing function is to eliminate locally oscillating profiles, or local peaks; therefore, any true peak with one data point, such as the one in (d) of Fig. 5., can be strongly smoothed. Since at least one peak is expected in the main conduction problem, a value of the smoothing parameter that will be used is expected to be close to 1.0. In fact, the values used in the curved wall analysis (see Sections 6. and 6.) are on the order of Example This section considers a classical one-dimensional, transient heat conduction problem that can be analytically solved. The comparisons are made between the analytical solution and numerical solutions with and without smoothing. This example will show that the smoothing process does not cause any unphysical effects on the resulting solution. This is Problem.1 from Hoffmann and Chiang (1998). The situation is given in Fig. 5., and the system is governed by a parabolic PDE given in Eqn. (5..1). 71
13 T s T i T s 1-D x Figure 5. Example problem T T = (5..1, 6) t The temperatures at the surfaces is raised to T s at time zero, and initially the slab has a temperature of T i. The analytical solution can be obtained by the Fourier series, and is given as: π π = + ( ) m m 1 ( 1) m x T(x, t) Ts Ti Ts exp αt sin (5.., 7) m= 1 L mπ L The physical parameters used are the domain length, L, of 1 [ft], the initial temperature, T i, of 100 [ F], the surface temperature, T s, of 00 [ F] and the thermal diffusivity, α, of 0.1 [ft /hr]. A computational method, similar to the one derived earlier in this chapter for the main conduction problem, is the explicit method called Forward Time Central Space (FTCS) method. The finite difference equation states: T n+ 1 i n n n [ T T + T ] n α t = Ti + i+ 1 i i 1 (5.., 6) 7
14 The index i indicates x-position and n time. The steps, t and, are in time and space, respectively. A perturbation analysis can be done in the same way as done in the earlier case. It results in the criterion: α t 1 (5.., 7) By restricting the spatial step,, to 0.05 [ft], the critical value of time step, t, can be calculated since the diffusivity is given; it is [hr]. Therefore, if the time step is set to a value which is less than 0.015, the calculation will be stable. The time step of 0.01 [hr] is used for the stable calculation, and 0.0 [hr] for the smoothed calculation. To be more precise, three calculations are compared in the following discussions. One is the analytical solution given by Eqn. (5..). The second is a numerical calculation with the stability criterion met. In this case, the time step of 0.01 [hr] is used, and there is no smoothing process. The last is yet another numerical calculation with the stability criterion NOT met. In this case, the time step of 0.0 [hr] is used. Since the calculation is unstable, the smoothing process is implemented every time step. The results are shown in the following figures. The smoothing parameter used is In the analytical solution, the series terms up to the fifth are included. Figures 5. (a) and (b) present the entire domain at times 0.1 and 1.0 hour, respectively. The deviations of the numerical methods from the analytical are barely visible in these scales. These figures are magnified in (c) and (d), centering the locations where deviations are seemingly the greatest. In (c) and (d), besides the magnitudes of the deviations, the comparisons evidently show what the smoothing process is least good at capturing precipitous changes in gradients. While the analytical solution draws the outermost curvature, the stable solution misses capturing the peak values, and each of the smoothed calculations has even less curvature. 7
15 T [ o F] (a) smoothed stable analytical T [ o F] (b) 100 t=0.1 hr X [ft] 00 t=1.0 hr X [ft] (c) (d) T [ o F] T [ o F] t=0.1 hr X [ft] t=1.0 hr X [ft] Figure 5. Results of example problem testing the smoothing parameter Figure 5.5 shows distributions of the deviations from the analytical solution. The errors are the greatest where the analytical solution has the highest rate of changes in gradients. The trends of the error distributions are similar between the stable solution and the smoothed solution, except for the magnitudes. The most remarkable advantage of using the smoothing technique is that the instabilities in the algorithm have been overcome. The time step of 0.0 [hr] exceeds the stability criterion given by Eqn. (5..) and has a value If an ordinary calculation were begun with this condition, the solution would diverge; however, with the use of the smoothing function, the errors are of the same magnitude as those of the stable calculations. 7
16 1 t=0.1 hr (a) (b) Error [%] 0 1 stable smoothed X [ft] Error [%] t=1.0 hr X [ft] Figure 5.5 Error distributions of the example problem, (a) at 0.1 hour and (b) at 1.0 hour 75
17 5. Conclusions Finite difference equations have been developed for the two-dimensional heat conduction computations to be performed in the next Chapter. The equations allow parabolic solution algorithms that become necessary because of the way that the problem is proposed. Equation (5.1.7) is used for interior nodes with uniform grids; Eqns. (5.1.15) and (5.1.16) are used for nodes at side boundaries. Consistency analysis verifies that the newly developed FDE, Eqn. (5.1.7), is consistent with the governing Laplace equation. However, perturbation analysis concludes that the algorithm is not stable, i.e. errors growing as the computation proceeds in the parabolic direction. To overcome the instability, a profile-smoothing technique is developed and tested in a simple, one-dimensional, transient, heat conduction example. A temperature profile is smoothed by a smoothing function to eliminate oscillating errors. The example has yielded a solution that is almost identical to the analytical solution, verifying that the smoothing function helps overcome instability. Still, the smoothing procedure may reduce a true peak value if the profile is kinky at the peak. 76
Basic Aspects of Discretization
Basic Aspects of Discretization Solution Methods Singularity Methods Panel method and VLM Simple, very powerful, can be used on PC Nonlinear flow effects were excluded Direct numerical Methods (Field Methods)
More informationModule 3: BASICS OF CFD. Part A: Finite Difference Methods
Module 3: BASICS OF CFD Part A: Finite Difference Methods THE CFD APPROACH Assembling the governing equations Identifying flow domain and boundary conditions Geometrical discretization of flow domain Discretization
More informationFinite Difference Methods (FDMs) 1
Finite Difference Methods (FDMs) 1 1 st - order Approxima9on Recall Taylor series expansion: Forward difference: Backward difference: Central difference: 2 nd - order Approxima9on Forward difference: Backward
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods
More information2.2. Methods for Obtaining FD Expressions. There are several methods, and we will look at a few:
.. Methods for Obtaining FD Expressions There are several methods, and we will look at a few: ) Taylor series expansion the most common, but purely mathematical. ) Polynomial fitting or interpolation the
More informationChapter 5 Types of Governing Equations. Chapter 5: Governing Equations
Chapter 5 Types of Governing Equations Types of Governing Equations (1) Physical Classification-1 Equilibrium problems: (1) They are problems in which a solution of a given PDE is desired in a closed domain
More informationPartial Differential Equations
Next: Using Matlab Up: Numerical Analysis for Chemical Previous: Ordinary Differential Equations Subsections Finite Difference: Elliptic Equations The Laplace Equations Solution Techniques Boundary Conditions
More information1 Finite difference example: 1D implicit heat equation
1 Finite difference example: 1D implicit heat equation 1.1 Boundary conditions Neumann and Dirichlet We solve the transient heat equation ρc p t = ( k ) (1) on the domain L/2 x L/2 subject to the following
More informationComputational Fluid Dynamics Prof. Dr. SumanChakraborty Department of Mechanical Engineering Indian Institute of Technology, Kharagpur
Computational Fluid Dynamics Prof. Dr. SumanChakraborty Department of Mechanical Engineering Indian Institute of Technology, Kharagpur Lecture No. #11 Fundamentals of Discretization: Finite Difference
More information2.3. Quantitative Properties of Finite Difference Schemes. Reading: Tannehill et al. Sections and
3 Quantitative Properties of Finite Difference Schemes 31 Consistency, Convergence and Stability of FD schemes Reading: Tannehill et al Sections 333 and 334 Three important properties of FD schemes: Consistency
More informationPartial differential equations
Partial differential equations Many problems in science involve the evolution of quantities not only in time but also in space (this is the most common situation)! We will call partial differential equation
More information5. FVM discretization and Solution Procedure
5. FVM discretization and Solution Procedure 1. The fluid domain is divided into a finite number of control volumes (cells of a computational grid). 2. Integral form of the conservation equations are discretized
More informationFinite Difference Methods (FDMs) 2
Finite Difference Methods (FDMs) 2 Time- dependent PDEs A partial differential equation of the form (15.1) where A, B, and C are constants, is called quasilinear. There are three types of quasilinear equations:
More informationSolution Methods. Steady State Diffusion Equation. Lecture 04
Solution Methods Steady State Diffusion Equation Lecture 04 1 Solution methods Focus on finite volume method. Background of finite volume method. Discretization example. General solution method. Convergence.
More informationME Computational Fluid Mechanics Lecture 5
ME - 733 Computational Fluid Mechanics Lecture 5 Dr./ Ahmed Nagib Elmekawy Dec. 20, 2018 Elliptic PDEs: Finite Difference Formulation Using central difference formulation, the so called five-point formula
More informationChapter 1. Introduction to Nonlinear Space Plasma Physics
Chapter 1. Introduction to Nonlinear Space Plasma Physics The goal of this course, Nonlinear Space Plasma Physics, is to explore the formation, evolution, propagation, and characteristics of the large
More informationwhere is the Laplace operator and is a scalar function.
Elliptic PDEs A brief discussion of two important elliptic PDEs. In mathematics, Laplace's equation is a second-order partial differential equation named after Pierre-Simon Laplace who first studied its
More informationIntroduction LECTURE 1
LECTURE 1 Introduction The source of all great mathematics is the special case, the concrete example. It is frequent in mathematics that every instance of a concept of seemingly great generality is in
More informationMULTIGRID CALCULATIONS FOB. CASCADES. Antony Jameson and Feng Liu Princeton University, Princeton, NJ 08544
MULTIGRID CALCULATIONS FOB. CASCADES Antony Jameson and Feng Liu Princeton University, Princeton, NJ 0544 1. Introduction Development of numerical methods for internal flows such as the flow in gas turbines
More informationBasics of Discretization Methods
Basics of Discretization Methods In the finite difference approach, the continuous problem domain is discretized, so that the dependent variables are considered to exist only at discrete points. Derivatives
More informationFinite Volume Method for Scalar Advection in 2D
Chapter 9 Finite Volume Method for Scalar Advection in D 9. Introduction The purpose of this exercise is to code a program to integrate the scalar advection equation in two-dimensional flows. 9. The D
More informationFinite Difference Method for PDE. Y V S S Sanyasiraju Professor, Department of Mathematics IIT Madras, Chennai 36
Finite Difference Method for PDE Y V S S Sanyasiraju Professor, Department of Mathematics IIT Madras, Chennai 36 1 Classification of the Partial Differential Equations Consider a scalar second order partial
More informationChapter 5 Time-Dependent Conduction
Chapter 5 Time-Dependent Conduction 5.1 The Lumped Capacitance Method This method assumes spatially uniform solid temperature at any instant during the transient process. It is valid if the temperature
More informationSecond-Order Linear ODEs (Textbook, Chap 2)
Second-Order Linear ODEs (Textbook, Chap ) Motivation Recall from notes, pp. 58-59, the second example of a DE that we introduced there. d φ 1 1 φ = φ 0 dx λ λ Q w ' (a1) This equation represents conservation
More informationLecture 4.2 Finite Difference Approximation
Lecture 4. Finite Difference Approimation 1 Discretization As stated in Lecture 1.0, there are three steps in numerically solving the differential equations. They are: 1. Discretization of the domain by
More informationIntroduction to Partial Differential Equations
Introduction to Partial Differential Equations Philippe B. Laval KSU Current Semester Philippe B. Laval (KSU) Key Concepts Current Semester 1 / 25 Introduction The purpose of this section is to define
More informationImplicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments
Implicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments James V. Lambers September 24, 2008 Abstract This paper presents a reformulation
More informationAdditive Manufacturing Module 8
Additive Manufacturing Module 8 Spring 2015 Wenchao Zhou zhouw@uark.edu (479) 575-7250 The Department of Mechanical Engineering University of Arkansas, Fayetteville 1 Evaluating design https://www.youtube.com/watch?v=p
More informationOrdinary differential equation II
Ordinary Differential Equations ISC-5315 1 Ordinary differential equation II 1 Some Basic Methods 1.1 Backward Euler method (implicit method) The algorithm looks like this: y n = y n 1 + hf n (1) In contrast
More informationLecture 17: Initial value problems
Lecture 17: Initial value problems Let s start with initial value problems, and consider numerical solution to the simplest PDE we can think of u/ t + c u/ x = 0 (with u a scalar) for which the solution
More informationMarching on the BL equations
Marching on the BL equations Harvey S. H. Lam February 10, 2004 Abstract The assumption is that you are competent in Matlab or Mathematica. White s 4-7 starting on page 275 shows us that all generic boundary
More informationChapter 5 FINITE DIFFERENCE METHOD (FDM)
MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Implicit Schemes for the Model Problem The Crank-Nicolson scheme and θ-scheme
More informationNumerical methods Revised March 2001
Revised March 00 By R. W. Riddaway (revised by M. Hortal) Table of contents. Some introductory ideas. Introduction. Classification of PDE's.3 Existence and uniqueness.4 Discretization.5 Convergence, consistency
More informationChapter 3 Three Dimensional Finite Difference Modeling
Chapter 3 Three Dimensional Finite Difference Modeling As has been shown in previous chapters, the thermal impedance of microbolometers is an important property affecting device performance. In chapter
More informationLecture 4 Classical Control Overview II. Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore
Lecture 4 Classical Control Overview II Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore Stability Analysis through Transfer Function Dr. Radhakant
More informationSolution Methods. Steady convection-diffusion equation. Lecture 05
Solution Methods Steady convection-diffusion equation Lecture 05 1 Navier-Stokes equation Suggested reading: Gauss divergence theorem Integral form The key step of the finite volume method is to integrate
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS NUMERICAL FLUID MECHANICS FALL 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS 02139 2.29 NUMERICAL FLUID MECHANICS FALL 2011 QUIZ 2 The goals of this quiz 2 are to: (i) ask some general
More informationErrors in the Data Measurements
Voyager PLS Error Analysis Errors in the Data Measurements For all purposes in this Error Analysis memo, it will be assumed that currents are measured and displayed in femtoamps. This is the natural range
More informationFinite Difference Methods for
CE 601: Numerical Methods Lecture 33 Finite Difference Methods for PDEs Course Coordinator: Course Coordinator: Dr. Suresh A. Kartha, Associate Professor, Department of Civil Engineering, IIT Guwahati.
More informationarxiv: v1 [physics.comp-ph] 22 Feb 2013
Numerical Methods and Causality in Physics Muhammad Adeel Ajaib 1 University of Delaware, Newark, DE 19716, USA arxiv:1302.5601v1 [physics.comp-ph] 22 Feb 2013 Abstract We discuss physical implications
More informationPart 1. The diffusion equation
Differential Equations FMNN10 Graded Project #3 c G Söderlind 2016 2017 Published 2017-11-27. Instruction in computer lab 2017-11-30/2017-12-06/07. Project due date: Monday 2017-12-11 at 12:00:00. Goals.
More informationProblem Set 4 Issued: Wednesday, March 18, 2015 Due: Wednesday, April 8, 2015
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS 0139.9 NUMERICAL FLUID MECHANICS SPRING 015 Problem Set 4 Issued: Wednesday, March 18, 015 Due: Wednesday,
More informationA generalized method for advective-diffusive computations in engineering
Fluid Structure Interaction and Moving Boundary Problems 563 A generalized method for advective-diffusive computations in engineering H. Gómez, I. Colominas, F. Navarrina & M. Casteleiro Department of
More informationq t = F q x. (1) is a flux of q due to diffusion. Although very complex parameterizations for F q
! Revised Tuesday, December 8, 015! 1 Chapter 7: Diffusion Copyright 015, David A. Randall 7.1! Introduction Diffusion is a macroscopic statistical description of microscopic advection. Here microscopic
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationMathematics Qualifying Exam Study Material
Mathematics Qualifying Exam Study Material The candidate is expected to have a thorough understanding of engineering mathematics topics. These topics are listed below for clarification. Not all instructors
More informationFinite Element Modules for Enhancing Undergraduate Transport Courses: Application to Fuel Cell Fundamentals
Finite Element Modules for Enhancing Undergraduate Transport Courses: Application to Fuel Cell Fundamentals Originally published in 007 American Society for Engineering Education Conference Proceedings
More informationFUNDAMENTALS OF FINITE DIFFERENCE METHODS
FUNDAMENTALS OF FINITE DIFFERENCE METHODS By Deep Gupta 3 rd Year undergraduate, Mechanical Engg. Deptt., IIT Bombay Supervised by: Prof. Gautam Biswas, IIT Kanpur Acknowledgements It has been a pleasure
More informationLecture 4.5 Schemes for Parabolic Type Equations
Lecture 4.5 Schemes for Parabolic Type Equations 1 Difference Schemes for Parabolic Equations One-dimensional problems: Consider the unsteady diffusion problem (parabolic in nature) in a thin wire governed
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationTime-Dependent Conduction :
Time-Dependent Conduction : The Lumped Capacitance Method Chapter Five Sections 5.1 thru 5.3 Transient Conduction A heat transfer process for which the temperature varies with time, as well as location
More informationECE539 - Advanced Theory of Semiconductors and Semiconductor Devices. Numerical Methods and Simulation / Umberto Ravaioli
ECE539 - Advanced Theory of Semiconductors and Semiconductor Devices 1 General concepts Numerical Methods and Simulation / Umberto Ravaioli Introduction to the Numerical Solution of Partial Differential
More informationA note on benchmarking of numerical models for density dependent flow in porous media
Advances in Water Resources 29 (2006) 1918 1923 www.elsevier.com/locate/advwatres A note on benchmarking of numerical models for density dependent flow in porous media B. Ataie-Ashtiani *, M.M. Aghayi
More informationElectromagnetic waves in free space
Waveguide notes 018 Electromagnetic waves in free space We start with Maxwell s equations for an LIH medum in the case that the source terms are both zero. = =0 =0 = = Take the curl of Faraday s law, then
More informationChapter 17. Finite Volume Method The partial differential equation
Chapter 7 Finite Volume Method. This chapter focusses on introducing finite volume method for the solution of partial differential equations. These methods have gained wide-spread acceptance in recent
More informationNon-linear least squares
Non-linear least squares Concept of non-linear least squares We have extensively studied linear least squares or linear regression. We see that there is a unique regression line that can be determined
More informationTransactions on Modelling and Simulation vol 8, 1994 WIT Press, ISSN X
Boundary element method for an improperly posed problem in unsteady heat conduction D. Lesnic, L. Elliott & D.B. Ingham Department of Applied Mathematical Studies, University of Leeds, Leeds LS2 9JT, UK
More informationChapter Parabolic Partial Differential Equations
hapter. Parabolic Partial Differential Equations After reading this chapter, you should be able to:. Use numerical methods to solve parabolic partial differential equations by explicit, implicit, and rank-nicolson
More information35. RESISTIVE INSTABILITIES: CLOSING REMARKS
35. RESISTIVE INSTABILITIES: CLOSING REMARKS In Section 34 we presented a heuristic discussion of the tearing mode. The tearing mode is centered about x = 0, where F x that B 0 ( ) = k! B = 0. Note that
More informationLecture 42 Determining Internal Node Values
Lecture 42 Determining Internal Node Values As seen in the previous section, a finite element solution of a boundary value problem boils down to finding the best values of the constants {C j } n, which
More informationNumerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value
Numerical Analysis of Differential Equations 188 5 Numerical Solution of Elliptic Boundary Value Problems 5 Numerical Solution of Elliptic Boundary Value Problems TU Bergakademie Freiberg, SS 2012 Numerical
More informationNumerical Methods for Problems with Moving Fronts Orthogonal Collocation on Finite Elements
Electronic Text Provided with the Book Numerical Methods for Problems with Moving Fronts by Bruce A. Finlayson Ravenna Park Publishing, Inc., 635 22nd Ave. N. E., Seattle, WA 985-699 26-524-3375; ravenna@halcyon.com;www.halcyon.com/ravenna
More informationClassification of partial differential equations and their solution characteristics
9 TH INDO GERMAN WINTER ACADEMY 2010 Classification of partial differential equations and their solution characteristics By Ankita Bhutani IIT Roorkee Tutors: Prof. V. Buwa Prof. S. V. R. Rao Prof. U.
More informationMATLAB Solution of Flow and Heat Transfer through a Porous Cooling Channel and the Conjugate Heat Transfer in the Surrounding Wall
MATLAB Solution of Flow and Heat Transfer through a Porous Cooling Channel and the Conjugate Heat Transfer in the Surrounding Wall James Cherry, Mehmet Sözen Grand Valley State University, cherryj1@gmail.com,
More informationIntroduction to Partial Differential Equations
Introduction to Partial Differential Equations Partial differential equations arise in a number of physical problems, such as fluid flow, heat transfer, solid mechanics and biological processes. These
More informationNONLINEAR DIFFUSION PDES
NONLINEAR DIFFUSION PDES Erkut Erdem Hacettepe University March 5 th, 0 CONTENTS Perona-Malik Type Nonlinear Diffusion Edge Enhancing Diffusion 5 References 7 PERONA-MALIK TYPE NONLINEAR DIFFUSION The
More informationNotation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i
LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent
More informationDiscretization of Convection Diffusion type equation
Discretization of Convection Diffusion type equation 10 th Indo German Winter Academy 2011 By, Rajesh Sridhar, Indian Institute of Technology Madras Guides: Prof. Vivek V. Buwa Prof. Suman Chakraborty
More informationSolution of Differential Equation by Finite Difference Method
NUMERICAL ANALYSIS University of Babylon/ College of Engineering/ Mechanical Engineering Dep. Lecturer : Dr. Rafel Hekmat Class : 3 rd B.Sc Solution of Differential Equation by Finite Difference Method
More informationIntro to Research Computing with Python: Partial Differential Equations
Intro to Research Computing with Python: Partial Differential Equations Erik Spence SciNet HPC Consortium 28 November 2013 Erik Spence (SciNet HPC Consortium) PDEs 28 November 2013 1 / 23 Today s class
More information1 Introduction to MATLAB
L3 - December 015 Solving PDEs numerically (Reports due Thursday Dec 3rd, carolinemuller13@gmail.com) In this project, we will see various methods for solving Partial Differential Equations (PDEs) using
More informationQUESTION ANSWER. . e. Fourier number:
QUESTION 1. (0 pts) The Lumped Capacitance Method (a) List and describe the implications of the two major assumptions of the lumped capacitance method. (6 pts) (b) Define the Biot number by equations and
More informationRenormalization Group analysis of 2D Ising model
Renormalization Group analysis of D Ising model Amir Bar January 7, 013 1 Introduction In this tutorial we will see explicitly how RG can be used to probe the phase diagram of d > 1 systems, focusing as
More informationA finite-volume algorithm for all speed flows
A finite-volume algorithm for all speed flows F. Moukalled and M. Darwish American University of Beirut, Faculty of Engineering & Architecture, Mechanical Engineering Department, P.O.Box 11-0236, Beirut,
More informationMA3232 Summary 5. d y1 dy1. MATLAB has a number of built-in functions for solving stiff systems of ODEs. There are ode15s, ode23s, ode23t, ode23tb.
umerical solutions of higher order ODE We can convert a high order ODE into a system of first order ODEs and then apply RK method to solve it. Stiff ODEs Stiffness is a special problem that can arise in
More informationNumerical Analysis of Differential Equations Numerical Solution of Parabolic Equations
Numerical Analysis of Differential Equations 215 6 Numerical Solution of Parabolic Equations 6 Numerical Solution of Parabolic Equations TU Bergakademie Freiberg, SS 2012 Numerical Analysis of Differential
More information7 Mathematical Methods 7.6 Insulation (10 units)
7 Mathematical Methods 7.6 Insulation (10 units) There are no prerequisites for this project. 1 Introduction When sheets of plastic and of other insulating materials are used in the construction of building
More informationInverse Heat Flux Evaluation using Conjugate Gradient Methods from Infrared Imaging
11 th International Conference on Quantitative InfraRed Thermography Inverse Heat Flux Evaluation using Conjugate Gradient Methods from Infrared Imaging by J. Sousa*, L. Villafane*, S. Lavagnoli*, and
More informationFinite Difference Solution of the Heat Equation
Finite Difference Solution of the Heat Equation Adam Powell 22.091 March 13 15, 2002 In example 4.3 (p. 10) of his lecture notes for March 11, Rodolfo Rosales gives the constant-density heat equation as:
More informationStability of solution of the diffusion equation using various formulation of finite difference method
Stability of solution of the diffusion equation using various formulation of finite difference method Michael J. Malachowski * Abstract A probabilistic approach has been used to analyze the stability of
More informationPhysics 342 Lecture 23. Radial Separation. Lecture 23. Physics 342 Quantum Mechanics I
Physics 342 Lecture 23 Radial Separation Lecture 23 Physics 342 Quantum Mechanics I Friday, March 26th, 2010 We begin our spherical solutions with the simplest possible case zero potential. Aside from
More informationMethod of Lines. Received April 20, 2009; accepted July 9, 2009
Method of Lines Samir Hamdi, William E. Schiesser and Graham W. Griffiths * Ecole Polytechnique, France; Lehigh University, USA; City University,UK. Received April 20, 2009; accepted July 9, 2009 The method
More informationOne dimensional steady state diffusion, with and without source. Effective transfer coefficients
One dimensional steady state diffusion, with and without source. Effective transfer coefficients 2 mars 207 For steady state situations t = 0) and if convection is not present or negligible the transport
More information2.29 Numerical Fluid Mechanics Spring 2015 Lecture 13
REVIEW Lecture 12: Spring 2015 Lecture 13 Grid-Refinement and Error estimation Estimation of the order of convergence and of the discretization error Richardson s extrapolation and Iterative improvements
More informationPartial Differential Equations
Partial Differential Equations Introduction Deng Li Discretization Methods Chunfang Chen, Danny Thorne, Adam Zornes CS521 Feb.,7, 2006 What do You Stand For? A PDE is a Partial Differential Equation This
More informationComputational Fluid Dynamics-1(CFDI)
بسمه تعالی درس دینامیک سیالات محاسباتی 1 دوره کارشناسی ارشد دانشکده مهندسی مکانیک دانشگاه صنعتی خواجه نصیر الدین طوسی Computational Fluid Dynamics-1(CFDI) Course outlines: Part I A brief introduction to
More informationCourant and all that. Consistency, Convergence Stability Numerical Dispersion Computational grids and numerical anisotropy
Consistency, Convergence Stability Numerical Dispersion Computational grids and numerical anisotropy c dx ε 1 he goal of this lecture is to understand how to find suitable parameters (i.e., grid spacing
More informationApplications of Harmonic Balance Method in Periodic Flows Gregor Cvijetić and Inno Gatin
Applications of Harmonic Balance Method in Periodic Flows Gregor Cvijetić and Inno Gatin Faculty of Mechanical Engineering and Naval Architecture, Zagreb 10000, Croatia, gregor.cvijetic@gmail.com The Harmonic
More informationIntroduction to Heat and Mass Transfer. Week 8
Introduction to Heat and Mass Transfer Week 8 Next Topic Transient Conduction» Analytical Method Plane Wall Radial Systems Semi-infinite Solid Multidimensional Effects Analytical Method Lumped system analysis
More informationFluid Mechanics Prof. T.I. Eldho Department of Civil Engineering Indian Institute of Technology, Bombay. Lecture - 17 Laminar and Turbulent flows
Fluid Mechanics Prof. T.I. Eldho Department of Civil Engineering Indian Institute of Technology, Bombay Lecture - 17 Laminar and Turbulent flows Welcome back to the video course on fluid mechanics. In
More informationUNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Faculty of Science and Engineering Department of Mathematics and Statistics END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MA4006 SEMESTER: Spring 2011 MODULE TITLE:
More informationNumerical Hydraulics
ETHZ, Fall 017 Numerical Hydraulics Assignment 4 Numerical solution of 1D solute transport using Matlab http://www.bafg.de/ http://warholian.com Numerical Hydraulics Assignment 4 ETH 017 1 Introduction
More informationA Search for the Simplest Chaotic Partial Differential Equation
A Search for the Simplest Chaotic Partial Differential Equation C. Brummitt University of Wisconsin-Madison, Department of Physics cbrummitt@wisc.edu J. C. Sprott University of Wisconsin-Madison, Department
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 21 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University 1 All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationAn efficient numerical method for hydraulic transient computations M. Ciccotelli," S. Sello," P. Molmaro& " CISE Innovative Technology, Segrate, Italy
An efficient numerical method for hydraulic transient computations M. Ciccotelli," S. Sello," P. Molmaro& " CISE Innovative Technology, Segrate, Italy Abstract The aim of this paper is to present a new
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationMIT (Spring 2014)
18.311 MIT (Spring 014) Rodolfo R. Rosales May 6, 014. Problem Set # 08. Due: Last day of lectures. IMPORTANT: Turn in the regular and the special problems stapled in two SEPARATE packages. Print your
More informationInitial and Boundary Conditions
Initial and Boundary Conditions Initial- and boundary conditions are needed For a steady problems correct initial conditions is important to reduce computational time and reach convergence Boundary conditions
More information