A fast forward algorithm for three-dimensional magnetic anomaly on undulating terrain

Abstract This paper presents a fast and high-precision three-dimensional magnetic anomaly forward algorithm on undulating terrain. Firslty, The forward algorithm for three-dimensional magnetic anomalies on a horizontal observation surface is developed with the Block-Toeplitz-Toeplitz-Block (BTTB) matrix. In the proposed algorithm, the cuboid elements are used to divide the underground space. And the position of the observation point is set as the projection of the central point of the cuboid element onto the observation surface. With the symmetry of the BTTB matrix, the coefficient matrix is compressed and stored to reduces the memory requirements during the computation process. In order to deal with the coefficient matrix and parameter vector computations, the matrix cross-multiplication computation is transformed into a point-multiplication computation with the fast Fourier transform (FFT) method. Then, to solve the problem of undulating terrain, a hierarchical interpolation method is proposed in forward algorithm, in which the undulating terrain is divided into several horizontal observation surfaces. Subsequently, the magnetic field on the undulating terrain is interpolated. Some 3D models with horizontal observation surface and undulating terrain are tested to verify the proposed algorithm. The results show that the forward algorithm has the advantages of fast computation speed, high precision, and low memory requirement. It is suitable for large-scale (ten millions of nodes) three-dimensional magnetic forward modeling.

[1]  Y. Wong,et al.  BTTB–RRCG method for downward continuation of potential field data , 2016 .

[2]  R. Blakely.  Potential theory in gravity and magnetic applications , 1996 .

[3]  Hansruedi Maurer,et al.  Fast 3‐D large‐scale gravity and magnetic modeling using unstructured grids and an adaptive multilevel fast multipole method , 2017 .

[4]  Yaoguo Li,et al.  3D Joint Inversion of Gradient And Total-field Magnetic Data , 2010 .

[5]  Chai Yupu.  Shift sampling theory of Fourier transform computation , 1997 .

[6]  Yanpeng Zheng,et al.  Cyclic displacements and decompositions of inverse matrices for CUPL Toeplitz matrices , 2017 .

[7]  Changli Yao,et al.  High‐Speed Computation and Efficient Storage in 3‐D Gravity and Magnetic Inversion , 2003 .

[8]  B. Bhattacharyya,et al.  Continuous spectrum of the total-magnetic-field anomaly due to a rectangular prismatic body , 1966 .

[9]  B. Bhattacharyya,et al.  Magnetic Anomalies due to Prism-Shaped Bodies with Arbitrary Polarization , 1964 .

[10]  Yau Shu Wong,et al.  BTTB-based numerical schemes for three-dimensional gravity field inversion , 2015 .

[11]  Fabio Caratori Tontini,et al.  Rapid interactive modeling of 3D magnetic anomalies , 2012, Comput. Geosci..

[12]  Jingtian Tang,et al.  Closed-form formula of magnetic gradient tensor for a homogeneous polyhedral magnetic target: A tetrahedral grid example , 2017 .

[13]  F. Tontini.  Magnetic-anomaly Fourier spectrum of a 3D Gaussian source , 2005 .

[14]  Robert L. Parker,et al.  The Rapid Calculation of Potential Anomalies , 1973 .

[15]  Chen Zhao.  Three-dimensional fast forward modeling and the inversion strategy for large scale gravity and gravimetry data based on GPU , 2012 .