Search arXivSearch

arXiv · 2509.16315

Nonlocal modeling of spatial fractional diffusion with truncated interaction domains and truncated kernel function singularity

Abstract

Parabolic partial differential equations (PDEs) are in ubiquitous, very effective use to model diffusion processes. However, there are many applications (e.g., such as in hydrology, animal foraging, biology, and light diffusion just do name a few) for which results obtained through the use of parabolic PDEs do not agree with observations. In many situations the use of fractional diffusion models has been found to be more faithful to that which is observed. Specifically, we replace the Laplacian operator in the PDE by a fractional Laplacian operator ${\mathcal L}$ which is an integral operator for which solutions are sought for on all of space, has an unbounded domain of integration, and for a given point $x$ the integrand contains a kernel function $ϕ(y-x)$ that is infinite whenever $y=x$. These three features pose impediments not only for the construction of efficient discretization methods but also because all three involve one or more sort of "infinity''. To overcome these impediments we choose to invoke one or more of the following strategies. (a) We seek solutions only within a chosen bounded domain $Ω$. (b) For every $x\inΩ$, we choose a bounded domain of integration such as, e.g., an Euclidean ball $B_δ(x)$ having finite radius $δ$. (c) We truncate the singularity of $ϕ(y-x)$ by setting, for a given constant $\varepsilon>0$, $ϕ(y-x)= ϕ(\varepsilon)$ whenever $|y-x|\le\varepsilon$. We then provide extensive illustrations of the possible combinations chosen from among (a), (b), and (c). We also illustrate, for the various models defined for each of these combinations, their limiting behavior of solutions such as showing that as $δ\to0$ we recover the PDE model and also showing that in the limit of some other parameters we recover the fractional Laplacian model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shiping Zhou, Yanzhi Zhang, Max Gunzburger. 2025-09-19. Nonlocal modeling of spatial fractional diffusion with truncated interaction domains and truncated kernel function singularity. https://arxiv.org/abs/2509.16315

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

KEEP EXPLORING

Related papers

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

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

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