邻近算法在一维大地电磁反演中的应用  

Neighbourhood algorithm and its application to 1D magnetotelluric data inversion

作　　者：黄卫航 金维浚[1] 张文辉[1,2] HUANG Wei-Hang JIN Wei-Jun ZHANG Wen-Hui(Institute of Geology and Geophysics, Chinese Academy of Sciences, Beifing 100029, China University of Chinese Academy of Sciences, Beijing 100049, China)

机构地区：[1]中国科学院地质与地球物理研究所,北京100029 [2]中国科学院大学,北京100049

出　　处：《物探与化探》2016年第5期974-979,共6页Geophysical and Geochemical Exploration

基　　金：国家自然科学基金面上项目(41372324);中国地质调查局项目"白龙江流域主要活动断裂调查与地质灾害效应研究"

摘　　要：总结了大地电磁法(MT)中常用的各种反演算法,并指出其局限性。对邻近算法(NA)加以概述,并将其引入MT反演中。对一维MT合成数据进行反演分析,得到的最大似然模型十分接近理论模型。虽然NA与遗传算法(GA)抗陷入局部极小值的能力大体相等,但NA算法生成的采样点分布密度与误差函数大体一致,因此NA更有利于应用基于积分的参数估值方法。本研究表明,NA收敛速度比GA更快。这说明在一维MT反演中,NA算法比GA算法更具优势。Magnetotelluric method（ MT） is applied so widely that improving the method of inversion and the interpretation of MT data become very important. This paper summarizes different inversion algorithms and points out their limitations. Then an overview is given on neighborhood algorithm（ NA） and its application to the MT inversion. The maximum likelihood model from NA is very close to the theoretical model. Although NA and genetic algorithm（ GA） have the same capability for resisting the local minimum value,NA algorithm shows better similarity between the density distribution of sampling points and the error function,so NA is more conducive to inversion application based on the integral parameter appraisal method. In this study,the authors found that NA converges much faster than GA,whereas NA algorithm is more advantageous than GA algorithm in 1D MT inversion.

关 键 词：大地电磁 邻近算法 遗传算法 反演 收敛速度 

分 类 号：P631[天文地球—地质矿产勘探]