Professional Documents
Culture Documents
• At x=0, T=T2 • The above equation is possible if and only if each function is
• x=a, T=T1 equivalent to a constant
• y=0, T=T1 • Assuming this constant to be λ2, we then have
• y=b, T=f(x)
1. λ2 is Positive
• The controlling differential equation for two dimensional heat and
transfer with no heat generation and constant K is
• The partial differential equation is reduced to two ordinary
differential equation and the solutions to these equation will be:
• The above equation can be solved using the product method
assuming that the solution is T=x.y where x=f(x) and y=f(y) only. • Then
3/16/2016 5 3/16/2016 6
3/16/2016 9 3/16/2016 10
• Substituting equations • We can also devise a finite difference scheme to take the heat
generation in to account
+ +
• Proceeding in a similar manner
• for ∆x= ∆y,
• If ∆x = ∆y, the smaller the ∆x, the smaller the error, and thus the
more accurate the approximation, then
3/16/2016 11 3/16/2016 12
Numerical Method Numerical Method
Energy Balance Interior Nodes
• Another method to drive the finite difference equations is using the • Consider an interior node as shown
principle of conservation of energy.
• Since the actual direction of heat flow (in to or out of the node) is • For two-dimensional, heat exchange is
often unknown it is convenient to formulate the energy balance by influenced by conduction between node
assuming that all the heat flow is in to the node. m,n and the adjoining nodes
• For steady-state conduction with generation the appropriate form of • Now the previous equation reduces to:
equation is then:
3/16/2016 13 3/16/2016 14
The term ∆y.1 is the heat transfer area
3/16/2016 15 3/16/2016 16
Numerical Method Summary
• Conduction in the region m,n are also influenced by convective
exchange with the fluid. The total heat convicted will be:
• Now, neglecting the heat generated and summing all the equations,
the finite difference equation for such node will be:
3/16/2016 17 3/16/2016 18
3/16/2016 19 3/16/2016 20
Finite Difference Solution Techniques Finite Difference Solution Techniques
The Gauss-Seidel iteration Method
• The coefficient matrix A is square (N*N), and its elements are
• This is a powerful and extremely popular iteration technique when
designated by a double subscript notation
the number of nodes are very large.
• Thus, the solution vector will be
• This method has the following procedures
• Where is the inverse of and is defined as:
1. To whatever extent possible, the equations should be recorded
to provide diagonal elements whose magnitude are larger than
those of other elements in the same row.
2. After recording, each of the N equation should be written in
explicit form for the temperature associated with its diagonal
element. Each temperature in the solution vector would then be
Solving,
of the form: ( k ) Ci i −1 aij ( k ) N aij
( k −1)
Ti = −∑ Tj − ∑ Tj
aii j =1 aii j = i +1 aii
.
. Where, j=1 to N, K refers the value of iteration
3/16/2016 21 3/16/2016 22
3/16/2016 23 3/16/2016 24
Thank you
3/16/2016 25