Articles | Volume 30, issue 3
https://doi.org/10.5194/npg-30-263-2023
https://doi.org/10.5194/npg-30-263-2023
Research article
 | 
06 Jul 2023
Research article |  | 06 Jul 2023

An adjoint-free algorithm for conditional nonlinear optimal perturbations (CNOPs) via sampling

Bin Shi and Guodong Sun

Download

Interactive discussion

Status: closed

Comment types: AC – author | RC – referee | CC – community | EC – editor | CEC – chief editor | : Report abuse

Peer review completion

AR: Author's response | RR: Referee report | ED: Editor decision | EF: Editorial file upload
AR by Bin Shi on behalf of the Authors (15 Feb 2023)  Author's response   Author's tracked changes   Manuscript 
ED: Referee Nomination & Report Request started (16 Feb 2023) by Stefano Pierini
RR by Anonymous Referee #1 (28 Feb 2023)
RR by Anonymous Referee #3 (04 Apr 2023)
ED: Reconsider after major revisions (further review by editor and referees) (05 Apr 2023) by Stefano Pierini
AR by Bin Shi on behalf of the Authors (10 May 2023)  Author's response   Author's tracked changes   Manuscript 
ED: Referee Nomination & Report Request started (14 May 2023) by Stefano Pierini
RR by Anonymous Referee #3 (01 Jun 2023)
ED: Publish as is (04 Jun 2023) by Stefano Pierini
AR by Bin Shi on behalf of the Authors (05 Jun 2023)  Author's response   Manuscript 
Download
Short summary
We introduce a sample-based algorithm to obtain the conditional nonlinear optimal perturbations. Compared with the classical adjoint-based method, it is easier to implement and reduces the required storage for the basic state. When we reduce the number of samples to some extent, it reduces the computation markedly more when using the sample-based method, which can guarantee that the CNOP obtained is nearly consistent with some minor fluctuating errors oscillating in spatial distribution.