文件名称:Matrix-addition
-
所属分类:
- 标签属性:
- 上传时间:2013-11-21
-
文件大小:1.36kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
矩阵相加(三元组):
先建立稀疏矩阵的三元组存储结构。输入第一个矩阵的行数和列数和非零元素个数,并输入非零元所在位置和大小。输入第二个矩阵的非零元素个数并输入非零元所在位置和大小。然后处理这两个矩阵:若矩阵1中非零元素的行列值等于矩阵2中非零元素的行列值,只需将两非零元素相加;若矩阵1中非零元素的行列值不等于矩阵2中非零元素的行列值,分别记录其所在位置和大小。-Matrix addition (triples):
First create a sparse matrix storage structure triples. Enter the first matrix of rows and columns and the number of non-zero elements, and enter the location and size of the nonzero elements. Enter the second matrix and enter the number of non-zero elements of the location and size of the nonzero elements. Then deal with these two matrices: If non-zero elements of the matrix a value equal to the matrix 2 ranks in the ranks of the value of non-zero elements, simply add two nonzero elements if non-zero elements of the matrix a is not equal to the ranks matrix 2 ranks of non-zero elements values were recorded in their location and size.
先建立稀疏矩阵的三元组存储结构。输入第一个矩阵的行数和列数和非零元素个数,并输入非零元所在位置和大小。输入第二个矩阵的非零元素个数并输入非零元所在位置和大小。然后处理这两个矩阵:若矩阵1中非零元素的行列值等于矩阵2中非零元素的行列值,只需将两非零元素相加;若矩阵1中非零元素的行列值不等于矩阵2中非零元素的行列值,分别记录其所在位置和大小。-Matrix addition (triples):
First create a sparse matrix storage structure triples. Enter the first matrix of rows and columns and the number of non-zero elements, and enter the location and size of the nonzero elements. Enter the second matrix and enter the number of non-zero elements of the location and size of the nonzero elements. Then deal with these two matrices: If non-zero elements of the matrix a value equal to the matrix 2 ranks in the ranks of the value of non-zero elements, simply add two nonzero elements if non-zero elements of the matrix a is not equal to the ranks matrix 2 ranks of non-zero elements values were recorded in their location and size.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Matrix addition/矩阵相加-三元组.cpp
Matrix addition/矩阵相加-三元组.txt
Matrix addition
Matrix addition/矩阵相加-三元组.txt
Matrix addition
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.