On the Convergence of System-AMG in Reservoir Simulation

SPE Journal ◽  
2018 ◽  
Vol 23 (02) ◽  
pp. 589-597 ◽  
Author(s):  
Sebastian Gries

Summary System-algebraic multigrid (AMG) provides a flexible framework for linear systems in simulation applications that involve various types of physical unknowns. Reservoir-simulation applications, with their driving elliptic pressure unknown, are principally well-suited to exploit System-AMG as a robust and efficient solver method. However, the coarse grid correction must be physically meaningful to speed up the overall convergence. It has been common practice in constrained-pressure-residual (CPR) -type applications to use an approximate pressure/saturation decoupling to fulfill this requirement. Unfortunately, this can have significant effects on the AMG applicability and, thus, is not performed by the dynamic row-sum (DRS) method. This work shows that the pressure/saturation decoupling is not necessary for ensuring an efficient interplay between the coarse grid correction process and the fine-level problem, demonstrating that a comparable influence of the pressure on the different involved partial-differential equations (PDEs) is much more crucial. As an extreme case with respect to the outlined requirement, linear systems from compositional simulations under the volume-balance formulation will be discussed. In these systems, the pressure typically is associated with a volume balance rather than a diffusion process. It will be shown how System-AMG can still be used in such cases.

2012 ◽  
Vol 204-208 ◽  
pp. 4683-4687 ◽  
Author(s):  
Jian Ping Wu ◽  
Jun Qiang Song ◽  
Wei Min Zhang ◽  
Huai Fa Ma

Meso-scale simulation is one of the important ways to study dynamic behaviors of concrete materials, while most of the simulation time is used to solve the sparse linear systems. Because the discrete grid is three dimensional and is of large scale, iterations are the best solutions. But the convergence depends on the distribution of the eigenvalues of the coefficient matrix, to make the eigenvalues distributed more closely each other, it is required to adopt preconditioning techniques. In this paper, with the characteristics of the sparse linear systems considered, there provides a coarse grid correction algorithm, which is based on domain decomposition preconditioners and aggregation of sub-domains, with each aggregated into a single super-node. A linear system with small scale size is formed, which contains the global information and the solution is used to correct the solution components of the original auxiliary linear system. For incomplete factorization preconditioner parallelized with block Jacobi, classic additive Schwarz, and factors combination techniques, the experiments show that the presented algorithm can improve the convergence rate and the efficiency.


Algorithms ◽  
2020 ◽  
Vol 13 (4) ◽  
pp. 100 ◽  
Author(s):  
Luca Bergamaschi

The aim of this survey is to review some recent developments in devising efficient preconditioners for sequences of symmetric positive definite (SPD) linear systems A k x k = b k , k = 1 , … arising in many scientific applications, such as discretization of transient Partial Differential Equations (PDEs), solution of eigenvalue problems, (Inexact) Newton methods applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. In this paper, we will analyze a number of techniques of updating a given initial preconditioner by a low-rank matrix with the aim of improving the clustering of eigenvalues around 1, in order to speed-up the convergence of the Preconditioned Conjugate Gradient (PCG) method. We will also review some techniques to efficiently approximate the linearly independent vectors which constitute the low-rank corrections and whose choice is crucial for the effectiveness of the approach. Numerical results on real-life applications show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.


PAMM ◽  
2010 ◽  
Vol 10 (1) ◽  
pp. 755-756
Author(s):  
Constantin Popa ◽  
Aurelian Nicola ◽  
Ulrich Rüde

2011 ◽  
Vol 33 (5) ◽  
pp. 2706-2731 ◽  
Author(s):  
Thomas A. Brunner ◽  
Tzanio V. Kolev

Sign in / Sign up

Export Citation Format

Share Document