Abstract
Magnetic surveying encounters challenges in high-precision detection and inversion on strongly magnetized bodies. Nonuniform magnetization caused by self-demagnetization and mutual magnetization makes magnetic field calculation using analytical formulas impractical. The previous discrete numerical methods have suffered from computational inefficiency or low accuracy. To resolve this issue, we develop an algorithm to solve the magnetic field integral equation for calculating the magnetization state of high-susceptibility bodies, combining the improved spatial convolution forward approach with the adaptive relaxation iteration method. To address the excessive computational burden in the magnetization field between 3D voxel arrays of the discrete model, we construct the circular convolution kernel matrix directly when the subsurface space is divided with an equidistant grid, significantly reducing redundant computations. Then, the fast Fourier transform is used to accelerate the forward discrete circular convolution operation. In addition, we derive an iterative computation scheme that adaptively adjusts the relaxation factor based on magnetic field changes to correct the effective magnetization for algorithm convergence. From a pragmatic perspective, equating the cuboid to equal-volume sphere subdivisions is developed to enhance computational efficiency further by approximately 50% despite sacrificing slight accuracy. The sphere and spherical shell models validate the algorithm accuracy, efficiency, and convergence. Furthermore, we analyze the characteristics of the mutual magnetization effect among magnetic bodies under different magnetization conditions. Finally, the applicability of the algorithm is demonstrated with a realistic example. Our algorithm shows promise for precisely exploring highly magnetized minerals, underground pipelines, and unexploded ordnance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.