A parallel sensitive area selection-based particle swarm optimization algorithm for fast solving CNOP

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, more and more researchers apply intelligent algorithms to solve conditional nonlinear optimal perturbation (CNOP) which is proposed to study the predictability of numerical weather and climate prediction. The difficulty of solving CNOP using intelligent algorithm is the high dimensionality of complex numerical models. Therefore, previous researches either are just tested in ideal models or have low time efficiency in complex numerical models which limited the application of CNOP. This paper proposes a sensitive area selection- based particle swarm optimization algorithm (SASPSO) for fast solving CNOP. Meanwhile, we adopt the self-adaptive dynamic control swarm size strategy to SASPSO method and parallel SASPSO with MPI. To demonstrate the validity, we take Zebiak-Cane (ZC) numerical model as a case. Experimental results show that the proposed method can obtain a better CNOP more efficiently than SAEP [1] and PCAGA [2] which are two latest researches on intelligent algorithms for solving CNOP.

Cite

CITATION STYLE

APA

Yuan, S., Ji, F., Yan, J., & Mu, B. (2015). A parallel sensitive area selection-based particle swarm optimization algorithm for fast solving CNOP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9490, pp. 71–78). Springer Verlag. https://doi.org/10.1007/978-3-319-26535-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free