Xiangling Meng

Dr. Xiangling Meng


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2025 in Archives of Computational Methods in Engineering
Verified
Journal Article
Closed access
PDF file
XMXiangling Meng
Xiangling Meng
XHXiao He
Xiao He
CHChangjun Hu
Changjun Hu
XLXu Lu
Xu Lu
HLHuayu Li
Huayu Li

19 May 2026 in Processes
Verified
Journal Article
Open access
PDF file
YQYisen Qin
Yisen Qin
HLHuayu Li
Huayu Li
XMXiangling Meng
Xiangling Meng
XHXiao He
Xiao He
JZJinding Zhang
Jinding Zhang
HZHaijun Zhang
Haijun Zhang
Automatic history matching traditionally depends on a large number of time-consuming numerical simulations, which makes the overall workflow computationally expensive. Deep learning-based surrogate models provide an efficient alternative, but their predictive performance often relies on large labeled datasets, whose generation through reservoir simulation remains costly. To alleviate this issue, we propose a data-efficient surrogate modeling framework for automatic history matching. The framework consists of two components. First, the reservoir parameter field is reformulated as a flattened representation and processed using one-dimensional convolutions. This representation provides a direct connection between parameter encoding and production-sequence prediction while maintaining competitive forecasting accuracy. Second, an autoencoder is pre-trained on unlabeled parameter realizations, and the learned encoder is then used to initialize the surrogate model for supervised regression, thereby improving the utilization of inexpensive, unlabeled data. The proposed framework is evaluated on the three-dimensional Brugge benchmark reservoir model. Results show that the one-dimensional representation achieves competitive predictive accuracy with shorter training time. In addition, the pre-training strategy is particularly beneficial when labeled simulation data are limited. Overall, the proposed framework improves the data efficiency of surrogate-assisted automatic history matching and reduces the dependence on extensive labeled simulations in the Brugge benchmark.

1 September 2026 in Computation
Verified
Journal Article
Open access
PDF file
XMXiangling Meng
Xiangling Meng
YQYisen Qin
Yisen Qin
HLHuayu Li
Huayu Li
Fully implicit simulation of multiphase flow in porous media requires repeated solution of large, sparse, nonsymmetric Jacobian systems, where linear solvers and preconditioners often dominate the computational cost. In field-scale models with strong well controls and well–reservoir coupling, bottom-hole pressure (BHP) constraints may introduce slowly converging pressure-related error modes that are not fully represented by pressure-only constrained pressure residual (CPR) preconditioning. This paper develops a Schur-consistent graphics processing unit (GPU) implementation of constrained pressure residual with wells and algebraic multigrid (CPRW-AMG) for the Open Porous Media (OPM) Flow simulator. The method augments the pressure coarse space with one auxiliary BHP unknown per active well while preserving a reservoir-only fine-level Krylov system. The pressure–BHP coarse operator is constructed from the same assembled effective reservoir Jacobian used by the Krylov matrix–vector product and the GPU diagonal incomplete lower–upper (DILU) smoother, avoiding inconsistent treatment of well contributions between fine and coarse levels. A GPU-resident sparse update strategy refreshes well-related coarse entries, and the NVIDIA AMGX library is used for the scalar coarse solve. Benchmarks on SPE9, SPE10, Sleipner, and Norne cover small well-coupled, highly heterogeneous carbon dioxide storage and field-realistic reservoir models. Compared with CPU CPRW-AMG, the GPU implementation reduces total runtime by factors of 1.69–8.78 and achieves linear-solve speedups of up to 17.96×. Compared with GPU CPR-AMG, the performance benefit is case-dependent, indicating that CPRW-AMG is most effective when the reduction in well-induced slow error modes compensates for the additional coarse-level cost.