Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2011.06411

Inexact Methods for Sequential Fully Implicit (SFI) Reservoir Simulation

Jiamin Jiang·Pavel Tomin·Yifan Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

The sequential fully implicit (SFI) scheme was introduced (Jenny et al. 2006) for solving coupled flow and transport problems. Each time step for SFI consists of an outer loop, in which there are inner Newton loops to implicitly and sequentially solve the pressure and transport sub-problems. In standard SFI, the sub-problems are usually solved with tight tolerances at every outer iteration. This can result in wasted computations that contribute little progress towards the coupled solution. The issue is known as `over-solving'. Our objective is to minimize the cost of inner solvers while maintaining the convergence rate of SFI. We first extended a nonlinear-acceleration (NA) framework (Jiang and Tchelepi 2019) to multi-component compositional models, for ensuring robust outer-loop convergence. We then developed inexact-type methods that alleviate `over-solving'. It is found that there is no need for one sub-problem to strive for perfection, while the coupled (outer) residual remains high due to the other sub-problem. The new SFI solver was tested using several complex cases. The problems involve multi-phase and EoS-based compositional fluid systems. We compared different strategies such as fixed relaxations on absolute and relative tolerances for the inner solvers, as well as an adaptive approach. The results show that the basic SFI method is quite inefficient. Away from a coupled solution, additional accuracy achieved in inner solvers is wasted, contributing to little or no reduction of the overall outer residual. By comparison, the adaptive inexact method provides relative tolerances adequate for the current convergence state of the sub-problems. We show across a wide range of flow conditions that the new solver can effectively resolve the over-solving issue, and thus greatly improve the overall efficiency.

Explore related subjects

math.NAcs.CEcs.NAphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiamin Jiang, Pavel Tomin, Yifan Zhou. 2021-08-04. Inexact Methods for Sequential Fully Implicit (SFI) Reservoir Simulation. https://doi.org/10.1007/s10596-021-10072-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