Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.24055

Quadrilateral and Hexahedral Immersed Finite Element Methods for Elliptic Interface Problems

Fangfang Qin·Haifeng Ji
View original source ↗Read source document ↗Export metadata ↓

Abstract

Immersed finite element (IFE) methods provide an effective framework for solving interface problems on unfitted meshes. The basic idea underlying IFE methods is to modify standard finite element spaces by enforcing interface conditions at certain points. It is known that, for nodal degrees of freedom, unisolvence of linear IFE basis functions on triangular elements is subject to a non-obtuse-angle condition for scalar diffusion coefficients. This limitation is more severe for tensor diffusion coefficients, for which the non-obtuse-angle condition is no longer sufficient for unisolvence. Even on rectangular meshes, conventional bilinear IFE basis functions may not be unisolvent for tensor diffusion coefficients. In this paper, we develop and analyze a nodal isoparametric IFE method on quadrilateral and hexahedral meshes and show that the unisolvence issue can be overcome by appropriately selecting the enforcement point of the discrete flux condition. The key observation is that, unlike triangular elements, the discrete flux in quadrilateral and hexahedral elements is not constant, which provides the flexibility to select such an enforcement point to ensure unisolvence. We provide a systematic procedure for this selection that not only ensures unisolvence of the IFE basis functions on general quadrilateral and hexahedral elements with either scalar or tensor-valued diffusion coefficients but also preserves the optimal approximation properties of the resulting IFE space. The proposed IFE method offers several advantages: flexibility for complex geometries, the absence of angle restrictions, and applicability to tensor diffusion coefficients, thereby overcoming the limitations of existing nodal IFE methods on rectangular and triangular meshes. Optimal error estimates are established and confirmed by numerical experiments.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fangfang Qin, Haifeng Ji. 2026-08-25. Quadrilateral and Hexahedral Immersed Finite Element Methods for Elliptic Interface Problems. https://arxiv.org/abs/2608.24055

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↗