Solution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume Method

Similar documents
SOE3213/4: CFD Lecture 3

Heat and Mass Transfer over Cooled Horizontal Tubes 333 x-component of the velocity: y2 u = g sin x y : (4) r 2 The y-component of the velocity eld is

Project 4: Navier-Stokes Solution to Driven Cavity and Channel Flow Conditions

Numerical Solution Techniques in Mechanical and Aerospace Engineering

Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr

A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY

Solution Methods. Steady State Diffusion Equation. Lecture 04

Chapter 6. Finite Element Method. Literature: (tiny selection from an enormous number of publications)

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Lecture 18 Classical Iterative Methods

Module 2: Introduction to Finite Volume Method Lecture 14: The Lecture deals with: The Basic Technique. Objectives_template

FINITE-VOLUME SOLUTION OF DIFFUSION EQUATION AND APPLICATION TO MODEL PROBLEMS

CHAPTER 7 NUMERICAL MODELLING OF A SPIRAL HEAT EXCHANGER USING CFD TECHNIQUE

Introduction to Heat and Mass Transfer. Week 7

Rening the submesh strategy in the two-level nite element method: application to the advection diusion equation

Part I. Discrete Models. Part I: Discrete Models. Scientific Computing I. Motivation: Heat Transfer. A Wiremesh Model (2) A Wiremesh Model

Motivation: Sparse matrices and numerical PDE's

Waveform Relaxation Method with Toeplitz. Operator Splitting. Sigitas Keras. August Department of Applied Mathematics and Theoretical Physics

Solving Large Nonlinear Sparse Systems

Poisson Equation in 2D

Crouzeix-Velte Decompositions and the Stokes Problem

ME Computational Fluid Mechanics Lecture 5

SOE3213/4: CFD Lecture 1

Multigrid Approaches to Non-linear Diffusion Problems on Unstructured Meshes

Solving Linear Systems

4. Higher Order Linear DEs

ADDITIVE SCHWARZ FOR SCHUR COMPLEMENT 305 the parallel implementation of both preconditioners on distributed memory platforms, and compare their perfo

FINITE VOLUME METHOD: BASIC PRINCIPLES AND EXAMPLES

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs

DOING PHYSICS WITH MATLAB. ELECTRIC FIELD AND ELECTRIC POTENTIAL: POISSON S and LAPLACES S EQUATIONS

This section develops numerically and analytically the geometric optimisation of

Vorticity and Potential Vorticity

AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)

A Comparison of Solving the Poisson Equation Using Several Numerical Methods in Matlab and Octave on the Cluster maya

Applied CFD Project 1. Christopher Light MAE 598

Chapter 7 Iterative Techniques in Matrix Algebra

Introduction to Computational Fluid Dynamics

BOUNDARY CONDITION IDENTIFICATION BY SOLVING CHARACTERISTIC EQUATIONS

Application of turbulence. models to high-lift airfoils. By Georgi Kalitzin

Structure preserving preconditioner for the incompressible Navier-Stokes equations

NME=952=R Mallikarjun=Venkatachala=BG

Partial Differential Equations

4.8 Arnoldi Iteration, Krylov Subspaces and GMRES

DELFT UNIVERSITY OF TECHNOLOGY

2.29 Numerical Fluid Mechanics Spring 2015 Lecture 9

Lab 5: Post Processing and Solving Conduction Problems. Objective:

Numerical Programming I (for CSE)

t x 0.25

5. FVM discretization and Solution Procedure

This chapter focuses on the study of the numerical approximation of threedimensional

Math 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv

Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS

9. Iterative Methods for Large Linear Systems

1e N

Basic Aspects of Discretization

Notes for CS542G (Iterative Solvers for Linear Systems)

1. Fast Iterative Solvers of SLE

The amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.

Stabilization and Acceleration of Algebraic Multigrid Method

VALIDATION OF ACCURACY AND STABILITY OF NUMERICAL SIMULATION FOR 2-D HEAT TRANSFER SYSTEM BY AN ENTROPY PRODUCTION APPROACH

Lab 1: Iterative Methods for Solving Linear Systems

Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method

9.1 Preconditioned Krylov Subspace Methods

Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White

Splitting of Expanded Tridiagonal Matrices. Seongjai Kim. Abstract. The article addresses a regular splitting of tridiagonal matrices.

Preface to the Second Edition. Preface to the First Edition

