Improved Well-Control Progressive Optimization with Generalized Barycentric Coordinates and Manifold Mapping

2021 ◽  
pp. 1-12
Author(s):  
D. Echeverría Ciaurri ◽  
G. A. Moreno Beltrán ◽  
J. Camacho Navarro ◽  
J. A. Prada Mejía

Summary Well-control management is nowadays frequently approached by means of mathematical optimization. However, in many practical situations the optimization algorithms used are still computationally expensive. In this paper, we present progressive optimization (PO), a simulator-nonintrusivefour-stage methodology to accelerate optimal search substantially in well-controlapplications. The first stage of PO comprises a global exploration of the search space using design of experiments (DOEs). Thereafter, in the second stage, a fast-to-evaluate proxy model is constructed with the points considered in the experimental design. This proxy is based on generalized barycentric coordinates (GBCs), a generalization of the concept of barycentric coordinates used within a triangle. GBCs can be especially suited to problems in which nonlinearities are not strong, as is the case often for well-control optimization. This fact is supported by the good performance in these types of optimization problems of techniques that rely strongly on linearity assumptions, such as trajectory piecewise linearization, a procedure that is not always applicable due to its simulator-intrusive nature. In the third stage, the precision of the proxy model is iteratively improved and the enhanced surrogate model is reoptimized by means of manifold mapping (MM), a method that combines models with different levels of accuracy. MM has solid theoretical foundations and leads to efficient optimization schemes in multiple engineering disciplines. The final and fourth stage aims at additional improvement, resorting to direct optimization of the best solution from the previous stages. Nonlinear (operational) constraints are handled in PO with the filter method. The optimal search may be finalized earlier than at the fourth stage whenever the solution obtained is of satisfactory quality. PO is tested on two waterflooding problems built upon a synthetic model previously studied in well-control optimization literature. In these problems, which have 120 and 40 well controls and include nonlinear constraints, we observe for PO reductions in computational cost, for solutions of comparable quality, of approximately 30% and 50% with respect to Hooke-Jeeves direct search (HJDS), which, in turn, outperforms particle swarm optimization (PSO). HJDS and PSO are simulator-nonintrusive algorithms that usually perform well in optimization for oilfield operations. The novel concepts of GBC and MM within the framework of the PO paradigm can be extremely helpful for practitioners to efficiently deal with optimized well-control management. Savings of 50% in computing cost may be translated in practice into days of computations for just a single field and optimization run.

2020 ◽  
Author(s):  
T. Silva ◽  
M. Bellout ◽  
C. Giuliani ◽  
E. Camponogara ◽  
A. Pavlov

2019 ◽  
Vol 24 (6) ◽  
pp. 1959-1978
Author(s):  
Jefferson Wellano Oliveira Pinto ◽  
Juan Alberto Rojas Tueros ◽  
Bernardo Horowitz ◽  
Silvana Maria Bastos Afonso da Silva ◽  
Ramiro Brito Willmersdorf ◽  
...  

2016 ◽  
Vol 18 (1) ◽  
pp. 105-132 ◽  
Author(s):  
Jan Dirk Jansen ◽  
Louis J. Durlofsky

Author(s):  
W. K. Schief

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.


2014 ◽  
Vol 24 (08) ◽  
pp. 1665-1699 ◽  
Author(s):  
Gianmarco Manzini ◽  
Alessandro Russo ◽  
N. Sukumar

Generalized barycentric coordinates such as Wachspress and mean value coordinates have been used in polygonal and polyhedral finite element methods. Recently, mimetic finite difference schemes were cast within a variational framework, and a consistent and stable finite element method on arbitrary polygonal meshes was devised. The method was coined as the virtual element method (VEM), since it did not require the explicit construction of basis functions. This advance provides a more in-depth understanding of mimetic schemes, and also endows polygonal-based Galerkin methods with greater flexibility than three-node and four-node finite element methods. In the VEM, a projection operator is used to realize the decomposition of the stiffness matrix into two terms: a consistent matrix that is known, and a stability matrix that must be positive semi-definite and which is only required to scale like the consistent matrix. In this paper, we first present an overview of previous developments on conforming polygonal and polyhedral finite elements, and then appeal to the exact decomposition in the VEM to obtain a robust and efficient generalized barycentric coordinate-based Galerkin method on polygonal and polyhedral elements. The consistent matrix of the VEM is adopted, and numerical quadrature with generalized barycentric coordinates is used to compute the stability matrix. This facilitates post-processing of field variables and visualization in the VEM, and on the other hand, provides a means to exactly satisfy the patch test with efficient numerical integration in polygonal and polyhedral finite elements. We present numerical examples that demonstrate the sound accuracy and performance of the proposed method. For Poisson problems in ℝ2and ℝ3, we establish that linearly complete generalized barycentric interpolants deliver optimal rates of convergence in the L2-norm and the H1-seminorm.


SPE Journal ◽  
2019 ◽  
Vol 24 (03) ◽  
pp. 912-950
Author(s):  
Abeeb A. Awotunde

Summary This paper evaluates the effectiveness of six dimension-reduction approaches. The approaches considered are the constant-control (Const) approach, the piecewise-constant (PWC) approach, the trigonometric approach, the Bessel-function (Bess) approach, the polynomial approach, and the data-decomposition approach. The approaches differ in their mode of operation, but they all reduce the number of parameters required in well-control optimization problems. Results show that the PWC approach performs better than other approaches on many problems, but yields widely fluctuating well controls over the field-development time frame. The trigonometric approach performed well on all the problems and yields controls that vary smoothly over time.


Sign in / Sign up

Export Citation Format

Share Document