Calibration of the stochastic multicloud model using Bayesian inference (Q2878968)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Calibration of the stochastic multicloud model using Bayesian inference |
scientific article; zbMATH DE number 6340655
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calibration of the stochastic multicloud model using Bayesian inference |
scientific article; zbMATH DE number 6340655 |
Statements
5 September 2014
0 references
stochastic cumulus parametrization
0 references
stochastic multi-cloud model
0 references
inverse problem
0 references
Bayesian inference
0 references
large sparse matrix exponential
0 references
parallel uniformization method
0 references
high performance computing
0 references
PETSc
0 references
Monte Carlo Markov chain
0 references
climate models
0 references
general circulation model
0 references
Calibration of the stochastic multicloud model using Bayesian inference (English)
0 references
The stochastic multicloud model (SMCM) was recently developed [\textit{B. Khouider} et al., Commun. Math. Sci. 8, No. 1, 187--216 (2010; Zbl 1190.86003)] to represent the missing variability in general circulation models due to unresolved features of organized tropical convection. This research aims at finding a robust calibration methodology for the SMCM to estimate key model parameters from data. The SMCM model considered in the present work is in essence a three-dimensional birth-death process with immigration whose population species track the time evolution of the area fractions of three types of clouds, congestus, deep penetrative cumulus and stratiform ones, which are observed to describe tropical convective systems. Transition rates between the different cloud states depend on the convective potential energy and the middle tropospheric humidity. The calibration problem is formulated within a Bayesian framework to derive the posterior distribution over the model parameters. The main challenge here is due to the likelihood function which requires solving a large system of differential equations (the Kolmogorov equations) as many times as there are data points, which is prohibitive in terms of both computation time and storage requirements. The most attractive numerical techniques to compute the transient solutions to large Markov chains are based on matrix exponentials, but none is unconditionally acceptable for all classes of problems. A parallel version of a preconditioning technique is developed, which is known as the uniformization method, using the PETSc (Portable, Extensible Toolkit for Scientific computation) suite of sparse matrix-vector operations. The parallel uniformization method allows for fast and scalable approximations of large sparse matrix exponentials, without sacrificing accuracy. Sampling of the high-dimensional posterior distribution is achieved using the standard Markov chain Monte Carlo technique. The robustness of the calibration procedure is tested using synthetic data produced by a simple toy climate model. A sensitivity study to the length of the data time series and to the prior distribution is presented, and a sequential learning strategy is also tested. (abstract with some additions)
0 references