版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Jilin Univ Key Lab Groundwater Resources & Environm Minist Educ Changchun 130021 Peoples R China Jilin Univ Jilin Prov Key Lab Water Resources & Environm Changchun 130021 Peoples R China Jilin Univ Coll New Energy & Environm Changchun 130021 Peoples R China
出 版 物:《JOURNAL OF HYDROLOGY》 (水文学杂志)
年 卷 期:2023年第626卷第PartA期
核心收录:
学科分类:08[工学] 0708[理学-地球物理学] 081501[工学-水文学及水资源] 0815[工学-水利工程] 0814[工学-土木工程]
基 金:National Natural Science Foundation of China
主 题:Groundwater pollution source Temporal convolutional network Surrogate model Metropolis-Hasting algorithm Kalman filter algorithm
摘 要:Increasing the precision of groundwater pollution source identification (GPSI) is crucial for groundwater pollution control and risk management. Bayesian theory based on the Markov Chain Monte Carlo (MCMC) method is a useful strategy of solving the GPSI problem. However, because of the nonlinear and uncertainty characteristics of GPSI, the Metropolis-Hasting (MH) algorithm, one of the most well-known MCMC algorithms, has the disadvantage of relatively low precision and is time-consuming. To address this problem, the Kalman filter (KF) algorithm was combined with the MH algorithm and referred to as the Kalman filter MetropolisHasting (KF-MH) algorithm. The algorithm generates a new initial distribution that is close to the true value through a prior distribution, and the new initial distribution is used to perform subsequent iterations of the calculation. The viability and superiority of the proposed KF-MH algorithm were assessed in three hypothetical GPSI cases under different conditions. In the inversion process, a surrogate model was constructed using a temporal convolutional network (TCN) to reduce the computational pressure imposed by the numerical simulation model. The results of the TCN surrogate model in the cases illustrate the high accuracy of the TCN surrogate model in fitting the groundwater numerical model. In the three cases, the normalized errors between the identification results and the true values of the source features obtained with the KF-MH algorithm were significantly lower than those of the MH algorithm. The results indicate that the proposed KF-MH algorithm has higher inversion accuracy than the MH algorithm.