Complexity bounds on supermesh construction for quasi-uniform meshes

Abstract

Projecting fields between different meshes commonly arises in computational physics. This operation requires a supermesh construction and its computational cost is proportional to the number of cells of the supermesh $n$. Given any two quasi-uniform meshes of $n_A$ and $n_B$ cells respectively, we show under standard assumptions that n is proportional to $n_A+n_B$. This result substantially improves on the best currently available upper bound on $n$ and is fundamental for the analysis of algorithms that use supermeshes.

References in corpus (1)

• Efficient white noise sampling and coupling for multilevel Monte Carlo with non-nested meshes

Cited by in corpus (2)

• A probabilistic finite element method based on random meshes: Error estimators and Bayesian inverse problems
• Multilevel quasi Monte Carlo methods for elliptic PDEs with random field coefficients via fast white noise sampling