Second-order conservative remapping between unstructured spherical meshes
Seminar Room 1, Newton Institute
AbstractRemapping from one finite-dimensional description of a function to another is a common problem in numerical modelling. In particular, information transit between meshes is required for, e.g., model coupling or mesh adaptation. In order to preserve the properties of a numerical scheme such as conservativity, accuracy, positivity, etc., the remapping algorithm must itself possess these properties. A second-order, conservative remapping between unstructured spherical meshes is presented. Areas are computed exactly by the defect formula and gradients estimated by the Gauss formula. Data is tree-structured, so that neighbour search is done in logarithmic time. In addition, the algorithm lends itself well to parallelisation. Numerical tests on various unstructured grids are given.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.