# Two-Dimensional Steady-State Boundary Shape Inversion of CGM-SPSO Algorithm on Temperature Information

Authors: Shoubin Wang; Huangchao Jia; Xiaogang Sun; Li Zhang
Journal: Advances in Materials Science and Engineering
 (2017)

---

## Abstract

Addressing the problem of two-dimensional steady-state thermal boundary recognition, a hybrid algorithm of conjugate gradient method and social particle swarm optimization (CGM-SPSO) algorithm is proposed. The global search ability of particle swarm optimization algorithm and local search ability of gradient algorithm are effectively combined, which overcomes the shortcoming that the conjugate gradient method tends to converge to the local solution and relies heavily on the initial approximation of the iterative process. The hybrid algorithm also avoids the problem that the particle swarm optimization algorithm requires a large number of iterative steps and a lot of time. The experimental results show that the proposed algorithm is feasible and effective in solving the problem of two-dimensional steady-state thermal boundary shape.


---

## Body

## 1. Introduction

As a branch of the inverse problem of heat transfer, inverse geometrical problem [1] of heat conduction has a broad application prospect in industrial equipment testing, nondestructive testing [2], geometry optimization [3], biological lesions [4], and other fields. Two-dimensional steady-state space is first discretized in inverse geometrical boundary of the heat transfer system, and discretization methods mainly include finite difference method [5] (FDM) and finite element method [6] (FEM) and boundary element method [7] (BEM), which can be used for solving heat transfer problems, inverting the geometric boundary through various optimization techniques on the basis of solving the forward problem. Inversion methods based on optimization techniques can be divided into gradient-based optimization algorithms and nongradient optimization algorithms. Gradient optimization algorithm mainly includes the conjugate gradient method [8] (CGM), Levenberg-Marquardt method [9] (L-MM) and the steepest descent method [9] (SDM), and nongradient optimization algorithm mainly includes genetic algorithm [10] (GA), neural network algorithm [11] (NNM), particle swarm optimization (PSO) [12], and so forth.CGM, L-MM, SDM, and other gradient-based optimization algorithms are the main algorithms to study the inverse problem of heat transfer and are applied to the study of geometric inverse problems of heat transfer. Carey et al. [13] studied the parallel conjugate gradient solution of the sparse system produced by the least squares combined finite element method, which showed that the algorithm was suitable for convection diffusion equation and fixed Navier-Stokes equations. Tarzanagh et al. [14] proposed a new derivative-free preconditioned conjugate gradient method to solve large-scale square and undetermined nonlinear equations. The numerical results of this method for some square and undervalued test systems showed the efficiency and effectiveness, and new application was also provided for solving nonlinear differential equations.Sellami and Chaib [15] proposed a new conjugate gradient method for unconstrained optimization, which included two existing nonlinear conjugate gradient methods that have a decrease in each iteration search direction and global convergence. Huang and Chao [16] used BEM and CGM to study the geometrical problems of heat transfer. The problem of dynamic identification of irregular boundary shape in two-dimensional multiconnected region and the identification of irregular geometric boundary with time in two-dimensional unsteady heat conduction problem were studied. BEM and CGM were used to optimize the shape of linear and nonlinear fins. The fin shape was designed according to the specific rib efficiency under the condition of certain volume of fins. The results confirmed efficiency of CGM in the equipment shape optimization.Bin and LinHua [17, 18] used BEM and CGM to study the geometrical shape of the inner wall of the two-dimensional cylinder and discussed the influence of the initial stochastic value, the measurement information error, and the number of measuring points on the inversion results of the inner wall shape. Fan et al. [19] used FEM and CGM to invert the internal defects of the two-dimensional pipeline and discussed the effects of initial values and measurement errors on the inversion results. Tanweer et al. [20] proposed the problem of self-regulating particle swarm optimization (SRPSO), which achieves faster convergence and provides better solutions. Hong et al. [21–24] optimized the PSO algorithm, which can search for more simultaneous solutions and make it possible to give an unbiased estimate that provides a better way to find the global optimal solution in search space. Yuan et al. [25] introduced the improved algorithm of genetic algorithm, particle swarm optimization in two-dimensional steady-state thermal boundary problem.CGM [26] is currently used in a more extensive inversion algorithm, which has been used in the inverse problem of heat transfer. However, gradient-based optimization algorithm belongs to the local search algorithm, which is easy to fall into the local extreme value. The inversion result has serious dependencies on the initial guess of the geometric boundary. More importantly, since the inverse problem of heat transfer, including the geometric inverse problem of heat transfer, is a typical ill-posed problem, when the temperature measurement information is not complete or there is a large measurement error, the inversion results obtained based on the gradient optimization method may deteriorate. In addition, when the geometric shapes to be inverted are more complex or the number of inversion points is larger, the calculation of the gradient matrix is time-consuming and difficult, which directly affects the engineering application of the gradient optimization method.PSO [27] is an intelligent nongradient optimization algorithm, which is a global search algorithm with good adaptability. However this method is a global search, so the computation is relatively large, and search process is time-consuming, which result in very large restrictions in practical application of geometric inverse problem of heat transfer, especially when the inversion parameters are increased, and the shortcomings of the performance are more serious. In particular, when the measurement information is incomplete or there is a large measurement error, the inversion results obtained according to such intelligent optimization methods will also have some gaps, and the inversion method lacks the necessary antimisalignment.In this paper, a hybrid algorithm combining conjugate gradient method [28, 29] and social particle swarm optimization (CGM-SPSO) algorithm is proposed to solve the problem of boundary shape recognition. In the CGM-SPSO algorithm, particle swarm optimization algorithm is used to obtain the smooth estimation of the shape by using fewer boundary elements. As the initial guess value of the conjugate gradient method, the boundary element is applied in the conjugate gradient method to ensure the accuracy of the solution. In this paper, the influence of the number of inversion parameters on the inversion solution is discussed. The convergence of CGM and SPSO algorithm in CGM-SPSO algorithm is analyzed (see Tables 1 and 2).Table 1
The number of iterations to convergence using SPSO.
Iteration
1
2
3
4
5
6
7
Convergence
0.0325
0.0160
0.0140
0.0140
0.0120
0.0120
0.0120Table 2
The number of iterations to convergence using CGM.
Iteration
1
2
3
4
5
6
7
8
9
10
11
12
Convergence
0.1
0.08
0.068
0.04
0.025
0.015
0.008
0.006
0.005
0.003
0.003
0.003


## 2. Two-Dimensional Steady-State Thermal Conductivity Model and Its Forward Problem

### 2.1. Two-Dimensional Steady-State Thermal Conductivity Model

A two-dimensional nonthermal source-dependent steady-state thermal conductivity model [25] for the detection of inner wall defects in industrial equipment is shown in Figure 1, where region is a two-dimensional space set of x=0.0, x=10.0, y=0, and y=f(x). Here, both sides of x=0.0 and x=10.0 are adiabatic, and a known constant heat flow q0 is passed out by cooling at y=0 so that a constant known temperature T0 is maintained at y=f(x).Figure 1
Physical model of inner wall defect detection of thermal equipment.The temperature distributionYi at y=0 can be measured by infrared scanning thermometer. The purpose is to realize the fault detection of the inner wall of the industrial thermal equipment by reverse deduction of shape f(x) of the inner wall defect. The mathematical model is shown in Figure 1.Thermal equation inΩ region is(1a)∂2T∂x2+∂2T∂y2=0,and whenx=0 and x=10, thermal equation is(1b)∂T∂x=0,and when y=0, thermal equation is(1c)-∂T∂y=q0,and when y=f(x), thermal equation is(1d)T=T0,(1e)Txi,0=Yii=1,2,…,m.This is a two-dimensional steady-state boundary-shaped thermal inversion problem for a known boundary temperature measurement of several boundary points and to solve the unknown boundary shapef(x) of the other boundary. The solution of the inverse problem can be mathematically transformed into the optimal control problem of the following functional variants:(2)Jfx=Ti-Yi2=∑i=1mTix,0-Yix,02,where Yi(x,0) is the temperature value actually measured at the measurement point of the model surface and Ti(x,0) is the temperature value at the measurement point calculated from the above equations according to the guessed boundary shape.The iterative method is used to search for the boundary problem off(x) involving the standard problem of iterative stoppage and temperature measurement error. If no measurement error exists, the stop criterion is(3)Jfk+1x<ε,where ε is a lesser number, such as 0.01, which is determined by the specific convergence. If there is a measurement error and the standard deviation of the temperature measurement is σ, then the minimum criterion is determined according to the error principle.(4)ε=3σ.


