Search arXivSearch

arXiv · 2609.00091

A coercive space-time variational approach to fractional diffusion problems

Abstract

We consider a fractional diffusion problem with temporal nonlocality acting on the diffusive flux. A coercive space--time variational formulation in Bochner-valued fractional Sobolev spaces is derived and the existence, uniqueness, and regularity of solutions are established. We further develop a conforming tensor-product Galerkin discretization and prove quasi-optimal error estimates in the anisotropic energy norm and improved convergence rates in weaker norms using duality arguments. In contrast to some space-time formulations for classical diffusion, the method preserves the causal structure of the evolution problem and leads to a time-stepping procedure with memory terms. On uniform time grids, the discrete history operator has a lower-triangular Toeplitz structure which enables an efficient implementation using fast recursive convolution techniques.

Explore related subjects

Keep this discovery

BibTeXRIS

Herbert Egger, Marvin Fritz, Barbara Wohlmuth. 2026-08-31. A coercive space-time variational approach to fractional diffusion problems. https://arxiv.org/abs/2609.00091

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA