Complexity bounds on supermesh construction for quasi-uniform meshes

JOURNAL OF COMPUTATIONAL PHYSICS

卷:414

Article

Croci, Matteo^1,2  Farrell, Patrick E.¹ 

[1] Univ Oxford, Math Inst, Oxford, England

[2] Simula Res Lab, Oslo, Norway

关键词: Supermesh;    Galerkin projection;    Interpolation;    Conservation;    Algorithmic complexity;    Complexity bound;   

DOI  :  10.1016/j.jcp.2020.109459

来源: Elsevier

【 摘 要 】

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 quasi-uniform meshes of n(A) and n(B) cells respectively, we show under standard assumptions that nis proportional to n(A)+ n(B). This result substantially improves on the best currently available upper bound on nand is fundamental for the analysis of algorithms that use supermeshes. (c) 2020 Elsevier Inc. All rights reserved.

【 授权许可】

Free