An Artificial Intelligence-Based Nonlinear Solver for Hydrocarbon Reservoir Simulations
Notice bibliographique
Résumé
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.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».