An Artificial Intelligence-Based Nonlinear Solver for Hydrocarbon Reservoir Simulations
Bibliographic record
Abstract
Abstract The reservoir simulation is based on the solving of second-order nonlinear Partial Differential Equations (PDEs). Following the high-level of nonlinearity or irregular boundaries, analytical solutions are not applicable to solve the supposed PDEs. To numerically solve the PDEs, applying nonlinear solvers are recommended. Dependencies on derivatives and proper initial guesses are the main disadvantages of classic solvers. To overcome the mentioned obstacles, solving supposed equations based on Adaptive Neural Network (ANN) has been introduced. The algorithm starts by introducing an initial set into the Nonlinear Simultaneous Algebraic Equations (NSAE). The outputs are compared with the desired matrix of zeros to generate the required error. The calculated vectors of errors and its derivation are firstly employed to update the ANN weights through applying the adaption laws, and secondly, create the input vector to run the ANN. The outputs of the ANN are considered as corrections to be made to the initial set. Then, the corrected initial set is reintroduced into equations. The procedure continues iteratively until the outputs of equations meet the required level of accuracy. By taking advantages of the adaptive laws, the outputs of the presented algorithm have successfully been matched with answers of the classic solvers, but with less computational costs. The convergence of the shown algorithm has practically been examined by assuming various mathematical types of initial sets. The implemented algorithm has been robust enough to converge for different forms of the initial sets, even for invalid values like minus numbers. However, records indicate that the convergence rates are strongly dependent on the values of initial sets. Following the sensitivity analysis over the primary model of ANN lead to the optimized network, which could solve the supposed NSAE three times faster. It has been interpreted that the number of neurons (NN), the diagonal coefficient matrix of error (λ), and the adaptive coefficient (Fw) have the most significant impacts on the performance of the algorithm. In contrast to Newton's method as the most well-known nonlinear solver, the launched algorithm does not require any proper initial guesses. Moreover, the absolute independence of computing the partial derivatives of the Jacobian matrix and its inversion, which causes a notable reduction of computational costs, is the other remarkable advantage of the proposed approach. The represented algorithm can be taken as the platform to develop the next generation of simulators working based on machine learning.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".