Complexity bounds on supermesh construction for quasiuniform meshes
Abstract
Projecting fields between different meshes commonly arises in computational physics. This operation may 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 quasiuniform 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.
 Publication:

Journal of Computational Physics
 Pub Date:
 August 2020
 DOI:
 10.1016/j.jcp.2020.109459
 arXiv:
 arXiv:1911.11589
 Bibcode:
 2020JCoPh.41409459C
 Keywords:

 Supermesh;
 Galerkin projection;
 Interpolation;
 Conservation;
 Algorithmic complexity;
 Complexity bound;
 Mathematics  Numerical Analysis;
 65D05;
 65D18;
 68Q25;
 68U05
 EPrint:
 doi:10.1016/j.jcp.2020.109459