59 views

Uploaded by samtt_29

- Numerical
- Introduction Nm
- TVKB-MEMH-Syllabus
- Solution Manual Numerical Methods in Engineering Practic by amir wadi alkhafaji
- Capa
- KineticsC
- vita
- Course Outline BCS Pabbi
- nspch1
- hw12
- matlab_tutorial_overman.pdf
- Formule
- Cut & Fill
- Numerics Finite Differences
- Numerical Methods Ingles Part 2
- Steam
- Resume
- l105
- lesson 3 chandler woods
- Model Reduction in Chemical Engineering

You are on page 1of 5

3 Numerical Solution by Gauss-Seidel Iteration

**2.6.3 Numerical Solution by Gauss-Seidel Iteration
**

A finite difference solution results in a system of algebraic equations that must be solved simultaneously. In Section 2.6.2, we looked at placing these equations into a matrix equation ( A X = b ) that was solved by a single matrix inversion (or the equivalent mathematical manipulation). The matrix A is large (M N x M N) but sparse and therefore MATLAB can handle it relatively efficiently. However, an alternative technique, Gauss-Seidel iteration, can also be used to approximately solve the system of equations using an iterative technique. The Gauss-Seidel method requires much less memory than the direct matrix solution method and in some cases it may require less computational effort as well. The algebraic equations that are obtained by the numerical model do not need to be placed into a matrix equation form in order to carry out Gauss-Seidel iteration. Rather, the temperature matrix is initially set up using a set of reasonable guess values for the temperature at each node. The finite difference equation that results from an energy balance on each control volume is solved explicitly for the temperature of the node, Ti,j, as a function of the temperatures of the surrounding nodes. Using this set of equations, each node in the matrix Ti,j is calculated in a logical order using the current values of the temperature of the surrounding nodes. The difference between the original and recalculated value of each temperature is computed and the maximum value of this error is recorded for each iteration. The process is repeated (i.e., the Gauss-Seidel process is iterated) until the numerical error associated with the iteration is less than some tolerance (i.e., the iteration is complete). The Gauss-Seidel iteration process is illustrated using the EPL mask problem that was discussed in Section 2.6.2. The finite difference equations that describe the energy balances on the internal nodes were given by Eq. (2-211) and do not change:

k Δy th (Ti−1, j − Ti, j ) + k Δy th (Ti+1, j − Ti, j ) + Δx Δx k Δx th k Δx th (Ti, j −1 − Ti, j ) + Δy (Ti, j +1 − Ti, j ) + Δy ′′ qinc pd Δx Δy = 2 h Δx Δy (Ti , j − T∞ ) for i = 2.. ( M − 1) and j = 2.. ( N − 1)

(E4-1)

The boundary conditions are also the same:

T1, j = Tmh for j = 1..N

(E4-2)

**Tm, j = Tmh for j = 1..N
**

Ti ,1 = Tmh for i = 2.. ( M − 1)

(E4-3) (E4-4)

E4-1

