| 用微机或小型计算机转置大矩阵的几种快速算法 |
| |
| 引用本文： | 俞仁康,刘重庆. 用微机或小型计算机转置大矩阵的几种快速算法[J]. 应用科学学报, 1986, 4(1): 54-60 |
| |
| 作者姓名： | 俞仁康 刘重庆 |
| |
| 作者单位： | 上海交通大学 |
| |
| 摘 要： | 本文介绍了当矩阵数据大于主存贮器容量时,用微机或小型计算机转置大矩阵的三种算法.矩阵数据可贮存在磁盘或磁带外存设备上.试验结果证明,算法具有显著的快速性优点.
|
| 收稿时间： | 1985-06-04 |
| 修稿时间： | 1985-07-10 |
FAST ALGORITHMS FOR TRANSPOSING LARGE MATRICES USING MICROCOMPUTER OR MINICOMPUTER |
| |
| YU RENKANG,LIU CHONGQING. FAST ALGORITHMS FOR TRANSPOSING LARGE MATRICES USING MICROCOMPUTER OR MINICOMPUTER[J]. Journal of Applied Sciences, 1986, 4(1): 54-60 |
| |
| Authors: | YU RENKANG LIU CHONGQING |
| |
| Affiliation: | Shanghai Jian Tong University |
| |
| Abstract: | The purpose of this paper is to present three algorithms for transposing large matrices of whnich data are larger than main memory available. The data can be stored on external storage device, such as disk or magnetic tape. The transposing operations using 128*256 matrices have been carried out on PDP11/24 minicomputer. Experimental results demonstrated that tie algorithms could realize a speed advantage. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《应用科学学报》浏览原始摘要信息 |
|
点击此处可从《应用科学学报》下载全文 |
