A Sparse Matrix Fast Transpose Algorithm Based on Pseudo-Address

Sparse matrix is a kind of special matrix which is often studied by computer scientists, and computer scientists mainly study its storage structure and algorithm. In this paper, we conceive and design the three-tuple compression storage structure of sparse matrix and the pseudo-address compression s...

Full description

Saved in:
Bibliographic Details
Published in:2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS) pp. 820 - 823
Main Authors: Da, Wenjiao, Ren, Zhiguo, Lu, Jiao, Shi, Xuxia
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2019
Subjects:
Aerospace electronics
Automation
Data compression
fast transpose algorithm
Industrial control
pseudo-address storage
Sparse matrices
sparse matrix
Triples (Data structure)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sparse matrix is a kind of special matrix which is often studied by computer scientists, and computer scientists mainly study its storage structure and algorithm. In this paper, we conceive and design the three-tuple compression storage structure of sparse matrix and the pseudo-address compression storage structure, discuss the transpose algorithm of irregular sparse matrix, mainly study the fast transpose algorithm of sparse matrix, and propose a new matrix transpose algorithm on it for the first time-the sparse matrix fast transpose algorithm of pseudo-address storage structure. It is hoped that this conclusion will provide general algorithm for industrial control and data compression researchers.
DOI:10.1109/ICICAS48597.2019.00176