### 2.2. Boundary Element Analysis of Two-Dimensional Planar Steady Heat Conduction Problems

Boundary element method (BEM) is a computational method based on the classical integral equation, which absorbs the discrete technique of finite element method. The basic idea of the boundary element method is to use the integral equation method to solve the differential equation. The boundary element method is based on the establishment of the boundary integral equation. The solution process can be divided into two steps: the first step is the boundary of the problem, the Green formula is applied, and the differential equation in the solution domain is transformed into the integral equation on the boundary by the basic solution. The second step is the discretization of the boundary.


#### 2.2.1. Boundary Integral Equations for Mixed Boundary Conditions

Considering the difference of boundary conditions in practical problems, two-dimensional steady-state thermal boundary conditions are taken as examples. As shown in Figure2, boundary element analysis is carried out. Without considering the heat source, the governing equation is the Laplace equation.Figure 2
Mixed boundary conditions.In the Ω area,(5)∇2T=0.On the boundary Γ1,(6)T=T¯.On the boundary Γ2,(7)q=∂T∂n=q′¯.On the boundary Γ3,(8)∂T∂n+hλT=q′′¯.In the above formula: Γ=Γ1+Γ2+Γ3, q′′¯=(h/λ)Tf, and Tf is the ambient temperature.The weighting function is introduced for Laplace’s equation of the above control equationT∗, applying the weighted margin method available:(9)∫Ω∇2TT∗dΩ=∫Γ2∂T∂n-q′¯T∗dΓ+∫Γ3∂T∂n+hλT-q′′¯T∗dΓ-∫Γ1T-T¯∂T∗∂ndΓ.Conducting the second division points and applying Green’s function for (9) available,(10)∫ΩT∗∇2TdΩ=∫Ω∇T∗∇TdΩ-∫Ω∇T·∇T∗dΩ=∫Γ∇T·T∗dΓ-∫Ω∇T·∇T∗dΩ=∫Γ∂T∂n·T∗dΓ-∫Ω∇T·∇T∗dΩ∫Ω∇T·∇T∗dΩ=∫Ω∇T·∇T∗dΩ-∫ΩT·∇2T∗dΩ=∫ΓT·∂T∗∂ndΓ-∫ΩT·∇2T∗dΩ.Substituting equations (10) into equation (9),(11)∫ΩT·∇2T∗dΩ+∫Γ1∂T∂nT∗dΓ+∫Γ2q′¯T∗dΓ+∫Γ3q′′¯T∗dΓ=∫Γ1T¯∂T∗∂ndΓ+∫Γ2T∂T∗∂ndΓ+∫Γ3T∂T∗∂ndΓ+∫Γ3hλTT∗dΓ.Make q=∂T/∂n, and then q∗=∂T∗/∂n, On type (11) consolidation can be obtained:(12)∫ΩT·∇2T∗dΩ+∫ΓqT∗dΓ=∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ.The weight function in (12) is the basic solution of Laplace’s equation, which is (13)∇2T∗+δr-ri=0,where the point “i” represents the point source point, we get formula (13) into formula (12) and use the nature of the function δ, and we can get(14)Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqTdΓ.This is the boundary integral equation for the inner nodes of any point in the Ω domain.Moving the point “i” to the boundary and getting the boundary integral equation at any point on the boundary,(15)12Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqT∗dΓ.Formula (14) and formula (15) can be combined to obtain the boundary integral equation of any point in the domain Ω and, at any point on the boundary,(16)CiTi+∫ΓT·q∗dΓ+∫Γ3hλ·T∗·TdΓ=∫Γq·T∗dΓ,where, in area domain Ω, Ci=1 and, on the border Γ, Ci=1/2.The weight functionT∗ is the fundamental solution of the two-dimensional Laplace equation:(17)T∗=12πln⁡1r.


#### 2.2.2. Boundary Discrete Equations for Mixed Boundary Conditions

Formula (16) is discretized, and the boundary is divided into N units. On each boundary element, T and q can be uniformly interpolated by ordinary unit, linear unit, or quadratic unit according to different interpolation to form matrix:(18)∑j=1NHijTj=∑j=1NGijqj,where(19)HT=Gq.When i=j, then Hii=Ci+H^ii; when i≠j, then Hij=H^ij; and when “j” falls Γ3, then Hij=Hij+(h/λ)·Gij; moving the unknown amount to the right and moving the known amount to the left,(20)AX=F.Solution for the above equations can be obtained in T and q in the unknown amount.


## 2.1. Two-Dimensional Steady-State Thermal Conductivity Model

A two-dimensional nonthermal source-dependent steady-state thermal conductivity model [25] for the detection of inner wall defects in industrial equipment is shown in Figure 1, where region is a two-dimensional space set of x=0.0, x=10.0, y=0, and y=f(x). Here, both sides of x=0.0 and x=10.0 are adiabatic, and a known constant heat flow q0 is passed out by cooling at y=0 so that a constant known temperature T0 is maintained at y=f(x).Figure 1
Physical model of inner wall defect detection of thermal equipment.The temperature distributionYi at y=0 can be measured by infrared scanning thermometer. The purpose is to realize the fault detection of the inner wall of the industrial thermal equipment by reverse deduction of shape f(x) of the inner wall defect. The mathematical model is shown in Figure 1.Thermal equation inΩ region is(1a)∂2T∂x2+∂2T∂y2=0,and whenx=0 and x=10, thermal equation is(1b)∂T∂x=0,and when y=0, thermal equation is(1c)-∂T∂y=q0,and when y=f(x), thermal equation is(1d)T=T0,(1e)Txi,0=Yii=1,2,…,m.This is a two-dimensional steady-state boundary-shaped thermal inversion problem for a known boundary temperature measurement of several boundary points and to solve the unknown boundary shapef(x) of the other boundary. The solution of the inverse problem can be mathematically transformed into the optimal control problem of the following functional variants:(2)Jfx=Ti-Yi2=∑i=1mTix,0-Yix,02,where Yi(x,0) is the temperature value actually measured at the measurement point of the model surface and Ti(x,0) is the temperature value at the measurement point calculated from the above equations according to the guessed boundary shape.The iterative method is used to search for the boundary problem off(x) involving the standard problem of iterative stoppage and temperature measurement error. If no measurement error exists, the stop criterion is(3)Jfk+1x<ε,where ε is a lesser number, such as 0.01, which is determined by the specific convergence. If there is a measurement error and the standard deviation of the temperature measurement is σ, then the minimum criterion is determined according to the error principle.(4)ε=3σ.


## 2.2. Boundary Element Analysis of Two-Dimensional Planar Steady Heat Conduction Problems

Boundary element method (BEM) is a computational method based on the classical integral equation, which absorbs the discrete technique of finite element method. The basic idea of the boundary element method is to use the integral equation method to solve the differential equation. The boundary element method is based on the establishment of the boundary integral equation. The solution process can be divided into two steps: the first step is the boundary of the problem, the Green formula is applied, and the differential equation in the solution domain is transformed into the integral equation on the boundary by the basic solution. The second step is the discretization of the boundary.


