Search arXivSearch

arXiv · 2510.06653

Mass-Lumped Virtual Element Method with Strong Stability-Preserving Runge-Kutta Time Stepping for Two-Dimensional Parabolic Problems

Abstract

This paper presents a mass-lumped Virtual Element Method (VEM) with explicit Strong Stability-Preserving Runge--Kutta (SSP-RK) time integration for two-dimensional parabolic problems on general polygonal meshes. A diagonal mass matrix is constructed via row-sum operations combined with flooring to ensure uniform positivity. Stabilization terms vanish identically under row summation, so the lumped weights derive solely from the $L^2$ projector and are computable through a small polynomial system at cost $\mathcal{O}(N_k^3)$ per element. The resulting lumped bilinear form satisfies $L^2$-equivalence with constants independent of the number of element edges, yielding a symmetric positive definite discrete inner product. A mesh-robust spectral estimate is established, showing that the largest eigenvalue of the discrete diffusion operator scales like $h^{-2}$, with constants depending only on the space dimension, polynomial degree, and mesh regularity. This yields the classical diffusion-type CFL condition $Δt=\mathcal{O}(h^2)$ for forward Euler stability and extends to higher-order SSP-RK schemes, ensuring the preservation of stability properties inherited from the forward Euler step. Numerical experiments on distorted quadrilateral, serendipity, and Voronoi meshes validate the theoretical predictions: for $k=1$, the lumped VEM attains optimal convergence rates, namely $\mathcal{O}(h)$ in the $H^1$-seminorm and $\mathcal{O}(h^2)$ in the $L^2$-norm, without degradation due to mesh distortion or diagonal mass approximation, while the SSP-RK methods remain stable under the predicted $Δt\propto h^2$ scaling. Additional tests on accuracy versus efficiency and on heterogeneous anisotropic diffusion further illustrate the practical competitiveness and robustness of the proposed formulation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paulo Akira F. Enabe, Rodrigo Provasi. 2026-03-07. Mass-Lumped Virtual Element Method with Strong Stability-Preserving Runge-Kutta Time Stepping for Two-Dimensional Parabolic Problems. https://arxiv.org/abs/2510.06653

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

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA