文件名称:yunsuanqi
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:2.64kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1.按照压缩存储的概念,只存储稀疏矩阵的非零元,以两个三元组{i,j,e}来表示矩阵的非零元的行,列和数值,就确定了一个非零元.由此,稀疏矩阵可由表示非零元的三元数组及行列数确定.
2.用户输入数据作为三元组的行,列和非零元的个数,用逗号隔开.并输入非零元的行,列和数值.
3.本程序只对两个矩阵进行四则运算,所的结果矩阵应该另生成,用二维数组存放,并放入新的矩阵中,只要对矩阵求解就能求出答案.
-1. According to the concept of compress storage, storage sparse matrix not only the zero yuan, with two three yuan group {I, j, e} to show the matrix of the nonzero yuan in the line, column and numerical, and determine a nonzero yuan. Thus, sparse matrix can be said of the zero dollars by three yuan array and determine the ranks number.
2. User input data as three yuan group in the line, column and the number of the zero yuan, set off by a comma. And input the zero dollars in the line, column and value.
3. This procedure in only two a matrix of arithmetic, the result of the matrix should be another generation, with a two dimensional array deposit, and into the new matrix, as long as the solution to matrix is able to find out the answer.
2.用户输入数据作为三元组的行,列和非零元的个数,用逗号隔开.并输入非零元的行,列和数值.
3.本程序只对两个矩阵进行四则运算,所的结果矩阵应该另生成,用二维数组存放,并放入新的矩阵中,只要对矩阵求解就能求出答案.
-1. According to the concept of compress storage, storage sparse matrix not only the zero yuan, with two three yuan group {I, j, e} to show the matrix of the nonzero yuan in the line, column and numerical, and determine a nonzero yuan. Thus, sparse matrix can be said of the zero dollars by three yuan array and determine the ranks number.
2. User input data as three yuan group in the line, column and the number of the zero yuan, set off by a comma. And input the zero dollars in the line, column and value.
3. This procedure in only two a matrix of arithmetic, the result of the matrix should be another generation, with a two dimensional array deposit, and into the new matrix, as long as the solution to matrix is able to find out the answer.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
稀疏矩阵运算器.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.