### 2.2.1. Boundary Integral Equations for Mixed Boundary Conditions

Considering the difference of boundary conditions in practical problems, two-dimensional steady-state thermal boundary conditions are taken as examples. As shown in Figure2, boundary element analysis is carried out. Without considering the heat source, the governing equation is the Laplace equation.Figure 2
Mixed boundary conditions.In the Ω area,(5)∇2T=0.On the boundary Γ1,(6)T=T¯.On the boundary Γ2,(7)q=∂T∂n=q′¯.On the boundary Γ3,(8)∂T∂n+hλT=q′′¯.In the above formula: Γ=Γ1+Γ2+Γ3, q′′¯=(h/λ)Tf, and Tf is the ambient temperature.The weighting function is introduced for Laplace’s equation of the above control equationT∗, applying the weighted margin method available:(9)∫Ω∇2TT∗dΩ=∫Γ2∂T∂n-q′¯T∗dΓ+∫Γ3∂T∂n+hλT-q′′¯T∗dΓ-∫Γ1T-T¯∂T∗∂ndΓ.Conducting the second division points and applying Green’s function for (9) available,(10)∫ΩT∗∇2TdΩ=∫Ω∇T∗∇TdΩ-∫Ω∇T·∇T∗dΩ=∫Γ∇T·T∗dΓ-∫Ω∇T·∇T∗dΩ=∫Γ∂T∂n·T∗dΓ-∫Ω∇T·∇T∗dΩ∫Ω∇T·∇T∗dΩ=∫Ω∇T·∇T∗dΩ-∫ΩT·∇2T∗dΩ=∫ΓT·∂T∗∂ndΓ-∫ΩT·∇2T∗dΩ.Substituting equations (10) into equation (9),(11)∫ΩT·∇2T∗dΩ+∫Γ1∂T∂nT∗dΓ+∫Γ2q′¯T∗dΓ+∫Γ3q′′¯T∗dΓ=∫Γ1T¯∂T∗∂ndΓ+∫Γ2T∂T∗∂ndΓ+∫Γ3T∂T∗∂ndΓ+∫Γ3hλTT∗dΓ.Make q=∂T/∂n, and then q∗=∂T∗/∂n, On type (11) consolidation can be obtained:(12)∫ΩT·∇2T∗dΩ+∫ΓqT∗dΓ=∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ.The weight function in (12) is the basic solution of Laplace’s equation, which is (13)∇2T∗+δr-ri=0,where the point “i” represents the point source point, we get formula (13) into formula (12) and use the nature of the function δ, and we can get(14)Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqTdΓ.This is the boundary integral equation for the inner nodes of any point in the Ω domain.Moving the point “i” to the boundary and getting the boundary integral equation at any point on the boundary,(15)12Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqT∗dΓ.Formula (14) and formula (15) can be combined to obtain the boundary integral equation of any point in the domain Ω and, at any point on the boundary,(16)CiTi+∫ΓT·q∗dΓ+∫Γ3hλ·T∗·TdΓ=∫Γq·T∗dΓ,where, in area domain Ω, Ci=1 and, on the border Γ, Ci=1/2.The weight functionT∗ is the fundamental solution of the two-dimensional Laplace equation:(17)T∗=12πln⁡1r.


### 2.2.2. Boundary Discrete Equations for Mixed Boundary Conditions

Formula (16) is discretized, and the boundary is divided into N units. On each boundary element, T and q can be uniformly interpolated by ordinary unit, linear unit, or quadratic unit according to different interpolation to form matrix:(18)∑j=1NHijTj=∑j=1NGijqj,where(19)HT=Gq.When i=j, then Hii=Ci+H^ii; when i≠j, then Hij=H^ij; and when “j” falls Γ3, then Hij=Hij+(h/λ)·Gij; moving the unknown amount to the right and moving the known amount to the left,(20)AX=F.Solution for the above equations can be obtained in T and q in the unknown amount.


## 2.2.1. Boundary Integral Equations for Mixed Boundary Conditions

Considering the difference of boundary conditions in practical problems, two-dimensional steady-state thermal boundary conditions are taken as examples. As shown in Figure2, boundary element analysis is carried out. Without considering the heat source, the governing equation is the Laplace equation.Figure 2
Mixed boundary conditions.In the Ω area,(5)∇2T=0.On the boundary Γ1,(6)T=T¯.On the boundary Γ2,(7)q=∂T∂n=q′¯.On the boundary Γ3,(8)∂T∂n+hλT=q′′¯.In the above formula: Γ=Γ1+Γ2+Γ3, q′′¯=(h/λ)Tf, and Tf is the ambient temperature.The weighting function is introduced for Laplace’s equation of the above control equationT∗, applying the weighted margin method available:(9)∫Ω∇2TT∗dΩ=∫Γ2∂T∂n-q′¯T∗dΓ+∫Γ3∂T∂n+hλT-q′′¯T∗dΓ-∫Γ1T-T¯∂T∗∂ndΓ.Conducting the second division points and applying Green’s function for (9) available,(10)∫ΩT∗∇2TdΩ=∫Ω∇T∗∇TdΩ-∫Ω∇T·∇T∗dΩ=∫Γ∇T·T∗dΓ-∫Ω∇T·∇T∗dΩ=∫Γ∂T∂n·T∗dΓ-∫Ω∇T·∇T∗dΩ∫Ω∇T·∇T∗dΩ=∫Ω∇T·∇T∗dΩ-∫ΩT·∇2T∗dΩ=∫ΓT·∂T∗∂ndΓ-∫ΩT·∇2T∗dΩ.Substituting equations (10) into equation (9),(11)∫ΩT·∇2T∗dΩ+∫Γ1∂T∂nT∗dΓ+∫Γ2q′¯T∗dΓ+∫Γ3q′′¯T∗dΓ=∫Γ1T¯∂T∗∂ndΓ+∫Γ2T∂T∗∂ndΓ+∫Γ3T∂T∗∂ndΓ+∫Γ3hλTT∗dΓ.Make q=∂T/∂n, and then q∗=∂T∗/∂n, On type (11) consolidation can be obtained:(12)∫ΩT·∇2T∗dΩ+∫ΓqT∗dΓ=∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ.The weight function in (12) is the basic solution of Laplace’s equation, which is (13)∇2T∗+δr-ri=0,where the point “i” represents the point source point, we get formula (13) into formula (12) and use the nature of the function δ, and we can get(14)Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqTdΓ.This is the boundary integral equation for the inner nodes of any point in the Ω domain.Moving the point “i” to the boundary and getting the boundary integral equation at any point on the boundary,(15)12Ti+∫ΓTq∗dΓ+∫Γ3hλTT∗dΓ=∫ΓqT∗dΓ.Formula (14) and formula (15) can be combined to obtain the boundary integral equation of any point in the domain Ω and, at any point on the boundary,(16)CiTi+∫ΓT·q∗dΓ+∫Γ3hλ·T∗·TdΓ=∫Γq·T∗dΓ,where, in area domain Ω, Ci=1 and, on the border Γ, Ci=1/2.The weight functionT∗ is the fundamental solution of the two-dimensional Laplace equation:(17)T∗=12πln⁡1r.


## 2.2.2. Boundary Discrete Equations for Mixed Boundary Conditions

Formula (16) is discretized, and the boundary is divided into N units. On each boundary element, T and q can be uniformly interpolated by ordinary unit, linear unit, or quadratic unit according to different interpolation to form matrix:(18)∑j=1NHijTj=∑j=1NGijqj,where(19)HT=Gq.When i=j, then Hii=Ci+H^ii; when i≠j, then Hij=H^ij; and when “j” falls Γ3, then Hij=Hij+(h/λ)·Gij; moving the unknown amount to the right and moving the known amount to the left,(20)AX=F.Solution for the above equations can be obtained in T and q in the unknown amount.


