MODELING OF PROCESSES IN POWER INDUSTRY

МОДЕЛИРОВАНИЕ ПРОЦЕССОВ В ЭЛЕКТРОЭНЕРГЕТИКЕ

Masters program: 13.04.02 «Power Engineering and Electrical Engineering»
«Электроэнергетика и электротехника»
Educational profile: «Efficient electric power industry»
«Эффективная электроэнергетика»
(English version)
Учебный план №740-19

Electrotechnology and Converter Engineering Department

Lecture 4

Docent, C.Sc. I. V. Poznyak

 Content of the lecture
1. Basics of the finite difference method
2. Explicit scheme
3. Implicit scheme
4. Task 1
5. Task 2
6. Task 3
7. Task 4
8. Task 5
9. Task 6
10.Literature
 Computational experiment
Computational experiment is an experiment on mathematical model of object at computer, which consists in calculating other
parameters based on one of the model parameters and making conclusions about the properties of the phenomenon described
by the mathematical model.

COMPUTATIONAL EXPERIMENT, an experiment (test, experiment, test) conducted not on the original real object, but on a
mathematical (information, simulation) model of the object using computational and logical procedures performed by
appropriate software on computer systems (computers). Concepts close to C. E. are numerical, mathematical, simulation, and
simulation experiments on computers.
C. E. is the main tool of mathematical modeling that combines the strengths of traditional theoretical and experimental
methods and allows for targeted research of scientific, technical, environmental, and socio-economic problems based on
existing models and software tools. Working not with the object itself (phenomenon, process), but with its model allows you to
study its properties and behavior in any situation relatively quickly, safely, and at no significant cost. At the same time, C. E. on
adequate models makes it possible to study objects in detail and in depth in a sufficient completeness that is not available to
purely theoretical approaches. For example, C. E. with models of high-power electric furnaces (up to 10 MW), they significantly
reduce the number and time of real experiments to study the installation parameters and the distribution of temperature fields
in the load, give a complete quantitative picture of the technological process, taking into account fluctuations in input
parameters; C.E. with models of economic systems are one of the main methods for predicting the dynamics of socio-
economic indicators.
When performing large-scale C. E., two phases are distinguished: debugging, tuning, and calibration of models and programs;
and computer experiments with models as independent objects that replace the original ones.
It is impossible to implement full-scale mathematical modeling without relying on theoretical methods for studying mathematical
(mostly nonlinear) models, and modern achievements in computational mathematics, system and application programming,
and computer science.
 Finite difference method (FDM)
Finite difference method is numerical method for solving differential equations based on replacing derivatives
with difference schemes.
It is a grid method.
The numerical method is an approximate method for solving DE.
The essence of this method is that the desired solution is taken as a table of values at the points of a certain
set, called grid. To determine this table, it has to be solved algebraic equations that approximately replace
the original differential equations.

On original space L, where continuous and doubly

differentiable function is defined, the grid L’ is
superimposed.

The grid (spatial and temporal) is characterized by

nodes (at the vertices of quadrilaterals) and
connections between nodes.
Uniform and non-uniform mesh. Uniform grid – the grid
step is constant. Non-uniform grid - the grid step varies,
usually exponentially with a step of no more than 1.2.
h - the grid step,
hx=Δx - the spatial step,
hу=Δу - spatial step,
τ= Δt - time step.
 Solution of thermal conductivity equation by
FDM method

Boundary value problem:

𝜕𝑇
𝑐𝜌 = 𝜆∆𝑇 + 𝑝 (34)
𝜕𝑡
Boundary conditions:
𝑇гр = 𝑓(𝑥, 𝑦, 𝑧, 𝑡) (35)

𝜕𝑇
−𝜆 = 𝑞гр (𝑥, 𝑦, 𝑧, 𝑡) (36)
𝜕𝑛
Initial conditions:
𝑇ну = 𝑓(𝑥𝑏 , 𝑦𝑏 , 𝑧𝑏 , 𝑡) (37)
 Task