1)=(i-1)*W/(M-1). end DELTAy=W/(N-1). j = ⎣ ⎡ k Δy th ⎤ k Δx th ⎢ 2 Δx + 2 Δy + 2 h Δx Δy ⎥ ⎣ ⎦ for i = 2. T_infinity=20+273. %Setup grid for i=1:M x(i. T_mh=20+273. The header.y. q_dot_flux=5000... they are solved explicitly for the temperature at each node.2. j −1 + Ti . k=150.N) %[]=EPL_Mask_GS % % This function determines the temperature distribution in an EPL_Mask using Gauss-Seidel iteration % % Inputs: % M . The energy balance equations given by Eq. ( N − 1) (E4-6) The solution using Gauss-Seidel iteration is implemented in the MATLAB function EPL_Mask_GS. Biot=h_bar*th/k.T_C]=EPL_Mask_GS(M. h_bar=20. j + Ti +1.E4: Section 2.001.6. for j=1:N y(j.2. j +1 ) ⎥ ⎦ Ti . The boundary conditions given by Eqs.number of nodes in the y-direction (-) %INPUTS W=0. th=0.1)=(j-1)*W/(N-1). and grid setup sections remain the same as they were in the function EPL_Mask that was developed in Section 2. (E4-1) are solved for Ti. % width of membrane (m) % thickness of membrane (m) % incident energy (W/m^2) % conductivity (W/m-K) % mask holder temperature (K) % ambient air temperature (K) % heat transfer coefficient (W/m^2-K) % Biot number The subfunction pd_f also remains the same: E4-2 .6. ( M − 1) and j = 2. input section. j ) + Δy (Ti ..n = Tmh for i = 2.75e-6. (E4-2) through (E4-5) are already in this format.j: ⎡ ⎤ k Δy th k Δx th ′′ ⎢ 2 h Δx Δy T∞ + qinc pd Δx Δy + Δx (Ti −1. ( M − 1) (E4-5) Rather than arranging these equations into the form of a matrix equation.3 Numerical Solution by Gauss-Seidel Iteration Ti .2: function[x. end DELTAx=W/(M-1).number of nodes in the x-direction (-) % N .

1+0. Tmh. end The temperature matrix is initialized with all of its values set equal to the mask structure temperature. end for i=2:(M-1) T(i.W) % [pd]=pd_f(x.N)=T_mh.j)=T_mh. (E4-2) through (E4-5) and do not need to be part of the iteration since they do not depend on the values of the adjacent nodes. is specified in terms of the maximum change in any of the nodal temperatures during the iteration.j)=T_mh. tol=0.y.. the while loop terminates when the value of the variable err. The value of the variable err is initially set to a value that is larger than the tolerance in order to ensure that at least one iteration occurs.6.00001. Therefore.E4: Section 2. change in temperature (K) % initial value of the error . % initialize temperature matrix The temperatures along the boundary are specified by Eqs.pattern density (-) pd=0. is less than the variable tol.x-position (m) % y . T(M. convection or heat flux) must be included within the iteration process.3 Numerical Solution by Gauss-Seidel Iteration function[pd]=pd_f(x. err=999.dimension of mask (m) % Output: % pd .y-position (m) % W .W) % % This sub-function returns the pattern density of the EPL mask % % Inputs: % x . The convergence criteria. while(err>tol) end % stopping criteria – max. T(i.5*x*y/W^2.g. T=ones(M. which is defined as the maximum absolute value in the change between successive iterations.1)=T_mh.y. % boundary conditions for j=1:M T(1. end The iteration must be placed in a while loop so that it continues until the temperature distribution stops changing by more than a specified tolerance between subsequent iterations. tol.set > tol E4-3 .N)*T_mh. note that alternative boundary conditions (e.

j)+T(i+1.j)).15.. th/DELTAx+2*k*DELTAx*th/DELTAy+2*h_bar*DELTAx*DELTAy).E4: Section 2.. if (err>err_max) err_max=err.j-1)+T(i.N).j))/DELTAx+k*DELTAx*th*. The initial temperature of each node is recorded in the scalar variable T_old and the nodal temperature is re-assigned using Eq. is greater than the current value of err_max then err_max is replaced with err. (T(i-1.j). >> N=50. If the local error. % temperature in C Run the function from the command window by entering: >> M=50.j+1))/DELTAy)/(2*k*DELTAy*.. The contour plot is shown in Figure E4-1. % initialize maximum value of the error % internal node energy balances for i=2:(M-1) for j=2:(N-1) T_old=T(i. Use the results to create a filled contour plot by entering >> contourf(x. % compute error between old and new temps. err_max=0.. (T(i..j)=(2*h_bar*DELTAx*DELTAy*T_infinity+q_dot_flux*.W)*DELTAx*DELTAy+k*DELTAy*th*. E4-4 . In this way. err.6.3 Numerical Solution by Gauss-Seidel Iteration Within the while loop. end end end The temperature is converted to degree Celsius: T_C=T-273.T_C]=EPL_Mask_GS(M. The absolute value of the difference between the variable T_old and T(i.y.. the value of the maximum error associated with the iteration (the variable err_max) is set to 0.T_C).y(j). the value of err_max at the conclusion of the iteration will be the maximum change in temperature that occurred during the iteration. err=abs(T_old-T(i. % old value of temperature T(i.. pd_f(x(i)..j) is computed and assigned to the variable err.y. >> [x. (E4-6).

The Gauss-Seidel technique is intuitive and easy to use on large or small problems.6. However. the same convergence criteria may lead to very different results. The direct solution technique presented in Section 2. you should beware that the convergence tolerance must be carefully selected.3 Numerical Solution by Gauss-Seidel Iteration Figure E4-1: Contour plot of temperature distribution obtained using Gauss-Seidel iteration. E4-5 .E4: Section 2. Because the convergence criterion is based on the error between iterations.6.2 is generally preferred over an iterative technique like Gauss-Seidel iteration if a tool such as MATLAB that provides a computationally efficient means of solving sparse matrices is available.

- NumericalUploaded byFarhan
- Introduction NmUploaded byashodhiya14
- TVKB-MEMH-SyllabusUploaded byDavid Victor
- Solution Manual Numerical Methods in Engineering Practic by amir wadi alkhafajiUploaded byمحمد
- CapaUploaded byLuís Henrique
- KineticsCUploaded byMisbaqul Munir
- vitaUploaded bypostscript
- Course Outline BCS PabbiUploaded byHafiz Adnan Iqbal Khan
- nspch1Uploaded byThangadurai Senthil Ram Prabhu
- hw12Uploaded byapi-289065336
- matlab_tutorial_overman.pdfUploaded byNilma Karlla
- FormuleUploaded byErvin
- Cut & FillUploaded byRahulRandy
- Numerics Finite DifferencesUploaded byTareq Dahb
- Numerical Methods Ingles Part 2Uploaded bydampwyamcma
- SteamUploaded bychrissbans
- ResumeUploaded bySaad Omar
- l105Uploaded byhadrian
- lesson 3 chandler woodsUploaded byapi-322216916
- Model Reduction in Chemical EngineeringUploaded byAdilson J. de Assis
- 23a -Newton sUploaded byRini Mulia Sari
- [12] R3MUploaded bysaded05
- Two PhaseUploaded bypartha_007
- Lamb Oseen VortexUploaded byNiaz Hasan
- Semester IV 2017Uploaded byshailesh kumar
- STbook07Uploaded bySamuel Kins
- For Nberg 1980Uploaded byAshnek
- John Wiley E-booksUploaded bydearsaswat
- Numerical Methods OdesUploaded bysemabay
- sgde 0ErrataUploaded byeduardox1

- WorkbookUploaded bykatrina99
- CCP303Uploaded byapi-3849444
- B.tech CS S8 Artificial Intelligence Notes Module 2Uploaded byJisha Shaji
- Integral 1Uploaded byVignesh Mahalingam
- Matlab FundaUploaded bytkpradhan
- Modified Collatz conjecture or (3a + 1) + (3b + 1)I Conjecture for Neutrosophic NumbersUploaded byMia Amalia
- DLL Math Sept 20,2016Uploaded byshe
- Lawrence&Pasternack Chapter03Uploaded byJohanes Gigih
- SummationUploaded byParvinder Kumar
- DR. Parul AgarwalUploaded byAshutoshSharma
- Simulation Modeling WorkshopUploaded byWadeReynes
- MATH 219 Calculators NormalUploaded byHao-Nhien Q. Vu
- pbl5-7Uploaded byapi-245623862
- lesson 2Uploaded byapi-283792958
- pseducodeUploaded byZareena Carrim
- HSC 11 Scalars and Vectors Ch2Uploaded bySnehal Panchal
- Non-Solvable Spaces of Linear Equation SystemsUploaded byDon Hass
- 4024_y04_sw_7Uploaded bymstudy123456
- 035-92mgwl-lbUploaded byal_bong
- uwb.pdfUploaded byHinduja Icchapuram
- Lawvere F W Functorial Semantics of Algebraic Theories PhD Thesis 1963Uploaded byLBrouwer
- OR-Unit1Uploaded byThanga Raja
- 09_chapter2Uploaded bySyEd Mohammed Ifrahim
- Statistical Learning TheoryUploaded byMonica Oliveira
- 0606_y13_sp_1Uploaded bySherlock Wesley Conan
- Reinforcement Learning for Traffic Control System: Study of Exploration Methods using Q-learningUploaded byIRJET Journal
- financialalgebracurriculumguideincompleteUploaded byapi-233242435
- defuzzification-141012012422-conversion-gate02.pdfUploaded byNgaa Siemens
- 9709_w05_qp_2Uploaded byNana_Banana_94
- Crs1_Lessons021-030Uploaded byDong-Ho Gwak