## 3. Inverse Problem

### 3.1. Improved Particle Swarm Optimization Algorithm

All the individual optimal solutions pbest (best particle) in particle swarm optimization algorithm are connected with the population optimal solution gbest (best group), which is a typical star structure with the center node gbest. In this structure, each individual unconditionally follows the population optimal, so that the individual optimal can easily converge to the population optimal. When the gbest is the local optimal, the particle swarm algorithm will fall into the local optimal. Thus, an improved strategy is proposed named social particle swarm optimization (SPSO). By setting a different harsh threshold for each individual, one determines whether the individual is following other individuals, or is maintaining the current state, or is free to move, in order to maintain the diversity of individuals in the population, to avoid the algorithm precocious and into the local optimum.In the social particle swarm algorithm, the characteristics of social atoms are introduced into the particle swarm algorithm, and each individual is given a skeleton threshold, where the individual with a threshold of 0 means that the movement is not affected by any other individual information, and the threshold with a threshold of nonzero may have different attraction points in the process of population updating to maintain the current state, so the social particle swarm algorithm may have different attraction points in the process of updating the population according to the new attracting point.There are two types of particles in the social particle swarm algorithm: free particles and followers. The free particle is a particle with a threshold of zero, which is not affected by the behavior of other particles and randomly determines the next generation particle position. The follower particle with a nonzero value is affected by the attraction point during the search process. Whether or not to follow the attraction point depends on how many other particles follow. The updating formula of follower particle in SPSO algorithm is(21)vijt+1=wvijt+c1r1pbestijt-xijt+c2r2attractijt-xijt,(22)xijt+1=xij+vijt+1,where the third term in (21) is changed from the standard gbestij in PSO to the attraction point attractij, and it may be different for different particles. When the algorithm is initialized, the individual with the best fitness is selected as the initial attraction point in the particle selection population. As the search progresses, each free particle is likely to become a new attraction point, and if there is a fitness for a free particle that is better than the fitness of all other particles, it becomes a new attraction. Individuals with a threshold of 1 in the particle are first attracted, and then the individual with higher thresholds will also move toward the attraction point, and the individuals whose attraction population does not reach the threshold will remain unchanged.The implementation steps of social particles swarm algorithm are shown as follows.Step 1 (algorithm initialization).
The population sizeN, the largest evolution algebra Gen, acceleration factors c1, c2, and inertia weight w are given in advance. Give each particle a follow threshold, which is taken as an integer in [0, N]. The optimal individual in initial population is set to attraction point.Step 2.
Update the speed and position of the following particles according to (21) and (22), and free particles randomly generate the next generation position.Step 3.
Calculate the fitnessf(xi+1) of all individuals.Step 4.
Update optimal positions pbest of all individuals.Step 5.
If the optimal fitness value of free particle is better than the population optimal fitness value, then update attracting point attraction equal to pbest, which indicates the free individual is more attractive and will attract the individual of getting the threshold. These attractive points that follow the individual will be updated to the optimal position of the free particle individual, and the attraction point of the other unattended individuals will remain unchanged.Step 6.
Repeat Steps2 to 5 until the algorithm termination condition is met.The flow chart of SPSO algorithm is shown in Figure3.Figure 3
SPSO algorithm flow chart.


### 3.2. Conjugate Gradient Method

The conjugate gradient [25] transforms the inverse problem into three problems: direct question, sensitive problem, and concomitant problem. The problem is based on the assumed boundary shape (1d) and other boundary conditions, using the boundary element method to solve (1a)–(1e), then calculating the minimum value of the objective function (2). The circulation mode of conjugate gradient method is(23)fn+1x=fnx-βnpnx,n=0,1,2,…,where βn is the search step of n to n+1 and pn(x) is the search direction:(24)pnx=J′nx+γnpn-1x,where J′n(x) is gradient direction, so the nth search direction pn(x) is the conjugate of gradient direction J′n(x) and search direction pn-1(x) of n-1. γn is conjugate coefficient, which can be calculated by the equation(25)γn=∫x=0LJ′n2dx∫x=0LJ′n-12dx,where γ0=0.


#### 3.2.1. Sensitivity Problem

For the inverse problem of heat transfer, the existence of solutions can be determined from the physical problem; for example, for a transient problem, the temperature distribution has changed, which must be caused by a change in the parameters, such as boundary conditions and geometric conditions. For some individual antirecognition problems, we can also prove the uniqueness of the strict solution. Although the validity of the solution must be judged from the physical problem for most problems, the biggest problem of the inverse problem is that when the temperature distributed measurement results with some error may cause some parameters of the anticalculation results with unpredictable errors. Therefore, in the process of calculation, we must use some technical means to ensure the stability of the results, so as to detect whether an inverse problem calculation method is effective but also to discuss the calculation results on the temperature measurement error sensitivity. So the conjugate gradient needs to solve the problem of sensitivity when solving the inverse problem.The determination of the search step in (23) needs to find out a sensitivity problem called the increment problem. The sensitivity problem refers to the variation of the change amount ΔT(x) of surface temperature T when the boundary shapef(x) has an increment Δf(x), and the formula is(26)∂J∂fT=∂J∂f1,∂J∂f2,…,∂J∂fn.The specific approach is as follows: in the formula (1a)–(1e), T+ΔT replaces the original T, and f(x)+Δf(x) replaces the original f(x). And then subtract the original equations to get the sensitivity problem, so, in the region Ω, the thermal equation is(27a)∂2ΔT∂x2+∂2ΔT∂y2=0.When x=0, the thermal equation is(27b)∂ΔT∂x=0.When x=10, the thermal equation is(27c)∂ΔT∂x=0.When y=0, the thermal equation is(27d)∂ΔT∂y=0.When y=f(x), the thermal equation is(27e)ΔT=Δf∂T∂y.Similarly, the boundary element method is used to discretize the above equations and obtain the temperature increment ΔT. According to formula (2), iteration J(fn+1) of n+1 can be written:(28)Jfn+1=∑i=1mTifn-βnpn-Yi2.Take Taylor expansion Ti(fn-βnpn) and take out two linear terms, and the following equation can be drawn:(29)Jfn+1=∑i=1mTifn-βnΔTipn-Yi2.Seeking derivative for βn and making it zero, the search step is available:(30)βn=∑i=1mTi-YiΔTi∑i=1mΔTi2.


#### 3.2.2. Adjoint Problems

