Adaptively Localized Continuation-Newton Method—Nonlinear Solvers That Converge All the Time

SPE Journal ◽  
2009 ◽  
Vol 15 (02) ◽  
pp. 526-544 ◽  
Author(s):  
R.M.. M. Younis ◽  
H.A.. A. Tchelepi ◽  
K.. Aziz

Summary Growing interest in understanding, predicting, and controlling advanced oil-recovery methods emphasizes the importance of numerical methods that exploit the nature of the underlying physics. The fully implicit method offers unconditional stability of the discrete approximations. This stability comes at the expense of transferring the inherent physical stiffness onto the coupled nonlinear residual equations that are solved at each timestep. Current reservoir simulators apply safeguarded variants of Newton's method that can neither guarantee convergence nor provide estimates of the relation between convergence rate and timestep size. In practice, timestep chops become necessary and are guided heuristically. With growing complexity, such as in thermally reactive compositional flows, convergence difficulties can lead to substantial losses in computational effort and prohibitively small timesteps. We establish an alternative class of nonlinear iteration that converges and associates a timestep to each iteration. Moreover, the linear solution process within each iteration is performed locally. By casting the nonlinear residual equations for a given timestep as an initial-value problem, we formulate a continuation-based solution process that associates a timestep size with each iteration. Subsequently, no iterations are wasted and a solution is always attainable. Moreover, we show that the rate of progression is as rapid as that for a convergent standard Newton method. Moreover, by exploiting the local nature of nonlinear wave propagation typical to multiphase-flow problems, we establish a linear solution process that performs computation only where necessary. That is, given a linear convergence tolerance, we identify a minimal subset of solution components that will change by more than the specified tolerance. Using this a priori criterion, each linear step solves a reduced system of equations. Several challenging examples are presented, and the results demonstrate the robustness and computational efficiency of the proposed method.

2014 ◽  
Vol 31 (7) ◽  
pp. 1582-1607 ◽  
Author(s):  
Pedro Miguel de Almeida Areias ◽  
Timon Rabczuk ◽  
Joaquim Infante Barbosa

Purpose – The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach – Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings – When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/implications – Large, non-linear problems with constraints typically make use of the Newton method with Lagrange multipliers. In the context of the solution of problems with large number of constraints, the matrix transformation methods (MTM) are often more cost-effective. The paper presents a complete solution, with topological ordering, for this problem. Practical implications – A complete software package in Fortran 2003 is described. Examples of clique-based problems are shown with large systems solved in core. Social implications – More realistic non-linear problems can be solved with this Frontal code at the core of the Newton method. Originality/value – Use of topological ordering of constraints. A-priori pivot and front sequences. No need for symbolic assembling. Constraints treated at the core of the Frontal solver. Use of OpenMP in the main Frontal loop, now quantified. Availability of Software.


Meccanica ◽  
2021 ◽  
Author(s):  
Noelia Bazarra ◽  
Alberto Castejón ◽  
José R. Fernández ◽  
Ramón Quintanilla

AbstractIn this work we study, from the numerical point of view, a one-dimensional thermoelastic problem where the thermal law is of type III. Quasi-static microvoids are also assumed within the model. The variational formulation leads to a coupled linear system made of variational equations and it is written in terms of the velocity, the volume fraction and the temperature. Fully discrete approximations are introduced by using the finite element method and the backward Euler method. A discrete stability property and a priori error estimates are proved, deriving the linear convergence under adequate additional regularity. Finally, some numerical simulations are presented to demonstrate the accuracy of the approximation and the behavior of the solution.


2012 ◽  
Vol 23 (5) ◽  
pp. 635-657 ◽  
Author(s):  
J. R. FERNÁNDEZ ◽  
J. M. GARCÍA-AZNAR ◽  
R. MARTÍNEZ

Although in recent years bone piezoelectricity has been normally neglected, lately a new interest has appeared to show the importance of bone piezoelectricity in wet bone's complex response to loading. Here we numerically study a problem, including a strain-adaptive bone remodelling and the piezoelectricity. Its variational formulation leads to a coupled system composed of two linear variational equations for displacements and electric potential, and a parabolic variational inequality for the apparent density. Fully discrete approximations are now introduced by using the finite element method to approximate spatial variable and the explicit Euler scheme to discretise time derivatives. Some a priori error estimates are proved and the linear convergence of the algorithm is deduced under additional regularity conditions. Finally, some one- and two-dimensional numerical simulations are described to show the accuracy of the proposed algorithm and the behaviour of the solution.


2009 ◽  
Vol 3 (2) ◽  
pp. 37-48
Author(s):  
Waldemar Kaczmarczyk

This paper presents some important alternatives for modelling Lot-Sizing and Scheduling Problems. First, the accuracy of models can improved by using short time buckets, which allow more detailed planning but lead to higher computational effort. Next, valid inequalities make the models tighter but increase their size. Sometimes it is possible to find a good balance between the size and tightness of a model by limiting a priori the number of valid inequalities. Finally, a special normalization of the variables simplifies the presentation of results and validation of models.


2021 ◽  
Author(s):  
Kamlesh Kumar ◽  
Varun Pathak ◽  
Pankaj Agrawal ◽  
Zaal Alias ◽  
Tushar Narwal ◽  
...  

Abstract Effective gas utilization is critical to any gas injection development project to maximize recoveries for a given purchase of make-up gas, whilst reducing the Green Gas House (GHG) emissions. This paper describes the use of a fully implicit Integrated Production System Model (IPSM) for two inter-connected production system networks, coupling multiple, critically sour oil reservoirs undergoing Miscible Gas Injection (MGI) for Enhanced Oil Recovery (EOR) using produced sour gas from oil and condensate fields in South Oman. The IPSM model links sixteen reservoir models with varying levels of complexities to the facilities network. Complexities in the facilities include multiple nodal constraints that necessitate the use of an Equation of State model (EOS). The IPSM model honors the gas balance implicitly. Gas flood optimization includes prioritizing low GOR production wells (at reservoir and well level) whilst maintaining reservoir pressure above Minimum Miscibility Pressures (MMP). Development schedule optimization also helps in optimizing the compressor size, the key Capex component. Compositional modeling allows continuous tracking of souring levels at different nodes, providing integrity status of overall production system network. The current IPSM model helps in optimization of schedule for the phased development of the oil reservoirs and eventually the most efficient gas utilization. This has enabled low pressure operation in some reservoirs providing oil at very low unit technical cost while waiting for gas availability. Compositional tracking for H2S helps in operating the facilities within design limits whilst planning future developments to cater to this design. Some key parameters can be parameterized for quick sensitivity analysis for an informed decision making for business opportunities. The production potential of the system is also tracked to ensure there is a cushion in the system to deal with any unexpected changes. This feature helps in planning and optimizing the scheduled turn-around activities for these two inter-connected production system networks. The novelty of this work is collaboration across multiple disciplines, especially the surface and subsurface because of complex interactions between facilities constraints and reservoir performance (associated with produced gas reinjection). Compositional tracking and injection gas apportionment across multiple reservoirs is key to the overall value maximization in this complex development.


Micromachines ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 386
Author(s):  
Olatunji Mumini Omisore ◽  
Shipeng Han ◽  
Yousef Al-Handarish ◽  
Wenjing Du ◽  
Wenke Duan ◽  
...  

Success of the da Vinci surgical robot in the last decade has motivated the development of flexible access robots to assist clinical experts during single-port interventions of core intrabody organs. Prototypes of flexible robots have been proposed to enhance surgical tasks, such as suturing, tumor resection, and radiosurgery in human abdominal areas; nonetheless, precise constraint control models are still needed for flexible pathway navigation. In this paper, the design of a flexible snake-like robot is presented, along with the constraints model that was proposed for kinematics and dynamics control, motion trajectory planning, and obstacle avoidance during motion. Simulation of the robot and implementation of the proposed control models were done in Matlab. Several points on different circular paths were used for evaluation, and the results obtained show the model had a mean kinematic error of 0.37 ± 0.36 mm with very fast kinematics and dynamics resolution times. Furthermore, the robot’s movement was geometrically and parametrically continuous for three different trajectory cases on a circular pathway. In addition, procedures for dynamic constraint and obstacle collision detection were also proposed and validated. In the latter, a collision-avoidance scheme was kept optimal by keeping a safe distance between the robot’s links and obstacles in the workspace. Analyses of the results showed the control system was optimal in determining the necessary joint angles to reach a given target point, and motion profiles with a smooth trajectory was guaranteed, while collision with obstacles were detected a priori and avoided in close to real-time. Furthermore, the complexity and computational effort of the algorithmic models were negligibly small. Thus, the model can be used to enhance the real-time control of flexible robotic systems.


Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1214 ◽  
Author(s):  
Noelia Bazarra ◽  
José A. López-Campos ◽  
Marcos López ◽  
Abraham Segade ◽  
José R. Fernández

In this work, we numerically study a thermo-mechanical problem arising in poro-viscoelasticity with the type III thermal law. The thermomechanical model leads to a linear system of three coupled hyperbolic partial differential equations, and its weak formulation as three coupled parabolic linear variational equations. Then, using the finite element method and the implicit Euler scheme, for the spatial approximation and the discretization of the time derivatives, respectively, a fully discrete algorithm is introduced. A priori error estimates are proved, and the linear convergence is obtained under some suitable regularity conditions. Finally, some numerical results, involving one- and two-dimensional examples, are described, showing the accuracy of the algorithm and the dependence of the solution with respect to some constitutive parameters.


Author(s):  
E. F. G. van Daalen ◽  
J. L. Cozijn ◽  
C. Loussouarn ◽  
P. W. Hemker

In this paper we present a generic optimization algorithm for the allocation of dynamic positioning actuators, such as azimuthing thrusters and fixed thrusters. The algorithm is based on the well-known Lagrange multipliers method. In the present approach the Lagrangian functional represents not only the cost function (the total power delivered by all actuators), but also all constraints related to thruster saturation and forbidden zones for azimuthing thrusters. In the presented approach the application of the Lagrange multipliers method leads to a nonlinear set of equations, because an exact expression for the total power is applied and the actuator limitations are accounted for in an implicit manner, by means of nonlinear constraints. It is solved iteratively with the Newton-Raphson method and a step by step implementation of the constraints related to the actuator limitations. In addition, the results from the non-linear solution method were compared with the results from a simplified set of linear equations, based on an approximate (quadratic) expression for the thruster power. The non-linear solution was more accurate, while requiring only a slightly higher computational effort. An example is shown for a thruster configuration with 8 azimuthing thrusters, typical for a DP semi-submersible. The results show that the optimization algorithm is very stable and efficient. Finally, some options for improvements and future enhancements — such as including thruster-thruster and thruster-hull interactions and the effects of current — are discussed.


SPE Journal ◽  
2017 ◽  
Vol 22 (05) ◽  
pp. 1542-1569 ◽  
Author(s):  
Soham M. Sheth ◽  
Rami M. Younis

Summary Implicit-reservoir-simulation models offer improved robustness compared with semi-implicit or explicit alternatives. The implicit treatment gives rise to a large nonlinear algebraic system of equations that must be solved at each timestep. Newton-like iterative methods are often used to solve these nonlinear systems. At each nonlinear iteration, large and sparse linear systems must be solved to obtain the Newton update vector. It is observed that these computed Newton updates are often sparse, even though the sum of the Newton updates over a converged iteration may not be. Sparsity in the Newton update suggests the presence of a spatially localized propagation of corrections along the nonlinear iteration sequence. Substantial computational savings may be realized by restricting the linear-solution process to obtain only the nonzero update elements. This requires an a priori identification of the set of nonzero update elements. To preserve the convergence behavior of the original Newton-like process, it is necessary to avoid missing any nonzero element in the identification procedure. This ensures that the localized and full linear computations result in the same solution. As a first step toward the development of such a localization method for general fully implicit simulation, the focus is on sequential implicit methods for general two-phase flow. Theoretically conservative, a priori estimates of the anticipated Newton-update sparsity pattern are derived. The key to the derivation of these estimates is in forming and solving simplified forms of infinite-dimensional Newton iteration for the semidiscrete residual equations. Upon projection onto the discrete mesh, the analytical estimates produce a conservative indication on the update's sparsity pattern. The algorithm is applied to several large-scale computational examples, and more than a 10-fold reduction in simulation time is attained. The results of the localized and full simulations are identical, as is the nonlinear convergence behavior.


Sign in / Sign up

Export Citation Format

Share Document