Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1408.3891

An adaptive octree finite element method for PDEs posed on surfaces

Alexey Y. Chernyshenko·Maxim A. Olshanskii
View original source ↗Read source document ↗Export metadata ↓

Abstract

The paper develops a finite element method for partial differential equations posed on hypersurfaces in $\mathbb{R}^N$, $N=2,3$. The method uses traces of bulk finite element functions on a surface embedded in a volumetric domain. The bulk finite element space is defined on an octree grid which is locally refined or coarsened depending on error indicators and estimated values of the surface curvatures. The cartesian structure of the bulk mesh leads to easy and efficient adaptation process, while the trace finite element method makes fitting the mesh to the surface unnecessary. The number of degrees of freedom involved in computations is consistent with the two-dimension nature of surface PDEs. No parametrization of the surface is required; it can be given implicitly by a level set function. In practice, a variant of the marching cubes method is used to recover the surface with the second order accuracy. We prove the optimal order of accuracy for the trace finite element method in $H^1$ and $L^2$ surface norms for a problem with smooth solution and quasi-uniform mesh refinement. Experiments with less regular problems demonstrate optimal convergence with respect to the number of degrees of freedom, if grid adaptation is based on an appropriate error indicator. The paper shows results of numerical experiments for a variety of geometries and problems, including advection-diffusion equations on surfaces. Analysis and numerical results of the paper suggest that combination of cartesian adaptive meshes and the unfitted (trace) finite elements provide simple, efficient, and reliable tool for numerical treatment of PDEs posed on surfaces.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexey Y. Chernyshenko, Maxim A. Olshanskii. 2014-08-18. An adaptive octree finite element method for PDEs posed on surfaces. https://doi.org/10.1016/j.cma.2015.03.025

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↗