In formula (23), the new boundary shape function fn+1(x) is calculated according to the boundary function fn(x) of the last iteration, and the search direction pn(x) is also needed to be found out. Therefore, the gradient direction J′n(x) is needed to be calculated according to (24), which is the so-called functional derivative problem, known as the adjoint problem. In order to derive the equation of the adjoint direction, we need to multiply the basic control formula (1a) by a Lagrangian operator λ(x,y) (also called adjoint function) and integrate the spatial domain and then add the result to the right of (2). The expression of the function J[f(x)] is as follows:(31)Jfx=∫x=0LT-Y2δx-xidx+∫x=0L∫y=0fxλ∂2T∂x2+∂2T∂y2dydx.With T+ΔT instead of T and f+Δf instead of f, the following are obtained after a series of arrangement:(32)∫abT-Y2dx=∫ab∫0LT-Y2δx-xidxdy.Then(33)ΔJ=Jq+Δq-Jq=∫x=0L2T-YΔTδx-xidx+∫x=0L∫y=0fxλ∂2ΔT∂x2+∂2ΔT∂y2dydx.Make the second distribution equal to integral twice in the right side of (33), and use the boundary conditions of sensitivity problem, then make ΔJ closer to 0, and finally adjoint problems can be as follows.In the regionΩ,(34a)∂2λ∂x2+∂2λ∂y2=0.When x=0,(34b)∂λ∂x=0.When x=10,(34c)∂λ∂x=0.When y=0,(34d)∂λ∂y=-2T-Yδx-xi.When y=f(x),(34e)λ=0.The boundary element method is used to solve the corresponding value of the adjoint function λ(x,y), so that the functional increment is(35)ΔJ=∫0L-∂λ∂y·∂T∂yy=fxΔfxdx.So according to Alifanov’s definition,(36)ΔJ=∫0LJ′xΔfxdx.The derivative of the functional J is(37)J′x=-∂λ∂y·∂T∂yy=fx.The above three problems including the forward problem, the sensitivity problem, and the adjoint problem can be solved, and the following are iterative calculation step of conjugate gradient method:(1)
Select a stochastic initial value of inner wall shape inf(x) to solve the forward problem (1a)–(1e) and calculate the temperature distribution T(x,t) in the domain.(2)
According toTi and Yi determine whether to meet the convergence stop standard (3) J[fk+1(x)]<ε; if satisfied, then stop the iteration; otherwise, calculate the next step.(3)
Solve the adjoint problem (34a)–(34e), and get the adjoint function λ(x).(4)
Calculate the gradientJ′(x).(5)
Calculate the conjugate gradient coefficientγk and the descent direction pk.(6)
MakeΔf(x)=-pk(x) to solve the sensitivity problem (27a)–(27e) to get the temperature increment ΔT(x).(7)
Calculate the search stepβk by formula (30).(8)
Makek=k+1 to calculate the new boundary shapefk(x) and new Ti and go back to step (2).


### 3.3. CGM-SPSO Hybrid Algorithm

CGM is computationally fast, but it usually converges to local optimal solutions and relies heavily on the initial approximation of the iterative process. The SPSO algorithm requires tens of thousands of iterations and a lot of computation time. The fitness function evaluation of a complex problem is very time-consuming, so we propose a hybrid algorithm of CGM and SPSO, whose purpose is to combine global search ability of SPSO and fast convergence ability of CGM. Since CGM needs a smooth and appropriate initial value, it can converge to a very precise solution. Therefore, this paper gets the temperature of the measured pointTT1,T2,…,Ti by the SPSO method when the boundary shape is unknown, and then the value obtained by SPSO is processed by the interpolation calculation to obtain a smooth function as the initial value of CGM.


## 3.1. Improved Particle Swarm Optimization Algorithm

All the individual optimal solutions pbest (best particle) in particle swarm optimization algorithm are connected with the population optimal solution gbest (best group), which is a typical star structure with the center node gbest. In this structure, each individual unconditionally follows the population optimal, so that the individual optimal can easily converge to the population optimal. When the gbest is the local optimal, the particle swarm algorithm will fall into the local optimal. Thus, an improved strategy is proposed named social particle swarm optimization (SPSO). By setting a different harsh threshold for each individual, one determines whether the individual is following other individuals, or is maintaining the current state, or is free to move, in order to maintain the diversity of individuals in the population, to avoid the algorithm precocious and into the local optimum.In the social particle swarm algorithm, the characteristics of social atoms are introduced into the particle swarm algorithm, and each individual is given a skeleton threshold, where the individual with a threshold of 0 means that the movement is not affected by any other individual information, and the threshold with a threshold of nonzero may have different attraction points in the process of population updating to maintain the current state, so the social particle swarm algorithm may have different attraction points in the process of updating the population according to the new attracting point.There are two types of particles in the social particle swarm algorithm: free particles and followers. The free particle is a particle with a threshold of zero, which is not affected by the behavior of other particles and randomly determines the next generation particle position. The follower particle with a nonzero value is affected by the attraction point during the search process. Whether or not to follow the attraction point depends on how many other particles follow. The updating formula of follower particle in SPSO algorithm is(21)vijt+1=wvijt+c1r1pbestijt-xijt+c2r2attractijt-xijt,(22)xijt+1=xij+vijt+1,where the third term in (21) is changed from the standard gbestij in PSO to the attraction point attractij, and it may be different for different particles. When the algorithm is initialized, the individual with the best fitness is selected as the initial attraction point in the particle selection population. As the search progresses, each free particle is likely to become a new attraction point, and if there is a fitness for a free particle that is better than the fitness of all other particles, it becomes a new attraction. Individuals with a threshold of 1 in the particle are first attracted, and then the individual with higher thresholds will also move toward the attraction point, and the individuals whose attraction population does not reach the threshold will remain unchanged.The implementation steps of social particles swarm algorithm are shown as follows.Step 1 (algorithm initialization).
The population sizeN, the largest evolution algebra Gen, acceleration factors c1, c2, and inertia weight w are given in advance. Give each particle a follow threshold, which is taken as an integer in [0, N]. The optimal individual in initial population is set to attraction point.Step 2.
Update the speed and position of the following particles according to (21) and (22), and free particles randomly generate the next generation position.Step 3.
Calculate the fitnessf(xi+1) of all individuals.Step 4.
Update optimal positions pbest of all individuals.Step 5.
If the optimal fitness value of free particle is better than the population optimal fitness value, then update attracting point attraction equal to pbest, which indicates the free individual is more attractive and will attract the individual of getting the threshold. These attractive points that follow the individual will be updated to the optimal position of the free particle individual, and the attraction point of the other unattended individuals will remain unchanged.Step 6.
Repeat Steps2 to 5 until the algorithm termination condition is met.The flow chart of SPSO algorithm is shown in Figure3.Figure 3
SPSO algorithm flow chart.


## 3.2. Conjugate Gradient Method

The conjugate gradient [25] transforms the inverse problem into three problems: direct question, sensitive problem, and concomitant problem. The problem is based on the assumed boundary shape (1d) and other boundary conditions, using the boundary element method to solve (1a)–(1e), then calculating the minimum value of the objective function (2). The circulation mode of conjugate gradient method is(23)fn+1x=fnx-βnpnx,n=0,1,2,…,where βn is the search step of n to n+1 and pn(x) is the search direction:(24)pnx=J′nx+γnpn-1x,where J′n(x) is gradient direction, so the nth search direction pn(x) is the conjugate of gradient direction J′n(x) and search direction pn-1(x) of n-1. γn is conjugate coefficient, which can be calculated by the equation(25)γn=∫x=0LJ′n2dx∫x=0LJ′n-12dx,where γ0=0.


### 3.2.1. Sensitivity Problem

For the inverse problem of heat transfer, the existence of solutions can be determined from the physical problem; for example, for a transient problem, the temperature distribution has changed, which must be caused by a change in the parameters, such as boundary conditions and geometric conditions. For some individual antirecognition problems, we can also prove the uniqueness of the strict solution. Although the validity of the solution must be judged from the physical problem for most problems, the biggest problem of the inverse problem is that when the temperature distributed measurement results with some error may cause some parameters of the anticalculation results with unpredictable errors. Therefore, in the process of calculation, we must use some technical means to ensure the stability of the results, so as to detect whether an inverse problem calculation method is effective but also to discuss the calculation results on the temperature measurement error sensitivity. So the conjugate gradient needs to solve the problem of sensitivity when solving the inverse problem.The determination of the search step in (23) needs to find out a sensitivity problem called the increment problem. The sensitivity problem refers to the variation of the change amount ΔT(x) of surface temperature T when the boundary shapef(x) has an increment Δf(x), and the formula is(26)∂J∂fT=∂J∂f1,∂J∂f2,…,∂J∂fn.The specific approach is as follows: in the formula (1a)–(1e), T+ΔT replaces the original T, and f(x)+Δf(x) replaces the original f(x). And then subtract the original equations to get the sensitivity problem, so, in the region Ω, the thermal equation is(27a)∂2ΔT∂x2+∂2ΔT∂y2=0.When x=0, the thermal equation is(27b)∂ΔT∂x=0.When x=10, the thermal equation is(27c)∂ΔT∂x=0.When y=0, the thermal equation is(27d)∂ΔT∂y=0.When y=f(x), the thermal equation is(27e)ΔT=Δf∂T∂y.Similarly, the boundary element method is used to discretize the above equations and obtain the temperature increment ΔT. According to formula (2), iteration J(fn+1) of n+1 can be written:(28)Jfn+1=∑i=1mTifn-βnpn-Yi2.Take Taylor expansion Ti(fn-βnpn) and take out two linear terms, and the following equation can be drawn:(29)Jfn+1=∑i=1mTifn-βnΔTipn-Yi2.Seeking derivative for βn and making it zero, the search step is available:(30)βn=∑i=1mTi-YiΔTi∑i=1mΔTi2.


