Directional component analysis (DCA) is a statistical method used in climate science for identifying representative patterns of variability in space-time data-sets such as historical climate observations, weather prediction ensembles or climate ensembles.
The first DCA pattern is a pattern of weather or climate variability that is both likely to occur (measured using likelihood) and has a large impact (for a specified linear impact function, and given certain mathematical conditions: see below).
The first DCA pattern contrasts with the first PCA pattern, which is likely to occur, but may not have a large impact, and with a pattern derived from the gradient of the impact function, which has a large impact, but may not be likely to occur.
DCA differs from other pattern identification methods used in climate research, such as EOFs, rotated EOFs and extended EOFs in that it takes into account an external vector, the gradient of the impact.
DCA provides a way to reduce large ensembles from weather forecasts or climate models to just two patterns. The first pattern is the ensemble mean, and the second pattern is the DCA pattern, which represents variability around the ensemble mean in a way that takes impact into account.DCA contrasts with other methods that have been proposed for the reduction of ensembles in that it takes impact into account in addition to the structure of the ensemble.
DCA is calculated from two inputs:
Consider a space-time data set
X
x
C
We define a linear impact function of a spatial pattern as
rtx
r
The first DCA pattern is given in terms the covariance matrix
C
r
x\proptoCr
The pattern can then be normalized to any length as required.
If the weather or climate data is elliptically distributed (e.g., is distributed as a multivariate normal distribution or a multivariate t-distribution) then the first DCA pattern (DCA1) is defined as the spatial pattern with the following mathematical properties:
For instance, in a rainfall anomaly dataset, using an impact metric defined as the total rainfall anomaly, the first DCA pattern is the spatial pattern that has the highest probability density for a given total rainfall anomaly. If the given total rainfall anomaly is chosen to have a large value, then this pattern combines being extreme in terms of the metric (i.e., representing large amounts of total rainfall) with being likely in terms of the pattern, and so is well suited as a representative extreme pattern.
The main differences between Principal component analysis (PCA) and DCA are
As a result, for unit vector spatial patterns:
The degenerate cases occur when the PCA and DCA patterns are equal.
Also, given the first PCA pattern, the DCA pattern can be scaled so that:
Source:
Figure 1 gives an example, which can be understood as follows:
From this diagram, the DCA pattern can be seen to possess the following properties:
In this case the total rainfall anomaly of the PCA pattern is quite small, because of anticorrelations between the rainfall anomalies at the two locations. As a result, the first PCA pattern is not a good representative example of a pattern with large total rainfall anomaly, while the first DCA pattern is.
In
n
n-1
n
DCA has been applied to the CRU data-set of historical rainfall variability in order to understand the most likely patterns of rainfall extremes in the US and China.
DCA has been applied to ECMWF medium-range weather forecast ensembles in order to identify the most likely patterns of extreme temperatures in the ensemble forecast.
DCA has been applied to ensemble climate model projections in order to identify the most likely patterns of extreme future rainfall.
Source:
Consider a space-time data-set
X
x
C
As a function of
x
-xtC-1x
We define a linear impact function of a spatial pattern as
rtx
r
We then seek to find the spatial pattern that maximises the probability density for a given value of the linear impact function. This is equivalent to finding the spatial pattern that maximises the log probability density for a given value of the linear impact function, which is slightly easier to solve.
This is a constrained maximisation problem, and can be solved using the method of Lagrange multipliers.
The Lagrangian function is given by
L(x,λ)=-xtC-1x-λ(rtx-1)
Differentiating by
x
x\proptoCr
Normalising so that
x
x=Cr/(rtCCr)1/2
This is the first DCA pattern.
Subsequent patterns can be derived which are orthogonal to the first, to form an orthonormal set and a method for matrix factorisation.