Abstract

Abstract. In predictability problem research, the conditional nonlinear optimal perturbation (CNOP) describes the initial perturbation that satisfies a certain constraint condition and causes the largest prediction error at the prediction time. The CNOP has been successfully applied in estimation of the lower bound of maximum predictable time (LBMPT). Generally, CNOPs are calculated by a gradient descent algorithm based on the adjoint model, which is called ADJ-CNOP. This study, through the two-dimensional Ikeda model, investigates the impacts of the nonlinearity on ADJ-CNOP and the corresponding precision problems when using ADJ-CNOP to estimate the LBMPT. Our conclusions are that (1) when the initial perturbation is large or the prediction time is long, the strong nonlinearity of the dynamical model in the prediction variable will lead to failure of the ADJ-CNOP method, and (2) when the objective function has multiple extreme values, ADJ-CNOP has a large probability of producing local CNOPs, hence making a false estimation of the LBMPT. Furthermore, the particle swarm optimization (PSO) algorithm, one kind of intelligent algorithm, is introduced to solve this problem. The method using PSO to compute CNOP is called PSO-CNOP. The results of numerical experiments show that even with a large initial perturbation and long prediction time, or when the objective function has multiple extreme values, PSO-CNOP can always obtain the global CNOP. Since the PSO algorithm is a heuristic search algorithm based on the population, it can overcome the impact of nonlinearity and the disturbance from multiple extremes of the objective function. In addition, to check the estimation accuracy of the LBMPT presented by PSO-CNOP and ADJ-CNOP, we partition the constraint domain of initial perturbations into sufficiently fine grid meshes and take the LBMPT obtained by the filtering method as a benchmark. The result shows that the estimation presented by PSO-CNOP is closer to the true value than the one by ADJ-CNOP with the forecast time increasing.

Highlights

  • Weather and climate predictability problems are attractive and significant in atmospheric and oceanic sciences

  • Capturing conditional nonlinear optimal perturbation (CNOP) is a kind of constraint optimization problem, and optimization algorithms commonly used in solving CNOPs are based on the gradient descent method, including the spectral projected gradient 2 (SPG2; Brigin et al, 2000), sequential quadratic programming (SQP; Powell, 1982), and limited memory BFGS (L-BFGS; Liu and Nocedal, 1989)

  • Through the fuzzy c-means clustering (FCM) method, we find that CNOPs obtained by the ADJ-CNOP method are divided into two categories: one is related to the global CNOP that accounted for 47.5 % (70 %) for the forecast time 6 t (13 t) of the total; the other is the local CNOP that makes up 52.5 % (30 %) of the total

Read more

Summary

Introduction

Weather and climate predictability problems are attractive and significant in atmospheric and oceanic sciences. Capturing CNOPs is a kind of constraint optimization problem, and optimization algorithms commonly used in solving CNOPs are based on the gradient descent method, including the spectral projected gradient 2 (SPG2; Brigin et al, 2000), sequential quadratic programming (SQP; Powell, 1982), and limited memory BFGS (L-BFGS; Liu and Nocedal, 1989) Among these algorithms, the gradient information is always provided by the backward integral of the corresponding adjoint model of the prediction model (Duan et al, 2004, 2008; Mu and Zhang, 2006; Mu et al, 2009; Jiang and Wang, 2010; Yu et al, 2012; Wang et al, 2012, 2013).

Related conceptions and the forecast model
Three sub-problems of the predictability problem
Estimation of the LBMPT
The two-dimensional Ikeda model
The numerical experiments solving CNOPs by different optimization algorithms
Comparison between PSO-CNOP and GA-CNOP
Method
Conclusion and discussion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call