两个稀疏矩阵三元组相加（Two sparse matrices, three tuples added）.docVIP

下载本文档

47
0
约6.82千字
约 13页
2017-10-07 发布于河南
举报
版权申诉

两个稀疏矩阵三元组相加（Two sparse matrices, three tuples added）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

两个稀疏矩阵三元组相加（Two sparse matrices, three tuples added）

两个稀疏矩阵三元组相加（Two sparse matrices, three tuples added） When the sparse matrices A and B are all stored structures with the three table as the storage structure, the algorithm of adding matrices is written, and the result is stored in the three tuple table C. Solution: this algorithm is complex, taking into account the two non-zero elements of sparse matrix is not one-to-one, in building a new three tuple C, in order to make the three element of the tuple according to the priority order, so the three tuple per insertion is not A, in accordance with the matrix elements of the list of three go to A in the tuple, if any, will join the C, at the same time, this element if in B, and the B element value, otherwise the value is unchanged if not in A, is looking for B, there is no matrix elements into C, then find a. When the sparse matrices A and B are all stored structures with the three table as the storage structure, the algorithm of adding matrices is written, and the result is stored in the three tuple table C. Solution: The addition of matrices adds the value of the elements in the same location in the two matrices. Because the two non-zero elements of sparse matrix by three tuple storage, in the establishment of the new three tuple C, in order to make the three element of the tuple according to the priority order, so the three tuple per insertion is not A, in accordance with the three tuple, the matrix elements of the ranks to A in if. Add C, at the same time, this element if in B, and the B element value, otherwise the value is unchanged; if not in A, is looking for B, there is no matrix elements into C, then find a. #define MaxSize 10 / / custom Typedef int DataType; / / custom Typedef struct {/ / definition three tuple Int, I, j; DataType v; }TriTupleNode; Typedef struct {/ / definition three tuple TriTupleNode data[MaxSize]; Int m, N, t; / / matrix rows, columns and three tuple length }TriTupleTable; The following matrix algorithm and / Void AddTriTuple (TriTupleTa