期刊文献+

综合随机游走过程与多点统计的河流相建模新方法 被引量:5

Modeling on Integrating Random Walk Process and Multiple-point Geostatistics to Fluvial Reservoirs
下载PDF
导出
摘要 多点统计学由于其算法的限制,不能很好再现连续河道形态,其关键是在抽样过程中随机性较强,导致河道连续性中断。提出了将随机游走过程应用于多点统计建模的新方法。通过随机游走产生河道主流线,并利用河道主流线约束多点统计预测,克服多点统计随机抽样导致的河道不连续性问题。从实际建模效果看,基于随机游走过程与多点统计的耦合建模方法较好地再现了河道连续性;抽稀检验验证了耦合建模方法的稳健性;表明所设计的新方法可以应用于实际储层建模。 The multiple-point geostatistics could not represent the continuous shape of the channel due to the limitation of its algorithm with random draw of the simulated value.A new method was proposed,which integrated the random walk process with multiple-point geostatistics.First the random walk process produced main streamline of cannel,by which the main streamline was constrained by the multiple-point geostatistics,the method was used to solve the problem of non-continuities of channel.Based on the actual model,the method based on random walk process and the multiple-point geostatistics can well reproduce the continuity of channel.The results show the new method is validate,it proves that the new method is robust and can be used for reservoir modeling.
出处 《石油天然气学报》 CAS CSCD 北大核心 2011年第8期44-47,4,共4页 Journal of Oil and Gas Technology
基金 国家科技重大专项(2008ZX05011-3) 国家自然科学基金项目(40902043) 湖北省自然科学基金项目(2008CDB390)
关键词 随机游走过程 多点地质统计 综合建模 河流相 random walk process multiple-point geostatistics integrating modeling fluvial reservoir
  • 相关文献

参考文献5

二级参考文献38

  • 1吕晓光,张永庆,陈兵,陈舒薇,潘懋.深度开发油田确定性与随机建模结合的相控建模[J].石油学报,2004,25(5):60-64. 被引量:61
  • 2尹艳树,吴胜和,秦志勇.目标层次建模预测水下扇储层微相分布[J].成都理工大学学报(自然科学版),2006,33(1):53-57. 被引量:10
  • 3Sebastien S Conditional simulation of complex geological structure using multiple-point statistics[J].Mathematical Geology,2002,34(1):1-21.
  • 4Yuhong L,Andrew H.William A,el al.Multiple-point simulation integrating wells,three-dimensional seismic data,and geology[J].AAPG Bulletin,2004,88(7):905-921.
  • 5Strebelle S Simulation of petrophysical property trends within hcies geobodies[J].Petroleum Geostatistics,2007,(9):10-14.
  • 6MONGE A E, ELKAN C P. The Field Matching Problem:Algorithms and Applications [ C] // Proceedings of the Second International Conference on Knowledge Discovery and Data Mining(KDD-96). Portland:Oregon, 1996:267-270.
  • 7NAVARRO G. A Guided Tour to Approximate String Matching [J]. ACM Computing Surveys,2001,33( 1 ):31-88.
  • 8CHAUDHURI S, GANJAM K, GANTI V, et al. Robust and Efficient Fuzzy Match for Online Data Cleaning [ C] // Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. San Diego:ACM Press,2003:313-324.
  • 9COHEN W W, RAVIKUMAR P,FIENBERG S E. A Comparision of String Distance Metrics for Name-matching Tasks [ C] //Proceedings of the IJCAI-2003 Workshop on Information Integration on the Web. Mexico: AAAI Press, 2003 : 73-78.
  • 10KALASHNIKOV D V, MEHROTRA S, CHEN Z. Exploiting Relationships for Domain-independent Data Cleaning [C]// SIAM International Conference on Data Mining. Nowport Beach: CA, 2005 : 21-23.

共引文献141

同被引文献125

引证文献5

二级引证文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部