An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation

Conditional nonlinear optimal perturbation (CNOP) has been widely applied to study the predictability of weather and climate. The classical method of solving CNOP is adjoint method, in which the gradient is obtained using the adjoint model. But some numerical models have no adjoint models implemente...

Full description

Bibliographic Details
Main Authors: Bin Mu, Juhui Ren, Shijin Yuan
Format: Article
Language:English
Published: Hindawi Limited 2017-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2017/3208431
id doaj-3800dea8dd2b4a5490be61a49ca95e82
record_format Article
spelling doaj-3800dea8dd2b4a5490be61a49ca95e822020-11-24T21:43:13ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472017-01-01201710.1155/2017/32084313208431An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal PerturbationBin Mu0Juhui Ren1Shijin Yuan2School of Software Engineering, Tongji University, Shanghai 201804, ChinaSchool of Software Engineering, Tongji University, Shanghai 201804, ChinaSchool of Software Engineering, Tongji University, Shanghai 201804, ChinaConditional nonlinear optimal perturbation (CNOP) has been widely applied to study the predictability of weather and climate. The classical method of solving CNOP is adjoint method, in which the gradient is obtained using the adjoint model. But some numerical models have no adjoint models implemented, and it is not realistic to develop from scratch because of the huge amount of work. The gradient can be obtained by the definition in mathematics; however, with the sharp growth of dimensions, its calculation efficiency will decrease dramatically. Therefore, the gradient is rarely obtained by the definition when solving CNOP. In this paper, an efficient approach based on the gradient definition is proposed to solve CNOP around the whole solution space and parallelized. Our approach is applied to solve CNOP in Zebiak-Cane (ZC) model, and, compared with adjoint method, which is the benchmark, our approach can obtain similar results in CNOP value and pattern aspects and higher efficiency in time consumption aspect, only 12.83 s, while adjoint method spends 15.04 s and consumes less time if more CPU cores are provided. All the experimental results show that it is feasible to solve CNOP with our approach based on the gradient definition around the whole solution space.http://dx.doi.org/10.1155/2017/3208431
collection DOAJ
language English
format Article
sources DOAJ
author Bin Mu
Juhui Ren
Shijin Yuan
spellingShingle Bin Mu
Juhui Ren
Shijin Yuan
An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
Mathematical Problems in Engineering
author_facet Bin Mu
Juhui Ren
Shijin Yuan
author_sort Bin Mu
title An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
title_short An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
title_full An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
title_fullStr An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
title_full_unstemmed An Efficient Approach Based on the Gradient Definition for Solving Conditional Nonlinear Optimal Perturbation
title_sort efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2017-01-01
description Conditional nonlinear optimal perturbation (CNOP) has been widely applied to study the predictability of weather and climate. The classical method of solving CNOP is adjoint method, in which the gradient is obtained using the adjoint model. But some numerical models have no adjoint models implemented, and it is not realistic to develop from scratch because of the huge amount of work. The gradient can be obtained by the definition in mathematics; however, with the sharp growth of dimensions, its calculation efficiency will decrease dramatically. Therefore, the gradient is rarely obtained by the definition when solving CNOP. In this paper, an efficient approach based on the gradient definition is proposed to solve CNOP around the whole solution space and parallelized. Our approach is applied to solve CNOP in Zebiak-Cane (ZC) model, and, compared with adjoint method, which is the benchmark, our approach can obtain similar results in CNOP value and pattern aspects and higher efficiency in time consumption aspect, only 12.83 s, while adjoint method spends 15.04 s and consumes less time if more CPU cores are provided. All the experimental results show that it is feasible to solve CNOP with our approach based on the gradient definition around the whole solution space.
url http://dx.doi.org/10.1155/2017/3208431
work_keys_str_mv AT binmu anefficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
AT juhuiren anefficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
AT shijinyuan anefficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
AT binmu efficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
AT juhuiren efficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
AT shijinyuan efficientapproachbasedonthegradientdefinitionforsolvingconditionalnonlinearoptimalperturbation
_version_ 1725914935582523392