Here is the update to my **bigcor** function for creating large correlation/covariance matrices.

What does it do?

1) It splits a matrix with *N* columns into equal size blocks (+ a remainder block) of , , etc. Block size can be defined by user, 2000 is a good value because *cor* can handle this quite quickly. If the matrix has 13796 columns, the split will be 2000;2000;2000;2000;2000;2000;1796.

2) For all combinations of blocks, the correlation matrix is calculated, so $latex A_n/A_n, A_n/B_n, B_n/B_n etc.

3) The blockwise correlation matrices are transferred into the preallocated empty matrix at the appropriate position (where the correlations would usually reside). To ensure symmetry around the diagonal, this is done twice in the upper and lower triangle.

This way, the *N x N* empty correlation matrix is filled like a checkerboard with patches of *n x n* correlation sub-matrices. In our case, in which we split the *N* = 40000 columns into *n* = 8 blocks, we obtain 36 combinations (combn(1:8, 2) + 8; + 8 because of A/A, B/B etc) of blocks with dimension 5000 x 5000 each. This gives 36 x 5000 x 5000 x 2 (filling both triangles) – 8 x 5000 x 5000 (because the diagonals are created twice) = 1.6E9 = 40000 x 40000.

The function can found here: http://www.dr-spiess.de/scripts/bigcor.r

Timings for a 21796 x 21796 matrix roughly 2 min!