f(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract

Solving PDEs with Multigrid Methods p.1

Numerical Solution for Two Dimensional Laplace Equation with Dirichlet Boundary Conditions

Algebraic Multigrid as Solvers and as Preconditioner

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix

Iterative Methods for Problems in Computational Fluid. Howard C. Elman. University of Maryland. David J. Silvester. University of Manchester

On A Comparison of Numerical Solution Methods for General Transport Equation on Cylindrical Coordinates

Lecture 10b: iterative and direct linear solvers

Finite Difference Method for PDE. Y V S S Sanyasiraju Professor, Department of Mathematics IIT Madras, Chennai 36

Conjugate Gradient algorithm. Storage: fixed, independent of number of steps.

Computation Time Assessment of a Galerkin Finite Volume Method (GFVM) for Solving Time Solid Mechanics Problems under Dynamic Loads

Monte carlo methods for the solution of ODE's and PDE's

Boundary-Layer Transition. and. NASA Langley Research Center, Hampton, VA Abstract

Consider the following example of a linear system:

Parallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1

Introduction to Heat and Mass Transfer. Week 9

Anisotropic grid-based formulas. for subgrid-scale models. By G.-H. Cottet 1 AND A. A. Wray

Iterative Methods for Solving A x = b

Key words. conjugate gradients, normwise backward error, incremental norm estimation.

PDE Solvers for Fluid Flow

SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA

3.0 FINITE ELEMENT MODEL

Heat and mass transfer by natural convection around a hot body in a rectangular cavity

Liliana Borcea, and George C. Papanicolaou y. October 2, Abstract. We show that the eective complex impedance of materials with conductivity and

Robust multigrid methods for nonsmooth coecient elliptic linear systems

Comparing 2-D Conduction Experiments with Simulation

Centro de Processamento de Dados, Universidade Federal do Rio Grande do Sul,

Multiphysics Modeling

Minimum and maximum values *

Acknowledgments I would like to acknowledge with gratitude various support received from the faculty members of the Department of Mathematics at the G

K.S. Kang. The multigrid method for an elliptic problem on a rectangular domain with an internal conductiong structure and an inner empty space

The Conjugate Gradient Method

Background. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58

Transcription:

Ninth International Conference on Computational Fluid Dynamics (ICCFD9), Istanbul, Turkey, July 11-15, 2016 ICCFD9-0113 Solution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume Method Rico Morasata 1, Kür³ad Melih Güleren 2 1 Faculty of Aeronautics and Astronautics,University of Turkish Aeronautical Association, Ankara, Turkey 2 Faculty of Aeronautics and Astronautics, Anadolu University, Eski³ehir, Turkey Corresponding author: kmguleren@anadolu.edu.tr Abstract: This project aims to solve a two-dimensional steady-state diusion problem by means of a home-made Finite Volume Method (FVM) code. This project solves the two-dimensional steady-state heat conduction equation over a plate whose bottom comprises dierent-sized ns in order to investigate the temperature distribution within a non-uniform rectangular domain. The plate is subject to constant temperatures at its edges. A code was developed to implement the FVM and obtain the temperature distribution over the domain. The code is structured according to the main CFD analysis steps: pre-processing, solution of equations, and post-processing. The set of equations were solved using the iterative Conjugate Gradient Method (CGM). Moreover, the problem was analyzed in ANSYS FLUENT R and the outputs of the two methods are compared. Keywords: FVM, CFD, steady-state heat conduction, PDE, CGM, ANSYS FLUENT R. 1 Introduction Heat transfer is an important problems in many disciplines including science, physics, and engineering. Various numerical techniques have been developed in order to solve and simulate real-world heat transfer problems, among which the FVM. In this project, the FVM is implemented to compute the temperature distribution over a plate, nned at its bottom edge, and subject to prescribed boundary temperatures. A home-made code was developed to implement the numerical technique. The system of equations arising from the discretization of the governing equation is solved iteratively by means of the CGM. The obtained temperature distribution is then compared with the output of a commercial code, ANSYS FLUENT R, and a comparative analysis of the two solutions will be presented. 2 Problem Statement The governing transport equation for a two-dimensional steady-state diusion problem is given by: ( Γ ) + ( Γ ) + S Φ = 0 (2.1) where x, y are the space dimensions, Γ is the diusion coecient, Φ is the diusive ux, and S Φ is a source term [2]. For the special case of steady-state heat conduction without volumetric heat generation, and the diusive ux is the temperature T, (2.1) has the following form: ( k T ) + ( k T where k is the material thermal conductivity. The geometry of the problem is shown in the following gure: ) = 0 (2.2) 1

Figure 1: Plate Geometry and Dimensions The temperatures at the edges are as follows: T top = 500 C, T left = 400 C, T right = 300 C, T bottom = 200 C. 3 Solution Approach 3.1 Governing equation Since the material has a constant thermal conductivity k = 1000 W/(m.K), (2.2) can be rewritten as: 2 T = 2 T 2 + 2 T 2 = 0 (3.1) The above equation is the two-dimensional Laplace's equation to be solved for the temperature eld. (3.1) is a linear, homogeneous, elliptic partial dierential equation (PDE) governing an equilibrium problem, i.e., steady-state heat conduction, within a closed domain. 3.2 The Finite Volume Method (FVM) The following assumptions are made to ensure the two-dimensionality of the problem: The plate has a uniform thickness. There is no heat transfer through the thickness. The fundamental step in the FVM is the integration of the transport equation (2.1) over a control volume. The domain is discretized into cells or control volumes as shown in Figure 2 to approximate the dierential equation. The values of the desired properties are evaluated at the center of the control volume. 2

Figure 2: Domain Discretization The integration of (2.1) over a control volume yields: ( Γ ) ( dx.dy + Γ ) dx.dy + V V V S Φ dv = 0 (3.2) In this case, the grid is uniform so all the cell faces have the same area A. The integrated form of the above equation is: [ ( ) ( ) ] [ ( ) ( ) ] Γ e A e Γ w A w + Γ n A n Γ s A s + S V = 0 (3.3) e w n s where the subscripts e, w, n, and s denote East, West, North, and South respectively. The uxes through the cell faces are approximated by a rst-order nite dierence formulation as follows: Γ w A w ( ) w = Γ w A w (Φ P Φ W ) δx W P (3.4) Γ e A e ( ) e = Γ e A e (Φ E Φ P ) δx P E (3.5) Γ s A s ( ) s = Γ s A s (Φ P Φ S ) δy SP (3.6) Γ n A n ( ) n = Γ n A n (Φ N Φ P ) δy P N (3.7) where P denotes the center of the control volume at which the property Φ is to be evaluated, and δx W P denotes the distance between the west face and the cell center. Substituting the obtained relations into (3.3) yields: Γ e A e (Φ E Φ P ) δx P E Γ w A w (Φ P Φ W ) δx W P + Γ n A n (Φ N Φ P ) δy P N Γ s A s (Φ P Φ S ) δy SP + S V = 0 (3.8) The domain is discretized into square cells of side length dx and dy with dy = dx. Since, for the case at hand, the source term is absent, i.e, no heat generation by the plate, and that the diusion coecient is k, (3.8) becomes: ka (T E T P ) dx ka (T P T W ) dx + ka (T N T P ) dy ka (T P T S ) dy = 0 (3.9) The above equation represents the discretization of the governing transport equation at the cell centers, within the domain boundaries. The discretization of the temperature gradients in (3.3) requires a special treatment since for the cell adjacent to an edge boundary, its center is located at dx/2 or dy/2 from the boundary in a uniform grid. The discretized domain is shown in the following gure: 3

Figure 3: Meshed Plate The plate was meshed using ANSYS Meshing module. The discretization of the governing equation at an internal node is performed by considering all the surrounding cell centers, as shown in the following gure: Figure 4: Discretization Process The plate is uniformly discretized in a two-dimensional Cartesian coordinate system. Indexing the node of interest by (i, j),the discretization of the governing transport equation for the cell at the bottom left corner is as follows: [T (2, 1) T (1, 1)] x 3.3 System of Equations + [T left T (1, 1)] x/2 + [T (1, 2) T (1, 1)] y + [T bottom T (1, 1)] y/2 The resulting set of algebraic equations can be put into a matrix equation of the form: = 0 (3.10) Ax = b (3.11) 4

where A is the coecient matrix, x is the vector of nodal temperatures, and b is the right-hand-side vector. The coecient matrix A has the following properties: A is square of size N N, N is the number of equations. A is a banded tridiagonal matrix. A is sparse. 4 Numerical Implementation The solution of the matrix equation requires appropriate numerical techniques since A is large and sparse, so as to reduce the computational cost. Matrix equations are chiey solved using direct methods or iterative methods. Direct methods are computationally costly since the number of operations to reach a solution is of the order of N 3, which requires a high amount of storage. In contrast, iterative methods are more advantageous since they require fewer number of operations. Various numerical techniques can be used to solve the matrix equation. Two of these were considered in this project: the Gauss-Seidel method (GSM) and the Conjugate Gradient method. The Gauss-Seidel method This method starts with an initial guess of the solution and uses updated values as soon as these are available. It is commonly used for the solution of linear systems of equations. The Conjugate Gradient Method The CGM belongs to a family of numerical methods referred to as Krylov subspace methods,i.e.,at every iteration step k, the methods searches for a good approximation to the solution of (3.11) from the subspace span{b, Ab, A 2 b,..., A k 1 b} [3]. 4.1 Code Structure The structure of the script is as follows: The user is asked to enter n, the number of divisions along the top edge. The coecient matrix is of size n 2 n 2. For this problem, it is desired to obtain the temperature distribution for n = 100. The edge lengths, problem constants, along with boundary temperatures are dened as constants. A and B are preallocated, B is of size n 2 1. The matrices are lled with the coecients of the discretized equations. The plate was considered as a full square to simplify the problem. The empty cells are assigned constant temperatures so that the desired solution will not be aected. The initial guess vector is dened along with the tolerance, and the maximum number of iterations. The matrix A is checked for symmetry and positive deniteness. If both conditions are satised, the CGM is implemented as the iterative scheme, and the GS otherwise. The solver iterates until the desired tolerance is reached by the residual. The obtained temperature vector is reshaped into a square matrix required for plotting the temperature distribution. The coordinates of the nodes are dened and a grid of the domain is generated and the temperature distribution is then plotted. 5

5 Results and Discussion 5.1 Temperature Distribution The following gure shows the temperature distribution obtained with the developed FVM code and FLUENT R : Figure 5: Temperature Distribution from code (left) and FLUENT R (right) It can be seen that the temperature distribution from the developed code is similar to the one from FLUENT R. 5.2 Quantitative Comparison A comparative analysis of the two solutions was performed by probing the contour plots. The locations of the points were arbitrarily selected and the corresponding temperature values recorded. The FLUENT R results were obtained from CFD-Post. The following table shows the temperature values from the code and ANSYS FLUENT R, at random coordinates. In order to assess the accuracy of the numerical solution, a quantitative comparison was performed by probing random temperature values within the domain in the two solutions. The data are summarized in the following table: Table 1: Probed Data Comparison x (m) y (m) FVM temperature ( C) FLUENT R temperature ( C) Percentage dierence (%) 0.055 0.135 320.108 320.107 3.0 10 4 0.205 0.795 414.92 414.995 2.3 10 2 0.355 0.595 326.84 326.97 4.0 10 2 0.675 0.725 348.33 348.405 2.15 10 2 0.845 0.915 426.006 426.015 2.0 10 5 0.955 0.825 325.244 325.251 2.15 10 3 The table suggests that the developed program yields accurate results, compared to the FLUENT R outputs, as the errors are less than 1%. 5.3 Comparison between Iterative Methods To further assess the performance of the CGM, the solution times of the CGM, the Gauss-Seidel Method, and the Underrelaxation Method are compared: 6

Table 2: Probed Data Comparison Iterative Method Solution Time (sec) CGM 0.570 Gauss-Seidel (ω=1) 163.72 Underrelaxation (ω=0.8) 243.517 It can be said that the CGM has a signicantly fast convergence compared to the other iterative methods considered. 6 Conclusion and Future Work This paper investigated a two-dimensional, steady-state conductive heat transfer problem using numerical method. The latter implements the FVM and the system of equations is solved using the Conjugate Gradient iterative method. The numerical solution was then compared with the solution from ANSYS FLUENT R, and it was observed that the code is highly accurate and the computation time was small. As future work, it is desired to develop a more generic program that can solve dierent types of heat transfer problems. References [1] D. A. Gismalla. Matlab software for iterative methods and algorithms to solve a linear system. IJETR, 2014. [2] W. Malalasekera and H. K. Versteeg., An Introduction to Computational Fluid Dynamics The Finite Volume Method Second Edition. Pearson Education, 2007. [3] S. Sickel, M. C. Yeung, and M. J. Held. A comparison of some iterative methods in scientic computing. 2005. 7