2019Unpublished venueRequires access

A Sparse Matrix Fast Transpose Algorithm Based on Pseudo-Address

Wenjiao Da, Zhiguo Ren, Jiao Tong Lu, Xuxia Shi

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Transpose, Sparse matrix, Algorithm, Computer science, Matrix (chemical analysis), Matrix-free methods, Cuthill–McKee algorithm, Data compression

Related papers

Back to paper searchBrowse research topicsOriginal source
A Sparse Matrix Fast Transpose Algorithm Based on Pseudo-Address — Research Paper | ScholarLens