Data: 1. Brick wall thickness 𝐿 = 15 𝑐𝑚,
2. Coefficient of thermal conductivity of
the wall material λ = 1.5 W/(m·K),
(heat capacity с = 1000 J/(kg·K),
density ρ = 2000 kg/𝑚3 .
Temperature conductivity
𝜆
𝑎 = 𝑐𝜌 = 0,75·10−6 𝑚2 /s.
3. Temperature on the inner wall surface
𝑇0 = 25С
𝑇1 = 800С, At the outer 𝑇2 = 300С,
4. Ambient temperature 𝑇0 = 25С
5. Initial wall temperature 𝑇𝑖𝑐 = 25С

To find: 1. Specific heat flow through the wall.

2. Heat transfer coefficient on the outside of
the wall.
3. Heat flow through a section of wall
area 0.5m х 1.0m.
 Heat conduction equation in
one-dimensional approximation

Boundary value problem:

𝜕𝑇 𝑝
= 𝑎∆𝑇 + , (1)
𝜕𝑡 𝑐𝜌
2
𝜕𝑇 𝜕𝑇
=𝑎 2, (2)
𝜕𝑡 𝜕𝑥

Boundary conditions:
𝑇1 = 800𝐶 (3)

𝑇2 = 300𝐶 (4)

Initial conditions:
𝑇𝑖𝑐 = 25𝐶 (5)
The piecewise-linear approximation
2
𝜕𝑇 𝜕𝑇
=𝑎 2, (6)
𝜕𝑡 𝜕𝑥
2
f2 𝜕𝑇
2 =?
(7)
𝜕𝑥
f1
𝜕𝑇 ∆𝑇
≈ , (8)
𝜕𝑥 ∆𝑥
∆𝑇 = 𝑇𝑚 − 𝑇𝑚−1 , (9)
∆𝑥 = 𝑥𝑚 − 𝑥𝑚−1 , (10)

ℎ = 𝑥𝑚 − 𝑥𝑚−1 , (11)

∆𝑇 𝑇𝑚 − 𝑇𝑚−1
f1= = (12)
∆𝑥 h
2
𝜕𝑇 𝜕 𝜕𝑇 𝜕 ∆𝑇 ∆ ∆𝑇 ∆𝑓 𝑓2−𝑓1
2 = 𝜕𝑥 ≈ 𝜕𝑥 ≈ ∆𝑥 =∆𝑥 = (13)
𝜕𝑥 𝜕𝑥 ∆𝑥 ∆𝑥 ∆𝑥

∆𝑇 𝑇𝑘 −𝑇𝑚
f2=∆𝑥 = (12a)
h
The piecewise-linear approximation
∆ ∆𝑇 ∆ 𝑇𝑚 − 𝑇𝑚−1
= (14)
∆𝑥 ∆𝑥 ∆𝑥 h
∆ ∆𝑇 ∆ 𝑇𝑚+1 − 𝑇𝑚
= (15)
∆𝑥 ∆𝑥 ∆𝑥 h

𝑇𝑚 − 𝑇𝑚−1
𝑓1 = (16)
h
𝑇𝑚+1 − 𝑇𝑚
𝑓2 = (17)
h
∆ ∆𝑇 𝑓2 − 𝑓1
= (18)
∆𝑥 ∆𝑥 ∆𝑥
𝑓2 − 𝑓1 𝑇𝑚+1 − 𝑇𝑚 𝑇𝑚 − 𝑇𝑚−1
= − (19)
∆𝑥 ℎ2 ℎ2
∆ ∆𝑇 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1
= (20)
∆𝑥 ∆𝑥 ℎ2
The piecewise-linear approximation

2
𝜕𝑇 𝜕𝑇
=𝑎 2, (21)
𝜕𝑡 𝜕𝑥
𝜕𝑇 ∆𝑇
≈ , (22)
𝜕𝑡 ∆𝑡
∆𝑇 = 𝑇𝑚 − 𝑇𝑚−1 , (23)
τ = 𝑇𝑚 − 𝑇𝑚−1 , (24)
∆𝑇 𝑇𝑚 − 𝑇𝑚−1
= (25)
∆𝑡 τ

𝑇𝑚 − 𝑇𝑚−1 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1

=𝑎 (26)
τ ℎ2

𝑇𝑚 − 𝑇𝑚 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1

=𝑎 (27)
τ ℎ2
The piecewise-linear approximation

𝑇𝑚 − 𝑇𝑚 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1

=𝑎 (28)
τ ℎ2

𝑗+1 𝑗
𝑇 −𝑇 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1
𝑚 𝑚
=𝑎 (29)
τ ℎ2
The piecewise-linear approximation

𝑗+1 𝑗
𝑇 −𝑇 𝑇𝑚−1 − 2𝑇𝑚 + 𝑇𝑚+1
𝑚 𝑚
=𝑎 (30)
τ ℎ2
𝑗+1 𝑗
𝑇 −𝑇
𝑚 𝑚
τ (31)
𝑗 𝑗 𝑗
𝑇 − 2𝑇 +𝑇
𝑚−1 𝑚 𝑚+1
=𝑎
ℎ2
𝑗+1 𝑗 𝑗+1 𝑗+1 𝑗+1
𝑇 −𝑇 𝑇 − 2𝑇 +𝑇
𝑚 𝑚
=𝑎 𝑚−1 𝑚 𝑚+1 (32)
τ ℎ2
 The piecewise-linear approximation
Explicit scheme :

𝑗+1 𝑗 𝑗 𝑗 𝑗
𝑇 −𝑇 𝑇 − 2𝑇 +𝑇
𝑚 𝑚
=𝑎 𝑚−1 𝑚 𝑚+1 (33)
τ ℎ2
𝑗 𝑗 𝑗
𝑇 𝑚−1 − 2𝑇 𝑚 + 𝑇 𝑚+1
𝑇
𝑗+1
=𝑇
𝑗
+ 𝑎τ (34)
𝑚 𝑚 ℎ2
𝑗+1 𝑗
𝑇 =𝑇 + ∆𝑇 (35)
𝑚 𝑚
 Tasks 1, 2
Explicit scheme :
𝑗 𝑗 𝑗
𝑇 − 2𝑇 +𝑇
𝑇
𝑗+1
=𝑇
𝑗
+ 𝑎τ 𝑚−1 𝑚 𝑚+1 (36)
𝑚 𝑚 ℎ2
Number of grid nodes 𝑁 = 6
Number of grid steps 𝑁 − 1 =5 𝐿 = 15 𝑐𝑚
Grid step ℎ = 𝐿 / (𝑁 − 1) = 15/5= 3 см
𝜆
𝑇1 = 800С 𝑇6 = 300С 𝑇𝑖𝑠 = 25С 𝑎= = 0,75·10−6 𝑚2 /s
𝑐𝜌

Task 1a. For time step τ=0,02s and for heating time of the wall t=0,2s, number of
time steps 𝐻 = 𝑡/τ=0,2/0,02=10, to find temperatures at grid nodes for all time
steps.
Task 1b. For time step τ=0,2s and for heating time of the wall t=0,4s, number of time
steps 𝐻 = 𝑡/τ=0,4/0,2=2, to find temperatures at grid nodes for all time steps.

Task 2. Find the temperature values in the grid nodes for the data from task 1a и 1b
using an approximation expression based on an implicit scheme (37):
𝑗+1 𝑗 𝑗+1 𝑗+1 𝑗+1
𝑇 −𝑇 𝑇 − 2𝑇 +𝑇
𝑚 𝑚
=𝑎 𝑚−1 𝑚 𝑚+1 (37)
τ ℎ2
 Task 3

Task 3a. Write approximation expressions for one-dimensional heat equation for
template (scheme) г:

Task 3b. For time step τ=0,02s and for heating time of the wall t=0,2s, number of time
steps 𝐻 = 𝑡/τ=0,2/0,02=10, to find temperatures at grid nodes for all time steps using
г: scheme.
 Tasks 4, 5
Explicit scheme :
𝑗 𝑗 𝑗
𝑇 − 2𝑇 +𝑇
𝑇
𝑗+1
=𝑇
𝑗
+ 𝑎τ 𝑚−1 𝑚 𝑚+1 (36)
𝑚 𝑚 ℎ2
Number of grid nodes 𝑁 = 6 𝐿 = 15 𝑐𝑚
Number of grid steps 𝑁 − 1 =5
Grid step ℎ = 𝐿 / (𝑁 − 1) = 15/5= 3 см
𝜕𝑇 ∆𝑇 𝜆
𝑇1 = 800С; at point 𝑇6 = 0 or = 0; 𝑇𝑖𝑠 = 25С; 𝑎 = 𝑐𝜌 = 0,75·10−6 𝑚2 /s.
𝜕𝑥 ∆𝑥

Task 4a. For time step τ=0,02s and for heating time of the wall t=0,2s, number of
time steps 𝐻 = 𝑡/τ=0,2/0,02=10, to find temperatures at grid nodes for all time
steps.
Task 4b. For time step τ=0,2s and for heating time of the wall t=0,4s, number of time
steps 𝐻 = 𝑡/τ=0,4/0,2=2, to find temperatures at grid nodes for all time steps.

Task 5. Find the temperature values in the grid nodes for the data from task 4a и 4b
using an approximation expression based on an implicit scheme (37):
𝑗+1 𝑗 𝑗+1 𝑗+1 𝑗+1
𝑇 −𝑇 𝑇 − 2𝑇 +𝑇
𝑚 𝑚
=𝑎 𝑚−1 𝑚 𝑚+1 (37)
τ ℎ2
 Task 6

Task 6a. Write approximation expressions for one-dimensional heat equation for
template (scheme) г:

Task 6b. For time step τ=0,02s and for heating time of the wall t=0,2s, number of time
steps 𝐻 = 𝑡/τ=0,2/0,02=10, to find temperatures at grid nodes for all time steps using
г: scheme.
 Literature

1. Бахвалов Н. С., Жидков Н. П., Кобельков Г. М. Численные методы. 

М.: БИНОМ, 2006.
2. Вержбицкий В. М. Численные методы.  М.: ОНИКС 21 век, 2005.
3. Костомаров Д. П., Фаворский А. П. Вводные лекции по численные
методам.  М.: Логос, 2004.
4. Киреев В. И., Пантелеев А. В. Численные методы в примерах и
задачах.  М.: Высшая школа, 2004.
5. Бахвалов Н. С., Лапин А. В., Чижонков Е. В. Численные методы в
задачах и упражнениях.  М.: Высшая школа, 2000.