Microsoft Word - 001.docx CHEMICAL ENGINEERING TRANSACTIONS VOL. 66, 2018 A publication of The Italian Association of Chemical Engineering Online at www.aidic.it/cet Guest Editors: Songying Zhao, Yougang Sun, Ye Zhou Copyright ยฉ 2018, AIDIC Servizi S.r.l. ISBN 978-88-95608-63-1; ISSN 2283-9216 Finite Difference Modeling for Resistivity Tomography Based on Reconstruction Algorithms Peng Liua,b, Jianhua Yuea,* aCollege of Resource & Geosciences, China University of Mining & Technology, Xuzhou 221008, China bYankuang Donghua Construction Co., Ltd, Zoucheng 273500, China 15052020148@163.com The finite difference forward modeling solves the point source arbitrary 2D geoelectrical section resistivity model herein. A system of linear equations is finally formed. Two reconstruction algorithms, i.e. conjugate gradient method and Cholesky algorithm, are introduced into the numerical analysis to derive the theoretical formula. With uniform media and layered media chosen as the physical model for forward modeling, the numerical simulation results that low and high resistance objects correspond to different reconstruction algorithms in two media models are analyzed. The findings show that the Cholesky reconstruction algorithm works well in the numerical simulation of sounding low resistance object, while there is a little difference between the two reconstruction algorithms for high resistance object. But also, in the even semi-infinite medium, when the point source lies at the center of the surface mesh, the relative error Rms to the potential value and the theoretical value of the unit point source geoelectric field is obtained by the Cholesky algorithm, and the maximum error occurred when it converges for 33 iterations is more than 3.0%. As polar distance increases, relative error also has no tendency to amplify. Compared to the conjugate gradient method, the Cholesky algorithm not only greatly requires less in memory but also greatly increases the computing speed. The study provides the clues to future finite difference numerical simulation and interpretation of resistivity tomography. 1. Introduction Resistivity Tomography is such that the medium resistivity distribution inside the detection area is studied by observing the potential or potential difference in different directions around detection area using the potential field excited by DC power source (LaBrecque, 1992). Since the potential field is vulnerable to the rock lithology and structure, the projection data space is generally smaller than that of image data needed to be inverted. In this sense, it often has multiple solutions. It is required for people to perform numerical simulations first, make a survey on how the geological structure affects the observation of electric fields, and find out what the characteristics of electric field propagation seem under geological conditions, in order to lay the foundation for the subsequent study and interpretation on inversion approaches. Numerical simulation plays an important role in processing electric field data, including finite element method, the integral equation method, the Newton- Raphson method and so on. Shima et al. (1987) proposed the resistivity back-projection technology and thereafter Yorkey et al., calculated the potential distribution generated from a 2D structure to a 3D electrode using the finite difference method. Due to too heavy computation burden in the finite element method in forward modeling, Barker (1992), Lietal (1992) introduced the finite difference method into the forward modeling. In the study of resistivity tomography, the forward and inverse modeling using simulated annealing and genetic algorithm gets hot, while traditional and classical numerical methods has gradually been out of fashion (such as the conjugate gradient method and Cholesky decomposition). There are even less involvement on the forward modeling of the finite difference methods (Li and Oldenburg, 1994; Loke and Barker, 1995; Murai, 1985; Noel and Xu, 1991). This paper builds a forward model to carry out a case study on the relationship between conjugate gradient method, Cholesky decomposition algorithm and anomaly space distribution feature (geometric, burial features) in finite difference numerical simulation, and perform forward numerical simulation of the model. What the relationship of the forward field curve with the spatial position of the deeply buried object seems to be known. DOI: 10.3303/CET1866171 Please cite this article as: Liu P., Yue J., 2018, Finite difference modeling for resistivity tomography based on reconstruction algorithms, Chemical Engineering Transactions, 66, 1021-1026 DOI:10.3303/CET1866171 1021 The results provide the clues to interpretation on application conditions and observation data for different geological models with the conjugate gradient method and Cholesky decomposition algorithm in finite difference. 2. Mathematical principle Resistivity tomography is highly nonlinear. Discretization of imaging area will cause certain errors in the imaging process when using numerical solutions. In order to capture more real and reliable imaging, it is required to depend on forward modeling or other apriori information to get actual imaging. Thus, we should build a mathematical model for the engineering problem, i.e. the differential integral equation with relevant boundary and initial conditions, before making analysis. To solve these mathematical models, there are methods roughly composed of two types: analytical and numerical methods. It is well known that the analytical method has some limitations. When the boundary conditions of a system are complex, it is often impossible to find analytical or approximate solutions to the problem. Therefore, for most engineering problems, the numerical solution gets more practical. In the case of dense mesh, the finite difference method can quickly identify the electrical anomaly features of complex geoelectrical sections and calculate electrical anomalies under complex terrain conditions. With this method, how the terrain affects electrical anomalies can easily come to light. Underground electric field built by resistivity method satisfies the differential equation (Price, 1979; Qian et al., 1995; Sasaki, 1989, 1992): โˆ‡ โˆ™ (๐œŽ โˆ™ โˆ‡๐‘ˆ) = โˆ’๐ผ๐›ฟ(๐‘ฅ โˆ’ ๐‘ฅ0)๐›ฟ(๐‘ฆ โˆ’ ๐‘ฆ0)๐›ฟ(๐‘ง โˆ’ ๐‘ง0) (1) Where, ฯƒ is the electrical conductivity of the rock; U is the potential at any point on the ground or in the medium; I is the supply current intensity; (๐‘ฅ0, ๐‘ฆ0, ๐‘ง0) is the position coordinate of the power supply point; ฮด is the Dirac function; ฯƒ and U are the functions of (x, y, z). For 2D geoelectrical profiles, there is ๐œ• ๐œ•๐‘ฆ [๐œŽ(๐‘ฅ๏ผŒ๐‘ฆ๏ผŒ๐‘ง)] = 0, then (1) โˆ‡ โˆ™ [๐œŽ(๐‘ฅ๏ผŒ๐‘ง)โˆ‡๐‘ˆ(๐‘ฅ๏ผŒ๐‘ฆ๏ผŒ๐‘ง)] = โˆ’๐ผ๐›ฟ(๐‘ฅ โˆ’ ๐‘ฅ0)๐›ฟ(๐‘ฆ โˆ’ ๐‘ฆ0)๐›ฟ(๐‘ง โˆ’ ๐‘ง0) (2) After using Fourier transform ฯ•(๐‘ฅ๏ผŒ๐‘˜๏ผŒ๐‘ง) = โˆซ ๐‘ˆ(๐‘ฅ๏ผŒ๐‘ฆ๏ผŒ๐‘ง) cos(๐‘˜ โˆ™ ๐‘ฆ)๐‘‘๐‘ฆ โˆž 0 (3) Transform the potential U in the (x, y, z) into the potential ฯ† in the (x, k, z). When ๐‘ฆ0 = 0, it derives from (2): โˆ‡ โˆ™ [๐œŽ(๐‘ฅ๏ผŒ๐‘ฆ)โˆ‡๐œ™(๐‘ฅ๏ผŒ๐‘˜๏ผŒ๐‘ง)] โˆ’ ๐‘˜2 ๐œŽ(๐‘ฅ๏ผŒ๐‘ง)๐œ™(๐‘ฅ๏ผŒ๐‘˜๏ผŒ๐‘ง) = โˆ’ 1 2 ๐›ฟ(๐‘ฅ โˆ’ ๐‘ฅ0)๐›ฟ(๐‘ง โˆ’ ๐‘ง0) (4) Where: ฯƒ is the conductivity; k is the space wave number; ฮด is the Dirac function. After the discretization and variational process, the potential distribution generated by the 3D electrode in the 2D structure can be obtained. At last, the potential in the wave number domain is transformed to the spatial domain, and the forward simulation calculation is achieved. 3. Reconstruction algorithms As the key to forward modeling, the reconstruction algorithm matters the imaging speed and quality, and it is also the key and aporia of tomography. After discretizing and varying the formula (4), we obtain: U(๐‘ฅ๏ผŒ๐‘ฆ๏ผŒ๐‘ง) = 2 ๐œ‹ โˆซ ๐‘ฃ(๐‘ฅ๏ผŒ๐œ†๏ผŒ๐‘ง) cos(๐œ†๐‘ฆ)๐‘‘๐œ† โˆž 0 (5) Using formula (5), the spatial domain potential field distribution of the stable current field can be available. It is not easy to solve the formula (5) directly. First, the area is discretized into a 3D mesh of ๐‘๐‘ฅ ร— ๐‘๐‘ฆ ร— ๐‘๐‘ง. The node number is i = 1,2, โ‹ฏ , ๐‘๐‘ฅ in the x direction, j = 1,2, โ‹ฏ , ๐‘๐‘ฆ in y direction, and k = 1,2, โ‹ฏ , ๐‘๐‘ง in z direction, set โˆ†๐‘‰๐‘–,๐‘—,๐‘˜ represents the volume element near the node (i, j, k), (5) integrates in โˆ†๐‘‰๐‘–,๐‘—,๐‘˜, then use the Gauss theorem โˆญ โˆ‡ โˆ™ [๐œŽโˆ‡๐œ‘] โˆ†๐‘‰๐‘–,๐‘—,๐‘˜ ๐‘‘๐‘ฃ = โˆฌ ๐œŽโˆ‡๐œ‘ โˆ™ ๐‘›๐‘‘๐‘  ๐‘ ๐‘–,๐‘—,๐‘˜ (6) Where, ๐‘ ๐‘–,๐‘—,๐‘˜ is the surface of โˆ†๐‘‰๐‘–,๐‘—,๐‘˜๏ผŒthen โˆ’ โˆฌ ๐œŽ ๐œ•๐œ‘ ๐œ•๐‘› ๐‘‘๐‘  ๐‘ ๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ = ๐ผ โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ โˆญ ๐›ฟ(๐‘ฅ โˆ’ ๐‘ฅ0)๐›ฟ(๐‘ฆ โˆ’ ๐‘ฆ0)๐›ฟ(๐‘ง โˆ’ ๐‘ง0)๐‘‘๐‘ฅ๐‘‘๐‘ฆ๐‘‘๐‘ง โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ = { 1๏ผŒ(๐‘ฅ0๏ผŒ๐‘ฆ0๏ผŒ๐‘ง0) โˆˆ โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ 0. (๐‘ฅ0๏ผŒ๐‘ฆ0๏ผŒ๐‘ง0) โˆ‰ โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ (7) 1022 Again, the center difference is used to calculate๐œ•๐œ‘ /๐œ•๐‘›, for each node (i, j, k), the above formula can be written as the following difference equation: ๐ถ๐‘ก๐œ‘๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜โˆ’1 + ๐ถ๐‘0๐œ‘๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜+1+๐ถ๐‘™ ๐œ‘๐‘–โˆ’1๏ผŒ๐‘—๏ผŒ๐‘˜ +๐ถ๐‘Ÿ ๐œ‘๐‘–+1๏ผŒ๐‘—๏ผŒ๐‘˜ +๐ถ๐‘“ ๐œ‘๐‘–๏ผŒ๐‘—โˆ’1๏ผŒ๐‘˜ +๐ถ๐‘๐‘Ž๐œ‘๐‘–๏ผŒ๐‘—+1๏ผŒ๐‘˜ +๐ถ๐‘๐œ‘๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ = { 1๏ผŒ(๐‘ฅ0๏ผŒ๐‘ฆ0๏ผŒ๐‘ง0) โˆˆ โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ 0. (๐‘ฅ0๏ผŒ๐‘ฆ0๏ผŒ๐‘ง0) โˆ‰ โˆ†๐‘‰๐‘–๏ผŒ๐‘—๏ผŒ๐‘˜ (8) Where, ๐ถ๐‘ก, ๐ถ๐‘0, ๐ถ๐‘™ , ๐ถ๐‘Ÿ , ๐ถ๐‘“ , ๐ถ๐‘๐‘Ž, ๐ถ๐‘ are the connection coefficients around the node (i, j, k) and their own nodes, respectively, written in a matrix form and the equation set function (9) is obtained. Aฯ†=S (9) 4. Conjugate gradient method From minimized function F(x)=xTAx/2-bTx from (9), let r(0)=b-Ax(0), p(0)=r(0)๏ผŒthen ๏€จ ๏€ฉ ๏€จ ๏€ฉ ๏€จ ๏€ฉ ( ) ( ) ( ) ( ) ( 1) ( ) ( ) ( ) ( 1) ( ) ( ) ( ) ( ) ( 1) ( 1) ( ) ( ) ( 1) ( 1) ( ) ( ) , / ( , ), , 0,1, 2, , / , , . i i i i i i i i i i i i i i i i i i i i i i a r r p Ap x x a p ir r a Ap r r r r p r p ๏ข ๏ข ๏€ซ ๏€ซ ๏€ซ ๏€ซ ๏€ซ ๏€ซ ๏ƒผ๏€ฝ ๏ƒฏ ๏€ฝ ๏€ซ ๏ƒฏ ๏ƒฏ ๏€ฝ๏€ฝ ๏€ญ ๏ƒฝ ๏ƒฏ ๏€ฝ ๏ƒฏ ๏ƒฏ๏€ฝ ๏€ซ ๏ƒพ (10) Since A is a capacity matrix, it is a large sparse symmetric positive definite band matrix, as shown below: 0 1 0 0 0 0 0 0 ba r t p b t C C A C C C C C ๏ƒฉ ๏ƒน ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ๏€ฝ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒช ๏ƒบ ๏ƒซ ๏ƒป (11) It can be seen that there are at most 7 non-zero elements in each line of the matrix A. S is the right-end term relevant to the supply current, and it only has values on the power supply node ฯ, i.e. S=(0,โ€ฆ,0, Sp, 0,โ€ฆ,0)T, while Sp=I, so the whole process of the numerical decomposition is to solve the product of matrix A and a column vector. A is decomposed into two 2D arrays, i.e. a real array (storing non-zero elements of matrix A) and an integer array (storing the index of the positions of the elements in the real array in matrix A), from which the product of the matrix A and any column vector is obtained to further acquire the potential ฯ†(x,y,z). 5. Cholesky decomposition algorithm The Cholesky decomposition is Aโ‰ˆCCT (12) where C is the lower triangular matrix, obtained from the diagonal matrix. The diagonal element of D is defined by: 2 / jj jj jk kk k j d a a d ๏€ผ ๏€ฝ ๏€ญ๏ƒฅ (13) Where ajk is the element of matrix A. Obviously, the element of ajk=0 in the summation has no contribution. D can be simply obtained. C is determined by the formula 1023 1/ 2 C UD ๏€ญ ๏€ฝ (14) Where U is the lower triangular matrix, its diagonal elements ujj=djj, for non-diagonal elements, k