Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA multiscale Robin-coupled implicit method for two-phase flows in high-contrast formations
87
0
0.0
(
0
)
Added by
Franciane Rocha PhD
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In the presence of strong heterogeneities, it is well known that the use of explicit schemes for the transport of species in a porous medium suffers from severe restrictions on the time step. This has led to the development of implicit schemes that are increasingly favoured by practitioners for their computational efficiency. The transport equation requires knowledge of the velocity field, which results from an elliptic problem (Darcy problem) that is the most expensive part of the computation. When considering large reservoirs, a cost-effective way of approximating the Darcy problems is using multiscale domain decomposition (MDD) methods. They allow for the pressure and velocity fields to be computed on coarse meshes (large scale), while detailed basis functions are defined locally, usually in parallel, in a much finer grid (small scale). In this work we adopt the Multiscale Robin Coupled Method (MRCM, [Guiraldello, et al., J. Comput. Phys., 355 (2018) pp. 1-21], [Rocha, et al., J. Comput. Phys., (2020) 109316]), which is a generalization of previous MDD methods that allows for great flexibility in the choice of interface spaces. In this article we investigate the combination of the MRCM with implicit transport schemes. A sequentially implicit strategy is proposed, with different trust-region algorithms ensuring the convergence of the transport solver. The method is assessed on several very stringent 2D two-phase problems, demonstrating its stability even for large time steps. It is also shown that the best accuracy is achieved by considering recently introduced non-polynomial interface spaces, since polynomial spaces are not optimal for high-contrast channelized permeability fields.
rate research
Read More
In this work we formulate and test a new procedure, the Multiscale Perturbation Method for Two-Phase Flows (MPM-2P), for the fast, accurate and naturally parallelizable numerical solution of two-phase, incompressible, immiscible displacement in porous media approximated by an operator splitting method. The proposed procedure is based on domain decomposition and combines the Multiscale Perturbation Method (MPM) with the Multiscale Robin Coupled Method (MRCM). When an update of the velocity field is called by the operator splitting algorithm, the MPM-2P may provide, depending on the magnitude of a dimensionless algorithmic parameter, an accurate and computationally inexpensive approximation for the velocity field by reusing previously computed multiscale basis functions. Thus, a full update of all multiscale basis functions required by the MRCM for the construction of a new velocity field is avoided. There are two main steps in the formulation of the MPM-2P. Initially, for each subdomain one local boundary value problem with trivial Robin boundary conditions is solved (instead of a full set of multiscale basis functions, that would be required by the MRCM). Then, the solution of an inexpensive interface problem provides the velocity field on the skeleton of the decomposition of the domain. The resulting approximation for the velocity field is obtained by downscaling. We consider challenging two-phase flow problems, with high-contrast permeability fields and water-oil finger growth in homogeneous media. Our numerical experiments show that the use of the MPM-2P gives exceptional speed-up - almost 90% of reduction in computational cost - of two-phase flow simulations. Hundreds of MRCM solutions can be replaced by inexpensive MPM-2P solutions, and water breakthrough can be simulated with very few updates of the MRCM set of multiscale basis functions.
We present a wavelet-based adaptive method for computing 3D multiscale flows in complex, time-dependent geometries, implemented on massively parallel computers. While our focus is on simulations of flapping insects, it can be used for other flow problems, including turbulence, as well. The incompressible fluid is modeled with an artificial compressibility approach in order to avoid solving elliptical problems. No-slip and in/outflow boundary conditions are imposed using volume penalization. The governing equations are discretized on a locally uniform Cartesian grid with centered finite differences, and integrated in time with a Runge--Kutta scheme, both of 4th order. The domain is partitioned into cubic blocks with equidistant grids with different resolution and, for each block, biorthogonal interpolating wavelets are used as refinement indicators and prediction operators. Thresholding the wavelet coefficients allows to generate dynamically evolving grids, and an adaption strategy tracks the solution in both space and scale. Blocks are distributed among MPI processes and the global topology of the grid is encoded using a tree-like data structure. Analyzing the different physical and numerical parameters allows balancing their individual error contributions and thus ensures optimal convergence while minimizing computational effort. Different validation tests score accuracy and performance of our new open source code, WABBIT (Wavelet Adaptive Block-Based solver for Interactions with Turbulence), on massively parallel computers using fully adaptive grids. Flow simulations of flapping insects demonstrate its applicability to complex, bio-inspired problems.
We introduce a class of high order accurate, semi-implicit Runge-Kutta schemes in the general setting of evolution equations that arise as gradient flow for a cost function, possibly with respect to an inner product that depends on the solution, and we establish their energy stability. This class includes as a special case high order, unconditionally stable schemes obtained via convexity splitting. The new schemes are demonstrated on a variety of gradient flows, including partial differential equations that are gradient flow with respect to the Wasserstein (mass transport) distance.
In this paper, we present an efficient numerical algorithm for solving the time-dependent Cahn--Hilliard--Navier--Stokes equations that model the flow of two phases with different densities. The pressure-correction step in the projection method consists of a Poisson problem with a modified right-hand side. Spatial discretization is based on discontinuous Galerkin methods with piecewise linear or piecewise quadratic polynomials. Flux and slope limiting techniques successfully eliminate the bulk shift, overshoot and undershoot in the order parameter, which is shown to be bound-preserving. Several numerical results demonstrate that the proposed numerical algorithm is effective and robust for modeling two-component immiscible flows in porous structures and digital rocks.
Splitting is a method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. In this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. Since the spitting solution usually has an explicit and implicit part, we will call our method hybrid explicit-implict (HEI) learning. We will consider a recently introduced multiscale splitting algorithms. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem. We conduct four numerical examples and the results show that our method is stable and accurate.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
