Ensemble Dynamics and Bred Vectors

Abstract

he new concept of an ensemble bred vector (EBV) algorithm is introduced to assess the sensitivity of model outputs to changes in initial conditions for weather forecasting. The new algorithm is based on collective dynamics in essential ways. As such, it keeps important geometric features that are lost in the earlier bred vector (BV) algorithm. By construction, the EBV algorithm produces one or more dominant vectors and is less prone to spurious results than the BV algorithm. It retains the attractive features of the BV algorithm with regard to being able to handle legacy codes, with minimal additional coding.The performance of the EBV algorithm is investigated by comparing it to the BV algorithm as well as the finite-time Lyapunov vectors. With the help of a continuous-time adaptation of these algorithms, a theoretical justification is given to the observed fact that the vectors produced by the BV, EBV algorithms, and the finite-time Lyapunov vectors are similar for small amplitudes. The continuum theory establishes the relationship between the two algorithms and general directional derivatives.Numerical comparisons of BV and EBV for the three-equation Lorenz model and for a forced, dissipative partial differential equation of Cahn?Hilliard type that arises in modeling the thermohaline circulation demonstrate that the EBV yields a size-ordered description of the perturbation field and is more robust than the BV in the higher nonlinear regime. The EBV yields insight into the fractal structure of the Lorenz attractor and of the inertial manifold for the Cahn?Hilliard-type partial differential equation.