### 3.2.2. Adjoint Problems

In formula (23), the new boundary shape function fn+1(x) is calculated according to the boundary function fn(x) of the last iteration, and the search direction pn(x) is also needed to be found out. Therefore, the gradient direction J′n(x) is needed to be calculated according to (24), which is the so-called functional derivative problem, known as the adjoint problem. In order to derive the equation of the adjoint direction, we need to multiply the basic control formula (1a) by a Lagrangian operator λ(x,y) (also called adjoint function) and integrate the spatial domain and then add the result to the right of (2). The expression of the function J[f(x)] is as follows:(31)Jfx=∫x=0LT-Y2δx-xidx+∫x=0L∫y=0fxλ∂2T∂x2+∂2T∂y2dydx.With T+ΔT instead of T and f+Δf instead of f, the following are obtained after a series of arrangement:(32)∫abT-Y2dx=∫ab∫0LT-Y2δx-xidxdy.Then(33)ΔJ=Jq+Δq-Jq=∫x=0L2T-YΔTδx-xidx+∫x=0L∫y=0fxλ∂2ΔT∂x2+∂2ΔT∂y2dydx.Make the second distribution equal to integral twice in the right side of (33), and use the boundary conditions of sensitivity problem, then make ΔJ closer to 0, and finally adjoint problems can be as follows.In the regionΩ,(34a)∂2λ∂x2+∂2λ∂y2=0.When x=0,(34b)∂λ∂x=0.When x=10,(34c)∂λ∂x=0.When y=0,(34d)∂λ∂y=-2T-Yδx-xi.When y=f(x),(34e)λ=0.The boundary element method is used to solve the corresponding value of the adjoint function λ(x,y), so that the functional increment is(35)ΔJ=∫0L-∂λ∂y·∂T∂yy=fxΔfxdx.So according to Alifanov’s definition,(36)ΔJ=∫0LJ′xΔfxdx.The derivative of the functional J is(37)J′x=-∂λ∂y·∂T∂yy=fx.The above three problems including the forward problem, the sensitivity problem, and the adjoint problem can be solved, and the following are iterative calculation step of conjugate gradient method:(1)
Select a stochastic initial value of inner wall shape inf(x) to solve the forward problem (1a)–(1e) and calculate the temperature distribution T(x,t) in the domain.(2)
According toTi and Yi determine whether to meet the convergence stop standard (3) J[fk+1(x)]<ε; if satisfied, then stop the iteration; otherwise, calculate the next step.(3)
Solve the adjoint problem (34a)–(34e), and get the adjoint function λ(x).(4)
Calculate the gradientJ′(x).(5)
Calculate the conjugate gradient coefficientγk and the descent direction pk.(6)
MakeΔf(x)=-pk(x) to solve the sensitivity problem (27a)–(27e) to get the temperature increment ΔT(x).(7)
Calculate the search stepβk by formula (30).(8)
Makek=k+1 to calculate the new boundary shapefk(x) and new Ti and go back to step (2).


## 3.2.1. Sensitivity Problem

For the inverse problem of heat transfer, the existence of solutions can be determined from the physical problem; for example, for a transient problem, the temperature distribution has changed, which must be caused by a change in the parameters, such as boundary conditions and geometric conditions. For some individual antirecognition problems, we can also prove the uniqueness of the strict solution. Although the validity of the solution must be judged from the physical problem for most problems, the biggest problem of the inverse problem is that when the temperature distributed measurement results with some error may cause some parameters of the anticalculation results with unpredictable errors. Therefore, in the process of calculation, we must use some technical means to ensure the stability of the results, so as to detect whether an inverse problem calculation method is effective but also to discuss the calculation results on the temperature measurement error sensitivity. So the conjugate gradient needs to solve the problem of sensitivity when solving the inverse problem.The determination of the search step in (23) needs to find out a sensitivity problem called the increment problem. The sensitivity problem refers to the variation of the change amount ΔT(x) of surface temperature T when the boundary shapef(x) has an increment Δf(x), and the formula is(26)∂J∂fT=∂J∂f1,∂J∂f2,…,∂J∂fn.The specific approach is as follows: in the formula (1a)–(1e), T+ΔT replaces the original T, and f(x)+Δf(x) replaces the original f(x). And then subtract the original equations to get the sensitivity problem, so, in the region Ω, the thermal equation is(27a)∂2ΔT∂x2+∂2ΔT∂y2=0.When x=0, the thermal equation is(27b)∂ΔT∂x=0.When x=10, the thermal equation is(27c)∂ΔT∂x=0.When y=0, the thermal equation is(27d)∂ΔT∂y=0.When y=f(x), the thermal equation is(27e)ΔT=Δf∂T∂y.Similarly, the boundary element method is used to discretize the above equations and obtain the temperature increment ΔT. According to formula (2), iteration J(fn+1) of n+1 can be written:(28)Jfn+1=∑i=1mTifn-βnpn-Yi2.Take Taylor expansion Ti(fn-βnpn) and take out two linear terms, and the following equation can be drawn:(29)Jfn+1=∑i=1mTifn-βnΔTipn-Yi2.Seeking derivative for βn and making it zero, the search step is available:(30)βn=∑i=1mTi-YiΔTi∑i=1mΔTi2.


## 3.2.2. Adjoint Problems

In formula (23), the new boundary shape function fn+1(x) is calculated according to the boundary function fn(x) of the last iteration, and the search direction pn(x) is also needed to be found out. Therefore, the gradient direction J′n(x) is needed to be calculated according to (24), which is the so-called functional derivative problem, known as the adjoint problem. In order to derive the equation of the adjoint direction, we need to multiply the basic control formula (1a) by a Lagrangian operator λ(x,y) (also called adjoint function) and integrate the spatial domain and then add the result to the right of (2). The expression of the function J[f(x)] is as follows:(31)Jfx=∫x=0LT-Y2δx-xidx+∫x=0L∫y=0fxλ∂2T∂x2+∂2T∂y2dydx.With T+ΔT instead of T and f+Δf instead of f, the following are obtained after a series of arrangement:(32)∫abT-Y2dx=∫ab∫0LT-Y2δx-xidxdy.Then(33)ΔJ=Jq+Δq-Jq=∫x=0L2T-YΔTδx-xidx+∫x=0L∫y=0fxλ∂2ΔT∂x2+∂2ΔT∂y2dydx.Make the second distribution equal to integral twice in the right side of (33), and use the boundary conditions of sensitivity problem, then make ΔJ closer to 0, and finally adjoint problems can be as follows.In the regionΩ,(34a)∂2λ∂x2+∂2λ∂y2=0.When x=0,(34b)∂λ∂x=0.When x=10,(34c)∂λ∂x=0.When y=0,(34d)∂λ∂y=-2T-Yδx-xi.When y=f(x),(34e)λ=0.The boundary element method is used to solve the corresponding value of the adjoint function λ(x,y), so that the functional increment is(35)ΔJ=∫0L-∂λ∂y·∂T∂yy=fxΔfxdx.So according to Alifanov’s definition,(36)ΔJ=∫0LJ′xΔfxdx.The derivative of the functional J is(37)J′x=-∂λ∂y·∂T∂yy=fx.The above three problems including the forward problem, the sensitivity problem, and the adjoint problem can be solved, and the following are iterative calculation step of conjugate gradient method:(1)
Select a stochastic initial value of inner wall shape inf(x) to solve the forward problem (1a)–(1e) and calculate the temperature distribution T(x,t) in the domain.(2)
According toTi and Yi determine whether to meet the convergence stop standard (3) J[fk+1(x)]<ε; if satisfied, then stop the iteration; otherwise, calculate the next step.(3)
Solve the adjoint problem (34a)–(34e), and get the adjoint function λ(x).(4)
Calculate the gradientJ′(x).(5)
Calculate the conjugate gradient coefficientγk and the descent direction pk.(6)
MakeΔf(x)=-pk(x) to solve the sensitivity problem (27a)–(27e) to get the temperature increment ΔT(x).(7)
Calculate the search stepβk by formula (30).(8)
Makek=k+1 to calculate the new boundary shapefk(x) and new Ti and go back to step (2).


