Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.09393

A Numerical Study of WENO Approximations to Sharp Propagating Fronts for Reaction-Diffusion Systems

Jiaxi Gu·Daniel Olmos-Liceaga·Jae-Hun Jung
View original source ↗Read source document ↗Export metadata ↓

Abstract

Many reaction-diffusion systems in various applications exhibit traveling wave solutions that evolve on multiple spatio-temporal scales. These traveling wave solutions are crucial for understanding the underlying dynamics of the system. In this work, we present sixth-order weighted essentially non-oscillatory (WENO) methods within the finite difference framework to solve reaction-diffusion systems. The WENO method allows us to use fewer grid points and larger time steps compared to classical finite difference methods. Our focus is on solving the reaction-diffusion system for the traveling wave solution with the sharp front. Although the WENO method is popular for hyperbolic conservation laws, especially for problems with discontinuity, it can be adapted for the equations of parabolic type, such as reaction-diffusion systems, to effectively handle sharp wave fronts. Thus, we employed the WENO methods specifically developed for equations of parabolic type. We considered various reaction-diffusion equations, including Fisher's, Zeldovich, Newell-Whitehead-Segel, bistable equations, and the Lotka-Volterra competition-diffusion system, all of which yield traveling wave solutions with sharp wave fronts. Numerical examples in this work demonstrate that the central WENO method is highly more accurate and efficient than the commonly used finite difference method. We also provide an analysis related to the numerical speed of the sharp propagating front in the Newell-Whitehead-Segel equation. The overall results confirm that the central WENO method is highly efficient and is recommended for solving reaction-diffusion equations with sharp wave fronts.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaxi Gu, Daniel Olmos-Liceaga, Jae-Hun Jung. 2024-07-12. A Numerical Study of WENO Approximations to Sharp Propagating Fronts for Reaction-Diffusion Systems. https://arxiv.org/abs/2407.09393

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↗