 rows) of this second matrix, and similarly grouping the results into the final result matrix.In more than two dimensions, it is often advantageous for cache locality to group the dimensions recursively.For example, a three-dimensional FFT might first perform two-dimensional FFTs of each planar "slice" for each fixed "n"1, and then perform the one-dimensional FFTs along the "n"1 direction.