## 3.3. CGM-SPSO Hybrid Algorithm

CGM is computationally fast, but it usually converges to local optimal solutions and relies heavily on the initial approximation of the iterative process. The SPSO algorithm requires tens of thousands of iterations and a lot of computation time. The fitness function evaluation of a complex problem is very time-consuming, so we propose a hybrid algorithm of CGM and SPSO, whose purpose is to combine global search ability of SPSO and fast convergence ability of CGM. Since CGM needs a smooth and appropriate initial value, it can converge to a very precise solution. Therefore, this paper gets the temperature of the measured pointTT1,T2,…,Ti by the SPSO method when the boundary shape is unknown, and then the value obtained by SPSO is processed by the interpolation calculation to obtain a smooth function as the initial value of CGM.


## 4. Exponential Analysis

As shown in Figure1, the physical model of the inner wall defect detection of industrial thermal equipment is a two-dimensional thermostatic heat conduction problem. The domain Ω is a two-dimensional space composed of x=0.0, x=10.0, y=0, and y=f(x). Here, both sides of x=0.0 and x=10.0 are adiabatic, and a known constant heat flow q0 is passed out by cooling at y=0 so that a constant known temperature T0 is maintained at y=f(x).


### 4.1. Influence of the Number of Geometric Inversion Parameters

Assume the function of the thermal device boundary is expressed as(38)fx=0.75+0.4exp⁡-x-523.Considering the uniform distribution of the temperature measurement points in the outer boundary of the thermal equipment, there is no measurement error. Three geometric inversion parameters M=50, M=100, and M=150 are geometrically inversed. The inversion results are shown in Figure 4.Figure 4
Inverse solution of different geometric inversion parameters number.The experimental data for each group are as follows.WhenM=50,1 to 13 columns
0.7515 0.7523 0.7535 0.7552 0.7576 0.7609 0.7654 0.7712 0.7788 0.7884 0.8003 0.8148 0.831814 to 26 columns
0.8515 0.8738 0.8982 0.9242 0.9512 0.9782 1.0042 1.0282 1.0490 1.0656 1.0772 1.0832 1.083327 to 39 columns
1.0774 1.0659 1.0494 1.0286 1.0047 0.9787 0.9517 0.9247 0.8987 0.8742 0.8519 0.8322 0.815140 to 50 columns
0.8006 0.7886 0.7790 0.7714 0.7655 0.7610 0.7577 0.7553 0.7535 0.7523 0.7515WhenM=100,1 to 13 columns
0.7512 0.7515 0.7518 0.7523 0.7528 0.7535 0.7543 0.7553 0.7564 0.7578 0.7594 0.7613  0.763514 to 26 columns
0.7660 0.7690 0.7724 0.7762 0.7806 0.7856 0.7912 0.7974 0.8043 0.8119 0.8203 0.8294 0.839327 to 39 columns
0.8499 0.8613 0.8734 0.8862 0.8996 0.9135 0.9279 0.9427 0.9577 0.9729 0.9880 1.0029 1.017640 to 52 columns
1.0318 1.0453 1.0581 1.0698 1.0805 1.0900 1.0980 1.1046 1.1097 1.1131 1.1148 1.1148  1.113153 to 65 columns
1.1097 1.1047 1.0981 1.0900 1.0806 1.0699 1.0582 1.0454 1.0319 1.0177 1.0031 0.9881  0.973066 to 78 columns
0.9579 0.9428 0.9281 0.9137 0.8997 0.8863 0.8735 0.8614 0.8500 0.8394 0.8295 0.8204 0.812079 to 91 columns
0.8044 0.7975 0.7912 0.7856 0.7807 0.7763 0.7724 0.7690 0.7661 0.7635 0.7613 0.7594 0.757892 to 100 columns
0.7564 0.7553 0.7543 0.7535 0.7528 0.7523 0.7518 0.7515 0.7512WhenM=150,1 to 13 columns
0.7505 0.7506 0.7507 0.7508 0.7510 0.7511 0.7514 0.7516 0.7519 0.7522 0.7526 0.7530 0.753514 to 26 columns
0.7540 0.7547 0.7554 0.7562 0.7571 0.7582 0.7594 0.7607 0.7622 0.7638 0.7656 0.7677 0.769927 to 39 columns
0.7724 0.7751 0.7782 0.7814 0.7850 0.7889 0.7932 0.7977 0.8027 0.8080 0.8137 0.8198 0.826340 to 52 columns
0.8332 0.8405 0.8482 0.8563 0.8648 0.8736 0.8829 0.8925 0.9024 0.9126 0.9231 0.9339 0.944853 to 65 columns
0.9559 0.9671 0.9783 0.9896 1.0008 1.0120 1.0229 1.0337 1.0441 1.0543 1.0640 1.0732 1.082066 to 78 columns
1.0901 1.0976 1.1044 1.1105 1.1159 1.1204 1.1241 1.1269 1.1288 1.1298 1.1299 1.1291 1.127479 to 91 columns
1.1249 1.1214 1.1171 1.1120 1.1061 1.0994 1.0921 1.0841 1.0755 1.0664 1.0568 1.0467 1.036492 to 104 columns
1.0257 1.0148 1.0037 0.9925 0.9812 0.9699 0.9587 0.9476 0.9366 0.9258 0.9153 0.9050 0.8950105 to 117 columns
0.8853 0.8759 0.8670 0.8584 0.8502 0.8424 0.8350 0.8280 0.8214 0.8152 0.8094 0.8040 0.7990118 to 130 columns
0.7943 0.7900 0.7860 0.7823 0.7790 0.7759 0.7731 0.7705 0.7682 0.7661 0.7642 0.7626 0.7610131 to 143 columns
0.7597 0.7585 0.7574 0.7564 0.7556 0.7548 0.7542 0.7536 0.7531 0.7527 0.7523 0.7519 0.7517144 to 150 columns
0.7514 0.7512 0.7510 0.7509 0.7507 0.7506 0.7505As can be seen from Figure4, when using the CGM-SPSO hybrid algorithm for geometric inversion, regardless of whether the number of inversion parameters is M=50, M=100, or M=150, the estimated boundary shape and the exact boundary shape are very close, and this happens equally in the edge and peak. The average relative errors of the inversion are 1.12%, 0.73%, and 0.52%, respectively, which shows CGM-SPSO algorithm is good to overcome the influence of the number of inversion parameters on the exact value of the inversion. It can be seen from the above experiments that when the number of geometric inversion parameters increases, the inversion solution accuracy is improved, but it can be seen from the figure that increasing the number does not have much effect on the accuracy of the inversion solution. Therefore, the conclusion is that the proposed method is not affected by the influence of the number of inversion parameters on the inversion solution. The following discusses the convergence of SPSO and CGM when the number of inversion parameters is M=100, as shown in Figures 5 and 6.Figure 5
Convergence curve of SPSO algorithm.Figure 6
Convergence curve of CGM algorithm.As shown in Figures5 and 6, the convergence curve of the SPSO algorithm shows that the objective function converges rapidly after the fifth iteration. Then, CGM obtains initial value from SPSO. After 10 iterations, a convergent optimal solution is produced. It shows that CGM-SPSO algorithm spends the less computation time and has not only high accuracy of the solution but also the higher efficiency of the algorithm.


