Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.16822

Harmonic potentials in the de Rham complex

Martin Campos Pinto·Julian Owezarek
View original source ↗Read source document ↗Export metadata ↓

Abstract

Representing vector fields by potentials can be a challenging task in domains with cavities or tunnels, due to the presence of harmonic fields which are both irrotational and solenoidal but may have no scalar or vector potentials. For harmonic fields normal to the boundary, which exist in domains with cavities, the standard approach is to construct scalar potentials by solving Laplace's equation with Dirichlet boundary conditions fitted to the closed surfaces surrounding the domain's cavities. For harmonic fields tangent to the boundary, which exist in domains with tunnels, a similar method was lacking. In this article we present a construction of vector potentials obtained from curl-curl problems with inhomogeneous boundary conditions fitted to closed curves looping around the tunnels. Just as the cavity surfaces represent a basis for the 2-chain homology group, the tunnel curves represent a basis for the 1-chain homology group and the corresponding vector potentials yield a basis for the tangent harmonic fields. In our analysis the linear independence of the harmonic fields is guaranteed by their fluxes through a collection of reciprocal surfaces. These surfaces, whose boundaries lie on the boundary of the domain and which are in intersection duality with the tunnel curves, represent a basis for the relative 2-chain homology group modulo the boundary: their existence in general domains follows from the Poincare-Lefschetz duality. Applied to structure-preserving finite elements with commuting projections and standard compatibility properties on the boundaries, our approach provides an exact geometric parametrization of the discrete harmonic fields in terms of (strong) discrete potentials. An interesting by-product is a direct proof that the resulting discrete harmonic spaces have the correct dimensions, which does not rely on uniform stability properties for the commuting projections.

Explore related subjects

math.NAcs.NAphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Campos Pinto, Julian Owezarek. 2026-08-16. Harmonic potentials in the de Rham complex. https://arxiv.org/abs/2508.16822

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↗