Search arXiv⌕ Search

arXiv · 2611.09813

A virtual element exterior calculus framework

Abstract

We develop a conforming virtual element framework for differential forms on general polytopal meshes in arbitrary dimension and at arbitrary order. Recursive local Hodge-Laplace boundary value problems define a trimmed virtual de Rham complex, from which moment constraints yield a complete subcomplex. The local spaces of these two complexes contain the trimmed and complete polynomial spaces of differential forms, respectively, and admit unisolvent degrees of freedom and computable polynomial projections. The canonical interpolants commute with the exterior derivative, and both complexes have cohomology isomorphic to that of the continuous de Rham complex. For both virtual families, we establish negative-norm inverse estimates and mesh-uniform norm equivalences in all form degrees. We further derive canonical interpolation error bounds and discrete Poincar'e inequalities. As an application, we obtain an inf-sup stable mixed Hodge-Laplace method with harmonic variables and optimal-order convergence under sufficient regularity. Moreover, the two conforming complexes are cochain isomorphic to their fully discrete counterparts (J. Eur. Math. Soc., 2025, doi:10.4171/JEMS/1602), and the norm equivalences provide a key analytical bridge between the conforming and fully discrete formulations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaojing Dong, Yibing Han, Yunqing Huang. 2026-11-06. A virtual element exterior calculus framework. https://arxiv.org/abs/2611.09813

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

KEEP EXPLORING

Related papers

The Finite Difference Method, for the heat equation on Sierpiński simplices

In the sequel, we extend our previous work on the Minkowski Curve to Sierpiński simplices (Gasket and Tetrahedron), in the case of the heat equation. First, we build the finite difference scheme. Then, we give a theoretical study of the error, compute the scheme error, give stability conditions, and prove the convergence of the scheme. Contrary to existing work, we do not call for approximations of the eigenvalues.

math.NA↗

Automatic Synthesis of Low-Complexity Translation Operators for the Fast Multipole Method

The FMM is the leading approach for attaining linear complexity in the evaluation of long-range (e.g. Coulomb) many-body interactions. We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is dimension-independent (demonstrated in 2D and 3D) and applicable to any translation-invariant kernel. Low complexity in translation operators for the FMM is usually achieved by algorithms specialized for a potential obeying a specific partial differential equation (PDE). Absent a PDE or specialized algorithms, Taylor series based FMMs or kernel-independent FMM have been used, at asymptotically higher expense. When symbolically provided with a constant-coefficient elliptic PDE obeyed by the potential, our algorithm can automatically synthesize translation operators requiring $\mathrm{O}(p^d)$ operations, where $p$ is the expansion order and $d$ is dimension, compared with $\mathrm{O}(p^{2d})$ operations in a naive approach carried out on (Cartesian) Taylor expansions. This is achieved by using a compression scheme that asymptotically reduces the number of terms in the Taylor expansion and then operating directly on this "compressed" representation. Judicious exploitation of shared subexpressions permits formation, translation, and evaluation of local and multipole expansions to be performed in $\mathrm{O}(p^d)$ operations, while an FFT-based scheme permits multipole-to-local translations in $\mathrm{O}(p^{d-1}\log(p))$ operations. We demonstrate computational scaling of code generation and evaluation as well as numerical accuracy through numerical experiments on a number of potentials from classical physics.

math.NA↗

Novel technique based on Léja Points Approximation for Log-determinant Estimation of Large matrices

The computation of the Log-determinant of large, sparse, symmetric positive definite (SPD) matrices is essential in many scientific computational fields such as numerical linear algebra and machine learning. In low dimensions, Cholesky is preferred, but in high dimensions, its computation may be prohibitive due to memory limitation. To circumvent this, Krylov subspace techniques have proven to be efficient but may be computationally expensive due to the required orthogonalization processes. In this paper, we introduce a Newton-Léja interpolation based approach for estimating log-determinants, where the implementation is only based on matrix multiplications and a rough estimation of eigenvalue bounds of the matrix. The method employs an adaptive stopping criterion to select the degree of interpolation according to the data and introduces a centered, scaled-based formulation for computing the logarithmic divided differences. By combining Newton-Léja interpolation with a randomized algorithm called Hutch++, we obtain a matrix-free log-determinant estimation framework that avoids explicit matrix factorization and Krylov basis orthogonalization. We establish approximation error bounds for the Newton-Léja interpolation and derive an inexact oracle error bound that separates stochastic trace estimation from the approximation errors in the projected and residual components. Numerical experiments on both large sparse synthetic matrices (Gaussian Markov Random fields) and large-scale real-world matrices demonstrate that our method substantially reduces computational time while retaining competitive accuracy, thereby confirming its effectiveness, scalability, and favorable accuracy-cost trade-off for large-scale log-determinant estimation compared with stochastic Lanczos quadrature (SLQ) and related stochastic trace-estimation methods.

math.NA↗