Application of accelerated fixed-point algorithms to hydrodynamic well-fracture coupling

05/01/2020
by   Vitalii Aksenov, et al.
0

The coupled simulations of dynamic interactions between the well, hydraulic fractures and reservoir have significant importance in some areas of petroleum reservoir engineering. Several approaches to the problem of coupling between the numerical models of these parts of the full system have been developed in the industry in past years. One of the possible approaches allowing formulation of the problem as a fixed-point problem is studied in the present work. Accelerated Anderson's and Aitken's fixed-point algorithms are applied to the coupling problem. Accelerated algorithms are compared with traditional Picard iterations on the representative set of test cases including ones remarkably problematic for coupling. Relative performance is measured, and the robustness of the algorithms is tested. Accelerated algorithms enable a significant (up to two orders of magnitude) performance boost in some cases and convergent solutions in the cases where simple Picard iterations fail. Based on the analysis, we provide recommendations for the choice of the particular algorithm and tunable relaxation parameter depending on anticipated complexity of the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2022

An Acceleration of Fixed Point Iterations for M/G/1-type Markov Chains by Means of Relaxation Techniques

We present some accelerated variants of fixed point iterations for compu...
research
09/19/2021

A link between the steepest descent method and fixed-point iterations

We will make a link between the steepest descent method for an unconstra...
research
06/29/2017

A Fixed-Point of View on Gradient Methods for Big Data

Interpreting gradient methods as fixed-point iterations, we provide a de...
research
05/27/2018

Fast K-Means Clustering with Anderson Acceleration

We propose a novel method to accelerate Lloyd's algorithm for K-Means cl...
research
09/14/2023

Learning to Warm-Start Fixed-Point Optimization Algorithms

We introduce a machine-learning framework to warm-start fixed-point opti...
research
03/12/2023

A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data

In this work, we present the Bregman Alternating Projected Gradient (BAP...
research
08/25/2020

A family of fast fixed point iterations for M/G/1-type Markov chains

We consider the problem of computing the minimal nonnegative solution G ...

Please sign up or login with your details

Forgot password? Click here to reset