Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1802.04363

On convective terms approximation approach that corresponds to pure convection

Kiril S. Shterev
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recent decades are put lots of efforts to develop a higher-order scheme for convective terms approximation that is stable and reliable. The idea presented here is that approximation approach has to correspond to the physical phenomenon described by approximated terms. Pure convection (advection) that is described by convective terms is transporting a property along the streamline, and the information propagation is unidirectional, i.e., transported property depends on previous values along the streamline but does not depend on the next ones. The proposed approach represents streamlines on mesh as discrete streamlines and is called Discrete Stream(line) Method (DStreaM). A discrete streamline here is represented as a narrow triangle with one vertex of the approximated node and two others neighbor upstream nodes. Discrete streamlines are orientated using local flow direction as skew upwind schemes. DStreaM corresponds to pure convection. Here are considered standard test problems: advection of a step profile, advection of a double-step profile, advection of a sinusoidal profile, and Smith and Hutton problem. DStreaM solutions were compared with upwind-first order scheme and second-order Total Variation Diminishing (TVD) schemes with limiters Min-Mod, QUICK, and SUPERBEE solutions. DStreaM demonstrated second-order accuracy and rapid convergence. Upwind and DStreaM need 2 or 4 iterations to reach a final solution while TVD schemes need from 15 to 93.5 more iterations. DStreaM approach looks promising for calculation of convective-dominated problems because it approximates naturally first derivatives and is straightforwardly applicable as a meshfree method or on unstructured meshes.

Explore related subjects

math.NAcs.NAphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kiril S. Shterev. 2018-10-29. On convective terms approximation approach that corresponds to pure convection. https://arxiv.org/abs/1802.04363

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↗