Complexity bounds on supermesh construction for quasi-uniform meshes

Author: 

Croci, M
Farrell, P

Publication Date: 

9 April 2020

Journal: 

Journal of Computational Physics

Last Updated: 

2021-11-28T09:45:19.8+00:00

Volume: 

414

DOI: 

10.1016/j.jcp.2020.109459

page: 

109459-109459

abstract: 

Projecting fields between different meshes commonly arises in computational
physics. This operationmay require a supermesh
construction and in this case 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.

Symplectic id: 

1074950

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article