本文给出了2~n×2~n矩阵和长方阵的三种快速转置方法。数据矩阵存贮在可直接访问的外存设备上,当数据矩阵的尺寸大于可用内存的容量时,算法的性能决定于可用内存的大小。文中还对三种算法分别给出了它们的适用范围和操作时间估计。 In this paper, three fast transpose methods of 2 ~ n × 2 ~ n matrices and rectangular matrices are given. The data matrix is ​​stored on directly accessible memory devices. When the size of the data matrix is ​​larger than the available memory, the performance of the algorithm depends on the amount of available memory. The paper also gives the three kinds of algorithms, respectively, their scope of application and operating time estimates.