On numerical stabilization in modeling double-diffusive viscous fingering

M. Shabouei; K. B. Nakshatrala

Home/Archive/arXiv

arXiv · 1907.03859

On numerical stabilization in modeling double-diffusive viscous fingering

M. Shabouei·K. B. Nakshatrala

View original source ↗Read source document ↗Export metadata ↓

Abstract

A firm understanding and control of viscous fingering (VF) and miscible displacement will be vital to a wide range of industrial, environmental, and pharmaceutical applications, such as geological carbon-dioxide sequestration, enhanced oil recovery, and drug delivery. We restrict our study to VF, a well-known hydrodynamic instability, in miscible fluid systems but consider double-diffusive (DD) effects---the combined effect of compositional changes because of solute transport and temperature. One often uses numerical formulations to study VF with DD effects. The primary aim of the current study is to show that popular formulations have limitations to study VF with DD effect. These limitations include exhibiting node-to-node spurious oscillations, violating physical constraints such as the non-negativity of the concentration field or mathematical principles such as the maximum principle, and suppressing physical instabilities. We will use several popular stabilized finite element formulations---the SUPG formulations and three modifications based on the SOLD approach---in our study. Using representative numerical results, we will illustrate two critical limitations. First, we document that these formulations do not respect the non-negative constraint and the maximum principle for the concentration field. We will also show the impact of these violations on how viscous fingers develop. Second, we show that these stabilized formulations, often used to suppress numerical instabilities, may also suppress physical instabilities, such as viscous fingering. Our study will be valuable to practitioners who use existing numerical formulations and to computational mathematicians who develop new formulations.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

M. Shabouei, K. B. Nakshatrala. 2019-07-08. On numerical stabilization in modeling double-diffusive viscous fingering. https://arxiv.org/abs/1907.03859

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↗