Abstract

This paper describes a fast and reliable method for redistributing a computational mesh in three dimensions which can generate a complex three dimensional mesh without any problems due to mesh tangling. The method relies on a three dimensional implementation of the parabolic Monge-Ampère (PMA) technique, for finding an optimally transported mesh. The method for implementing PMA is described in detail and applied to both static and dynamic mesh redistribution problems, studying both the convergence and the computational cost of the algorithm. The algorithm is applied to a series of problems of increasing complexity. In particular very regular meshes are generated to resolve real meteorological features (derived from a weather forecasting model covering the UK area) in grids with over 2 × 107 degrees of freedom. The PMA method computes these grids in times commensurate with those required for operational weather forecasting.

Original languageEnglish
Pages (from-to)174-196
Number of pages23
JournalJournal of Computational Physics
Volume275
DOIs
Publication statusPublished - 15 Oct 2014

Fingerprint

Weather forecasting
mesh
weather forecasting
tangling
grids
Costs
coverings
degrees of freedom
costs

Keywords

  • Adaptive mesh redistribution
  • Monge-Ampere
  • Optimal transport
  • R-Adaptivity

ASJC Scopus subject areas

  • Physics and Astronomy (miscellaneous)
  • Computer Science Applications

Cite this

Fast three dimensional r-adaptive mesh redistribution. / Browne, P. A.; Budd, C. J.; Piccolo, C.; Cullen, M.

In: Journal of Computational Physics, Vol. 275, 15.10.2014, p. 174-196.

Research output: Contribution to journalArticle

Browne, P. A. ; Budd, C. J. ; Piccolo, C. ; Cullen, M. / Fast three dimensional r-adaptive mesh redistribution. In: Journal of Computational Physics. 2014 ; Vol. 275. pp. 174-196.
@article{cbabc3608bff450ebf2beea18e9fa065,
title = "Fast three dimensional r-adaptive mesh redistribution",
abstract = "This paper describes a fast and reliable method for redistributing a computational mesh in three dimensions which can generate a complex three dimensional mesh without any problems due to mesh tangling. The method relies on a three dimensional implementation of the parabolic Monge-Amp{\`e}re (PMA) technique, for finding an optimally transported mesh. The method for implementing PMA is described in detail and applied to both static and dynamic mesh redistribution problems, studying both the convergence and the computational cost of the algorithm. The algorithm is applied to a series of problems of increasing complexity. In particular very regular meshes are generated to resolve real meteorological features (derived from a weather forecasting model covering the UK area) in grids with over 2 × 107 degrees of freedom. The PMA method computes these grids in times commensurate with those required for operational weather forecasting.",
keywords = "Adaptive mesh redistribution, Monge-Ampere, Optimal transport, R-Adaptivity",
author = "Browne, {P. A.} and Budd, {C. J.} and C. Piccolo and M. Cullen",
year = "2014",
month = "10",
day = "15",
doi = "10.1016/j.jcp.2014.06.009",
language = "English",
volume = "275",
pages = "174--196",
journal = "Journal of Computational Physics",
issn = "0021-9991",
publisher = "Elsevier Academic Press Inc",

}

TY - JOUR

T1 - Fast three dimensional r-adaptive mesh redistribution

AU - Browne, P. A.

AU - Budd, C. J.

AU - Piccolo, C.

AU - Cullen, M.

PY - 2014/10/15

Y1 - 2014/10/15

N2 - This paper describes a fast and reliable method for redistributing a computational mesh in three dimensions which can generate a complex three dimensional mesh without any problems due to mesh tangling. The method relies on a three dimensional implementation of the parabolic Monge-Ampère (PMA) technique, for finding an optimally transported mesh. The method for implementing PMA is described in detail and applied to both static and dynamic mesh redistribution problems, studying both the convergence and the computational cost of the algorithm. The algorithm is applied to a series of problems of increasing complexity. In particular very regular meshes are generated to resolve real meteorological features (derived from a weather forecasting model covering the UK area) in grids with over 2 × 107 degrees of freedom. The PMA method computes these grids in times commensurate with those required for operational weather forecasting.

AB - This paper describes a fast and reliable method for redistributing a computational mesh in three dimensions which can generate a complex three dimensional mesh without any problems due to mesh tangling. The method relies on a three dimensional implementation of the parabolic Monge-Ampère (PMA) technique, for finding an optimally transported mesh. The method for implementing PMA is described in detail and applied to both static and dynamic mesh redistribution problems, studying both the convergence and the computational cost of the algorithm. The algorithm is applied to a series of problems of increasing complexity. In particular very regular meshes are generated to resolve real meteorological features (derived from a weather forecasting model covering the UK area) in grids with over 2 × 107 degrees of freedom. The PMA method computes these grids in times commensurate with those required for operational weather forecasting.

KW - Adaptive mesh redistribution

KW - Monge-Ampere

KW - Optimal transport

KW - R-Adaptivity

UR - http://www.scopus.com/inward/record.url?scp=84904747324&partnerID=8YFLogxK

UR - https://doi.org/10.1016/j.jcp.2014.06.009

U2 - 10.1016/j.jcp.2014.06.009

DO - 10.1016/j.jcp.2014.06.009

M3 - Article

VL - 275

SP - 174

EP - 196

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

ER -