2008Journal of Henan Mechanical and Electrical Engineering CollegeRequires access

Storage Algorithm of Sparse Matrix

Qin Ti-heng

Open publisher page 0 citations

Abstract

Many applied problems in practice can be summed up as the computation of sparse matrix.A storage algorithm about sparse matrix is discussed in this paper.A element of the sparse matrix is represented with a record in clude three fields,then all elements are represented with a array.The storage algorithm is better running efficiency.

About this research paper

What this paper is about

Many applied problems in practice can be summed up as the computation of sparse matrix.A storage algorithm about sparse matrix is discussed in this paper.A element of the sparse matrix is represented with a record in clude three fields,then all elements are represented with a array.The storage algorithm is better running efficiency.

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

Many applied problems in practice can be summed up as the computation of sparse matrix.A storage algorithm about sparse matrix is discussed in this paper.A element of the sparse matrix is represented with a record in clude three fields,then all elements are represented with a array.The storage algorithm is better running efficiency.

Key concepts: Sparse matrix, Matrix (chemical analysis), Computation, Algorithm, Computer science, Sparse approximation, Cuthill–McKee algorithm, Computational science

Related papers

Back to paper searchBrowse research topicsOriginal source
Storage Algorithm of Sparse Matrix — Research Paper | ScholarLens