473 research outputs found
Efficient Multigrid Preconditioners for Atmospheric Flow Simulations at High Aspect Ratio
Many problems in fluid modelling require the efficient solution of highly
anisotropic elliptic partial differential equations (PDEs) in "flat" domains.
For example, in numerical weather- and climate-prediction an elliptic PDE for
the pressure correction has to be solved at every time step in a thin spherical
shell representing the global atmosphere. This elliptic solve can be one of the
computationally most demanding components in semi-implicit semi-Lagrangian time
stepping methods which are very popular as they allow for larger model time
steps and better overall performance. With increasing model resolution,
algorithmically efficient and scalable algorithms are essential to run the code
under tight operational time constraints. We discuss the theory and practical
application of bespoke geometric multigrid preconditioners for equations of
this type. The algorithms deal with the strong anisotropy in the vertical
direction by using the tensor-product approach originally analysed by B\"{o}rm
and Hiptmair [Numer. Algorithms, 26/3 (2001), pp. 219-234]. We extend the
analysis to three dimensions under slightly weakened assumptions, and
numerically demonstrate its efficiency for the solution of the elliptic PDE for
the global pressure correction in atmospheric forecast models. For this we
compare the performance of different multigrid preconditioners on a
tensor-product grid with a semi-structured and quasi-uniform horizontal mesh
and a one dimensional vertical grid. The code is implemented in the Distributed
and Unified Numerics Environment (DUNE), which provides an easy-to-use and
scalable environment for algorithms operating on tensor-product grids. Parallel
scalability of our solvers on up to 20,480 cores is demonstrated on the HECToR
supercomputer.Comment: 22 pages, 6 Figures, 2 Table
Recommended from our members
Schnelle Löser für Partielle Differentialgleichungen
This workshop was well attended by 52 participants with broad geographic representation from 11 countries and 3 continents. It was a nice blend of researchers with various backgrounds
A Cartesian grid-based boundary integral method for moving interface problems
This paper proposes a Cartesian grid-based boundary integral method for
efficiently and stably solving two representative moving interface problems,
the Hele-Shaw flow and the Stefan problem. Elliptic and parabolic partial
differential equations (PDEs) are reformulated into boundary integral equations
and are then solved with the matrix-free generalized minimal residual (GMRES)
method. The evaluation of boundary integrals is performed by solving equivalent
and simple interface problems with finite difference methods, allowing the use
of fast PDE solvers, such as fast Fourier transform (FFT) and geometric
multigrid methods. The interface curve is evolved utilizing the
variables instead of the more commonly used variables. This choice
simplifies the preservation of mesh quality during the interface evolution. In
addition, the approach enables the design of efficient and stable
time-stepping schemes to remove the stiffness that arises from the curvature
term. Ample numerical examples, including simulations of complex viscous
fingering and dendritic solidification problems, are presented to showcase the
capability of the proposed method to handle challenging moving interface
problems
Simulation of all-scale atmospheric dynamics on unstructured meshes
The advance of massively parallel computing in the nineteen nineties and beyond encouraged finer grid intervals in numerical weather-prediction models. This has improved resolution of weather systems and enhanced the accuracy of forecasts, while setting the trend for development of unified all-scale atmospheric models. This paper first outlines the historical background to a wide range of numerical methods advanced in the process. Next, the trend is illustrated with a technical review of a versatile nonoscillatory forward-in-time finite-volume (NFTFV) approach, proven effective in simulations of atmospheric flows from small-scale dynamics to global circulations and climate. The outlined approach exploits the synergy of two specific ingredients: the MPDATA methods for the simulation of fluid flows based on the sign-preserving properties of upstream differencing; and the flexible finite-volume median-dual unstructured-mesh discretisation of the spatial differential operators comprising PDEs of atmospheric dynamics. The paper consolidates the concepts leading to a family of generalised nonhydrostatic NFTFV flow solvers that include soundproof PDEs of incompressible Boussinesq, anelastic and pseudo-incompressible systems, common in large-eddy simulation of small- and meso-scale dynamics, as well as all-scale compressible Euler equations. Such a framework naturally extends predictive skills of large-eddy simulation to the global atmosphere, providing a bottom-up alternative to the reverse approach pursued in the weather-prediction models. Theoretical considerations are substantiated by calculations attesting to the versatility and efficacy of the NFTFV approach. Some prospective developments are also discussed
Recommended from our members
New Discretization Methods for the Numerical Approximation of PDEs
The construction and mathematical analysis of numerical methods for PDEs is a fundamental area of modern applied mathematics. Among the various techniques that have been proposed in the past, some – in particular, finite element methods, – have been exceptionally successful in a range of applications. There are however a number of important challenges that remain, including the optimal adaptive finite element approximation of solutions to transport-dominated diffusion problems, the efficient numerical approximation of parametrized families of PDEs, and the efficient numerical approximation of high-dimensional partial differential equations (that arise from stochastic analysis and statistical physics, for example, in the form of a backward Kolmogorov equation, which, unlike its formal adjoint, the forward Kolmogorov equation, is not in divergence form, and therefore not directly amenable to finite element approximation, even when the spatial dimension is low). In recent years several original and conceptionally new ideas have emerged in order to tackle these open problems.
The goal of this workshop was to discuss and compare a number of novel approaches, to study their potential and applicability, and to formulate the strategic goals and directions of research in this field for the next five years
Efficient Solvers for Space-Time Discontinuous Galerkin Spectral Element Methods
In this thesis we study efficient solvers for space-time discontinuous Galerkin spectral element methods (DG-SEM). These discretizations result in fully implicit schemes of variable order in both spatial and temporal directions. The popularity of space-time DG methods has increased in recent years and entropy stable space-time DG-SEM have been constructed for conservation laws, making them interesting for these applications. The size of the nonlinear system resulting from differential equations discretized with space-time DG-SEM is dependent on the order of the method, and the corresponding Jacobian is of block form with dense blocks. Thus, the problem arises to efficiently solve these huge nonlinear systems with regards to CPU time as well as memory consumption. The lack of good solvers for three-dimensional DG applications has been identified as one of the major obstacles before high order methods can be adapted for industrial applications.It has been proven that DG-SEM in time and Lobatto IIIC Runge-Kutta methods are equivalent, in that both methods lead to the same discrete solution. This allows to implement space-time DG-SEM in two ways: Either as a full space-time system or by decoupling the temporal elements and using implicit time-stepping with Lobatto IIIC methods. We compare theoretical properties and discuss practical aspects of the respective implementations.When considering the full space-time system, multigrid can be used as solver. We analyze this solver with the local Fourier analysis, which gives more insight into the efficiency of the space-time multigrid method. The other option is to decouple the temporal elements and use implicit Runge-Kutta time-stepping methods. We suggest to use Jacobian-free Newton-Krylov (JFNK) solvers since they are advantageous memory-wise. An efficient preconditioner for the Krylov sub-solver is needed to improve the convergence speed. However, we want to avoid constructing or storing the Jacobian, otherwise the favorable memory consumption of the JFNK approach would be obsolete. We present a preconditioner based on an auxiliary first order finite volume replacement operator. Based on the replacement operator we construct an agglomeration multigrid preconditioner with efficient smoothers using pseudo time integrators. Then only the Jacobian of the replacement operator needs to be constructed and the DG method is still Jacobian-free. Numerical experiments for hyperbolic test problems as the advection, advection-diffusion and Euler equations in several dimensions demonstrate the potential of the new approach
- …