Journal article
Complexity bounds on supermesh construction for quasi-uniform 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 quasi-uniform meshes of and cells respectively, we show under standard assumptions that n is proportional to . 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 status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 99.3KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jcp.2020.109459
Authors
- Publisher:
- Elsevier
- Journal:
- Journal of Computational Physics More from this journal
- Volume:
- 414
- Article number:
- 109459
- Publication date:
- 2020-04-09
- Acceptance date:
- 2020-04-05
- DOI:
- ISSN:
-
0021-9991
- Language:
-
English
- Keywords:
- Pubs id:
-
1074950
- Local pid:
-
pubs:1074950
- Deposit date:
-
2020-04-06
Terms of use
- Copyright holder:
- Elsevier Inc.
- Copyright date:
- 2019
- Rights statement:
- © 2020 Elsevier Inc.
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from Elsevier at https://doi.org/10.1016/j.jcp.2020.109459
If you are the owner of this record, you can report an update to it here: Report update to this record