Ensemble-type numerical uncertainty information from single model integrations
Introduction
Numerical models of geophysical fluid dynamics (GFD) have inherent and inevitable uncertainties. Numerical uncertainties are usually analyzed during the development phase of the model; the standard approach requires a detailed analysis of the numerical properties of the scheme used. In this paper, we propose an algorithm that allows us to estimate a posteriori the numerical error directly from the model solutions.
The behavior of GFD systems is characterized by physical quantities of interest such as total energy content or transport quantities. These physical quantities can be described as functionals of the model solution and are called “goals”. The algorithm that we propose estimates the error in the calculation of goals due to numerical uncertainties. The starting point of our considerations is the dual-weighted residual method of computational fluid dynamics (e.g., [1], [14], [5], [15], [6], [2]). In the dual-weighted residual method the estimation of the goal error is split into the estimation of local model errors and the sensitivity of the goal to local changes. The sensitivities are calculated as the adjoint solution of a goal-dependent dual problem. In summary, one obtains a (sensitivity-)weighted sum of local errors. In standard forms of the dual-weighted residual methods, the local model errors are estimated using knowledge of the discretization formulation and thus require an in-depth understanding of the underlying discrete model. The latter fact can become prohibitive for complex nonlinear models. So far the quantification of goal approximation errors for GFD applications has been done via deterministic local error estimates [5], [16]. Here the local model errors are treated as a uniquely deterministic consequence of the modeled flow, and the goal error is therefore a deterministic consequence of these local errors.
We deviate from the framework of the dual-weighted residual method by treating the local error as a stochastic process. The key element of our approach is the goal approximation ensemble. The goal approximation ensemble is calculated in two steps. First, a suitable and specific element of a class of stochastic processes such as the Gaussian processes is selected. The selection uses information from short model integrations at a standard resolution and at a higher resolution to determine the parameters of the stochastic process. Second, from realizations of the selected stochastic process and the adjoint solution a goal approximation ensemble is calculated a posteriori. From this goal approximation ensemble we estimate bounds for the goal error. The calculation of the sensitivity information uses Algorithmic Differentiation [9], [13].
The novel aspect of our algorithm is the goal approximation ensemble. This ensemble aims to capture the linear component of information component of a nonlinear model ensemble but generates this information from two short model runs at standard and high resolution, one (forward) integration of the model and one adjoint integration. In terms of computational cost this reduces essentially to a single integration of the model and its adjoint on the lower resolution. We provide numerical evidence that the stochastic characterization of local errors enables us through the goal approximation error to estimate the error in the goal approximation. This work extends our earlier work [16] on deterministic error estimation to a stochastic framework.
This paper is organized as follows: in Section 2 we formulate the general problem: what do we mean when we speak about error bounds for numerical goals? Section 3 presents our proposed algorithm to solve this problem. This section represents the core of our approach and shows where we diverge from classical numerical error estimation techniques. In Section 4 we introduce a model to evaluate our algorithm, and in Section 5 results are shown for this model and two test cases. In Section 6 we discuss the results and especially compare the posterior goal error ensembles with forward ensembles. We conclude in Section 7 with an outlook of potential applications of our algorithm.
Section snippets
General problem statement
We keep the problem statement abstract to permit a general formulation of our error estimation algorithm in Section 3. A more specific formulation will be given in Section 4. We introduce a general, continuous model N that maps a state vector q from its initial value to its value at a later time. The model N might be a linear mapping or a nonlinear one, such as the Shallow-Water Equations in Section 4. The model N acts on the state vector as follows
Local model errors as random process and algorithm proposal
Our algorithm cannot be deduced from a specific numerical discretization technique because we want it to be applicable to any general black-box discretization technique a potential user of a GFD model might encounter. In this section we motivate our algorithm following the extraction of resolved dynamics from a process of higher complexity [8]. This paragraph is not a rigorous mathematical derivation but a motivating argument for why it makes sense to interpret unresolved processes as
The Shallow-Water Equations as a prototype for a nonlinear model
The Shallow-Water Equations (SWE) on a rotating sphere are a specific example of the general model N of Section 2. We write the inviscid SWE on the sphere Ω in vector-invariant form as Here v is the horizontal velocity, ξ the vorticity, f the Coriolis parameter, the gravitational acceleration, and h the height of the fluid surface. The initial conditions are and . We consider (13) on a time interval . The state vector
Results from the single-run ensemble
We now apply the algorithm of Section 3 to TC1 and TC2, running the model at low resolution and higher resolution to calculate the local error rates of change; see Table 2.
Strengths and weaknesses of posterior ensembles
Our results have shown that the newly introduced posterior ensemble (PE) and stochastic-physics ensembles (SPE) are conceptually and empirically closely connected. PE can be seen as a linearized, simplified version of SPE that can be derived from only one model solution, and that could be used in further studies as a potentially cheaper alternative to SPE. Our local error initialization concept is connected to the concept of optimal perturbations. These perturbations maximize error growth from
What is special about posterior ensembles, and why does it matter?
Our new algorithm is very general, not only with respect to models and discretization techniques but also with respect to the type of problems it could be applied to. The exact specification and execution of the algorithm suggests further research areas: the random processes could and should be (topographically) regional, the adjoints could be simplified, and the local error processes could have memory. It has to be tested how well the method works with more connected state variables. It is
Acknowledgements
We thank the International Max Planck Research School on Earth System Modelling for funding the research that led to this publication. We also thank the Max Planck Society for the Advancement of Sciences for supporting the authors. We thank our colleagues at RWTH Aachen for support with the adjoint compiler, and we especially thank the three reviewers for valuable feedback in shaping this article.
References (20)
- et al.
Estimation of modeling error in computational mechanics
J. Comput. Phys.
(2002) - et al.
Predicting goal error evolution from near-initial-information: a learning algorithm
J. Comput. Phys.
(2011) - et al.
A standard test set for numerical approximations to the shallow water equations in spherical geometry
J. Comput. Phys.
(1992) - et al.
A feed-back approach to error control in finite element methods: basic analysis and examples
East-West J. Numer. Math.
(1996) - et al.
An optimal control approach to a posteriori error estimation in finite element methods
Acta Numer.
(2002) - et al.
Stochastic Tools in Mathematics and Science
(2013) - et al.
Optimal prediction of forecast error covariances through singular vectors
J. Atmos. Sci.
(1997) - et al.
Progress in adjoint error correction for integral functionals
Comput. Vis. Sci.
(2004) - et al.
Adjoint methods for PDEs: a posteriori error analysis and postprocessing by duality
Acta Numer.
(2002) - et al.
Conservative space and time regularizations for the ICON model
Cited by (7)
On a posteriori error estimation using distances between numerical solutions and angles between truncation errors
2021, Mathematics and Computers in SimulationCitation Excerpt :Thus, the deterministic objects in high dimensions may manifest some features of the probabilistic nature, such as the normal distribution or some properties, which appear with the “probability one”. This may explain results of papers [8,37] regarding the unexpected statistical properties of the truncation and approximation errors. The more information on the relation of the geometry and probability may be found in [13,54].
On uncertainty quantification via the ensemble of independent numerical solutions
2020, Journal of Computational ScienceStochastic goal-oriented error estimation with memory
2017, Journal of Computational PhysicsCitation Excerpt :First, we extend the algorithm to stochastic processes with memory, a property deemed to be highly important in modeling the effect of the unresolved scales (see e.g. [10–14]). The white-noise process used in [8] does not provide such a memory effect as future states are independent of previous states. Our algorithm now models the local truncation error by considering temporal fluctuations in local truncation errors at all previous timesteps, and thus naturally inherits a memory effect.
Generalized Computational Experiment and Verification Problems
2021, Programming and Computer SoftwareOn applying of generalized computational experiment to numerical methods verification
2020, CEUR Workshop Proceedings