## 4.1. Influence of the Number of Geometric Inversion Parameters

Assume the function of the thermal device boundary is expressed as(38)fx=0.75+0.4exp⁡-x-523.Considering the uniform distribution of the temperature measurement points in the outer boundary of the thermal equipment, there is no measurement error. Three geometric inversion parameters M=50, M=100, and M=150 are geometrically inversed. The inversion results are shown in Figure 4.Figure 4
Inverse solution of different geometric inversion parameters number.The experimental data for each group are as follows.WhenM=50,1 to 13 columns
0.7515 0.7523 0.7535 0.7552 0.7576 0.7609 0.7654 0.7712 0.7788 0.7884 0.8003 0.8148 0.831814 to 26 columns
0.8515 0.8738 0.8982 0.9242 0.9512 0.9782 1.0042 1.0282 1.0490 1.0656 1.0772 1.0832 1.083327 to 39 columns
1.0774 1.0659 1.0494 1.0286 1.0047 0.9787 0.9517 0.9247 0.8987 0.8742 0.8519 0.8322 0.815140 to 50 columns
0.8006 0.7886 0.7790 0.7714 0.7655 0.7610 0.7577 0.7553 0.7535 0.7523 0.7515WhenM=100,1 to 13 columns
0.7512 0.7515 0.7518 0.7523 0.7528 0.7535 0.7543 0.7553 0.7564 0.7578 0.7594 0.7613  0.763514 to 26 columns
0.7660 0.7690 0.7724 0.7762 0.7806 0.7856 0.7912 0.7974 0.8043 0.8119 0.8203 0.8294 0.839327 to 39 columns
0.8499 0.8613 0.8734 0.8862 0.8996 0.9135 0.9279 0.9427 0.9577 0.9729 0.9880 1.0029 1.017640 to 52 columns
1.0318 1.0453 1.0581 1.0698 1.0805 1.0900 1.0980 1.1046 1.1097 1.1131 1.1148 1.1148  1.113153 to 65 columns
1.1097 1.1047 1.0981 1.0900 1.0806 1.0699 1.0582 1.0454 1.0319 1.0177 1.0031 0.9881  0.973066 to 78 columns
0.9579 0.9428 0.9281 0.9137 0.8997 0.8863 0.8735 0.8614 0.8500 0.8394 0.8295 0.8204 0.812079 to 91 columns
0.8044 0.7975 0.7912 0.7856 0.7807 0.7763 0.7724 0.7690 0.7661 0.7635 0.7613 0.7594 0.757892 to 100 columns
0.7564 0.7553 0.7543 0.7535 0.7528 0.7523 0.7518 0.7515 0.7512WhenM=150,1 to 13 columns
0.7505 0.7506 0.7507 0.7508 0.7510 0.7511 0.7514 0.7516 0.7519 0.7522 0.7526 0.7530 0.753514 to 26 columns
0.7540 0.7547 0.7554 0.7562 0.7571 0.7582 0.7594 0.7607 0.7622 0.7638 0.7656 0.7677 0.769927 to 39 columns
0.7724 0.7751 0.7782 0.7814 0.7850 0.7889 0.7932 0.7977 0.8027 0.8080 0.8137 0.8198 0.826340 to 52 columns
0.8332 0.8405 0.8482 0.8563 0.8648 0.8736 0.8829 0.8925 0.9024 0.9126 0.9231 0.9339 0.944853 to 65 columns
0.9559 0.9671 0.9783 0.9896 1.0008 1.0120 1.0229 1.0337 1.0441 1.0543 1.0640 1.0732 1.082066 to 78 columns
1.0901 1.0976 1.1044 1.1105 1.1159 1.1204 1.1241 1.1269 1.1288 1.1298 1.1299 1.1291 1.127479 to 91 columns
1.1249 1.1214 1.1171 1.1120 1.1061 1.0994 1.0921 1.0841 1.0755 1.0664 1.0568 1.0467 1.036492 to 104 columns
1.0257 1.0148 1.0037 0.9925 0.9812 0.9699 0.9587 0.9476 0.9366 0.9258 0.9153 0.9050 0.8950105 to 117 columns
0.8853 0.8759 0.8670 0.8584 0.8502 0.8424 0.8350 0.8280 0.8214 0.8152 0.8094 0.8040 0.7990118 to 130 columns
0.7943 0.7900 0.7860 0.7823 0.7790 0.7759 0.7731 0.7705 0.7682 0.7661 0.7642 0.7626 0.7610131 to 143 columns
0.7597 0.7585 0.7574 0.7564 0.7556 0.7548 0.7542 0.7536 0.7531 0.7527 0.7523 0.7519 0.7517144 to 150 columns
0.7514 0.7512 0.7510 0.7509 0.7507 0.7506 0.7505As can be seen from Figure4, when using the CGM-SPSO hybrid algorithm for geometric inversion, regardless of whether the number of inversion parameters is M=50, M=100, or M=150, the estimated boundary shape and the exact boundary shape are very close, and this happens equally in the edge and peak. The average relative errors of the inversion are 1.12%, 0.73%, and 0.52%, respectively, which shows CGM-SPSO algorithm is good to overcome the influence of the number of inversion parameters on the exact value of the inversion. It can be seen from the above experiments that when the number of geometric inversion parameters increases, the inversion solution accuracy is improved, but it can be seen from the figure that increasing the number does not have much effect on the accuracy of the inversion solution. Therefore, the conclusion is that the proposed method is not affected by the influence of the number of inversion parameters on the inversion solution. The following discusses the convergence of SPSO and CGM when the number of inversion parameters is M=100, as shown in Figures 5 and 6.Figure 5
Convergence curve of SPSO algorithm.Figure 6
Convergence curve of CGM algorithm.As shown in Figures5 and 6, the convergence curve of the SPSO algorithm shows that the objective function converges rapidly after the fifth iteration. Then, CGM obtains initial value from SPSO. After 10 iterations, a convergent optimal solution is produced. It shows that CGM-SPSO algorithm spends the less computation time and has not only high accuracy of the solution but also the higher efficiency of the algorithm.


## 5. Conclusion

In this paper, a hybrid algorithm of conjugate gradient method and particle swarm optimization algorithm is used to study the inversion problem of the boundary shape. The social particle swarm optimization algorithm and the conjugate gradient method are introduced, and the two-dimensional steady-state model is used to verify and discuss the algorithm. The influence of the number of inversion parameters on the inversion results is discussed, and the convergence of the SPSO algorithm and the CGM algorithm is obtained. The main conclusions are as follows.(1) The CGM-SPSO algorithm is used to reconstruct the geometric shape of the two-dimensional steady-state thermal conduction system. When the number of geometric inversion parameters increases, the inversion solution is improved, but when the number of geometric inversion parameters is appropriate, increasing the number does not have much effect on the inversion solution. It is proved that CGM-SPSO is effective for two-dimensional steady-state thermal boundary identification.(2) CGM-SPSO algorithm has high accuracy to the peak and edge value of geometric shape.(3) Less times of iterations can meet the convergence conditions; thus calculation time is greatly reduced.



---

*Source: 2461498-2017-10-24.xml*