Parallel geometric multigrid for global weather prediction

The subject of this work is an optimal and scalable parallel geometric multigrid solver for elliptic problems on the sphere, crucial to the forecasting and the data assimilation tools used at the U.K. Met office. The optimality of multilevel techniques for elliptic problems makes them a suitable cho...

Full description

Saved in:
Bibliographic Details
Published inNumerical linear algebra with applications Vol. 17; no. 2-3; pp. 325 - 342
Main Authors Buckeridge, Sean, Scheichl, Robert
Format Journal Article
LanguageEnglish
Published Chichester, UK John Wiley & Sons, Ltd 01.04.2010
Subjects
Online AccessGet full text
ISSN1070-5325
1099-1506
DOI10.1002/nla.699

Cover

More Information
Summary:The subject of this work is an optimal and scalable parallel geometric multigrid solver for elliptic problems on the sphere, crucial to the forecasting and the data assimilation tools used at the U.K. Met office. The optimality of multilevel techniques for elliptic problems makes them a suitable choice for these applications. The Met office uses spherical polar grids which, although structured, have the drawback of creating strong anisotropies near the poles. Moreover, a higher resolution in the radial direction introduces further anisotropies, and so modifications to the standard multigrid relaxation and the coarsening procedures are necessary to retain optimal efficiency. As the strength of anisotropy varies, we propose a non‐uniform strategy, coarsening the grid only in regions that are sufficiently isotropic. This is combined with line relaxation in the radial direction. The success of non‐uniform coarsening strategies has been demonstrated with algebraic multigrid (AMG) methods. Without the large setup costs required by AMG, however, we aim to surpass them with the geometric approach. We demonstrate the advantages of the method with experiments on model problems, both sequentially and in parallel, and show robustness and optimal efficiency of the method with constant convergence factors of less than 0.1. It substantially outperforms Krylov subspace methods with one‐level preconditioners and the BoomerAMG implementation of AMG on typical grid resolutions. The parallel implementation scales almost optimally on up to 256 processors, so that a global solve of the quasi‐geostrophic omega‐equation with a maximum horizontal resolution of about 10 km and 3 × 109 unknowns takes about 60 s. Copyright © 2010 John Wiley & Sons, Ltd.
Bibliography:istex:50079906FC01E12CC17650AAB3E8C67B71ECA655
ArticleID:NLA699
Great Western Research (GWR) and the U.K. Met office - No. GWR-151
ark:/67375/WNG-115P02SK-D
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1070-5325
1099-1506
DOI:10.1002/nla.699