Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere

The construction of spherical grids is, to a large extent, a question of organized programming. Such grids come in the form of rhomboidal/triangular grids and hexagonal grids. We are here mainly interested in Local-Galerkin high-order schemes and consider the classical fourth-order o4 method for com...

Full description

Bibliographic Details
Main Author: Jürgen Steppeler
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Atmosphere
Subjects:
Online Access:https://www.mdpi.com/2073-4433/14/6/966
_version_ 1797596147344211968
author Jürgen Steppeler
author_facet Jürgen Steppeler
author_sort Jürgen Steppeler
collection DOAJ
description The construction of spherical grids is, to a large extent, a question of organized programming. Such grids come in the form of rhomboidal/triangular grids and hexagonal grids. We are here mainly interested in Local-Galerkin high-order schemes and consider the classical fourth-order o4 method for comparison. High-order Local-Galerkin schemes imply sparse grids in a natural way, with an expected saving of computer runtime. Sparse grids on the sphere are described for rhomboidal and hexagonal cells. They are obtained by not using some of the full grid points. Technical problems and grid organization will be discussed with the purpose of reaching fully realistic applications. We present the description of a programming concept allowing people, using different programming styles at different locations, to work together. The concept of geometric files is introduced. Such geometric files can be offered for downloading and are supposed to allow Local-Galerkin methods to be introduced into an existing model with little effort. When the geometric files are known, the solution on a spherical grid is equivalent to the limited-area Galerkin solutions on the (irregular) plane grids on the patches. The proposed grids can be used with spectral elements (SE) and the Local-Galerkin methods o2o3 and o3o3. The latter offer an increased numerical efficiency which, in a toy model test, resulted in a ten-times-reduced computer run time.
first_indexed 2024-03-11T02:47:25Z
format Article
id doaj.art-143ac5db9df8408398314894fe9d36c7
institution Directory Open Access Journal
issn 2073-4433
language English
last_indexed 2024-03-11T02:47:25Z
publishDate 2023-05-01
publisher MDPI AG
record_format Article
series Atmosphere
spelling doaj.art-143ac5db9df8408398314894fe9d36c72023-11-18T09:14:22ZengMDPI AGAtmosphere2073-44332023-05-0114696610.3390/atmos14060966Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_SphereJürgen Steppeler0Climate Service Center Germany (GERICS), Helmholtz-Zentrum Hereon, Fischertwiete 1, 20095 Hamburg, GermanyThe construction of spherical grids is, to a large extent, a question of organized programming. Such grids come in the form of rhomboidal/triangular grids and hexagonal grids. We are here mainly interested in Local-Galerkin high-order schemes and consider the classical fourth-order o4 method for comparison. High-order Local-Galerkin schemes imply sparse grids in a natural way, with an expected saving of computer runtime. Sparse grids on the sphere are described for rhomboidal and hexagonal cells. They are obtained by not using some of the full grid points. Technical problems and grid organization will be discussed with the purpose of reaching fully realistic applications. We present the description of a programming concept allowing people, using different programming styles at different locations, to work together. The concept of geometric files is introduced. Such geometric files can be offered for downloading and are supposed to allow Local-Galerkin methods to be introduced into an existing model with little effort. When the geometric files are known, the solution on a spherical grid is equivalent to the limited-area Galerkin solutions on the (irregular) plane grids on the patches. The proposed grids can be used with spectral elements (SE) and the Local-Galerkin methods o2o3 and o3o3. The latter offer an increased numerical efficiency which, in a toy model test, resulted in a ten-times-reduced computer run time.https://www.mdpi.com/2073-4433/14/6/966spherical gridsGalerkinsoftware engineering
spellingShingle Jürgen Steppeler
Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
Atmosphere
spherical grids
Galerkin
software engineering
title Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
title_full Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
title_fullStr Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
title_full_unstemmed Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
title_short Spherical Grid Creation and Modeling Using the Galerkin Compiler GC_Sphere
title_sort spherical grid creation and modeling using the galerkin compiler gc sphere
topic spherical grids
Galerkin
software engineering
url https://www.mdpi.com/2073-4433/14/6/966
work_keys_str_mv AT jurgensteppeler sphericalgridcreationandmodelingusingthegalerkincompilergcsphere