Robs algorithm

摘要

Sparse matrix is a matrix having a relatively large proportion (proportion – a ratio is a comparison of two numbers. We generally separate the two numbers in the ratio with a colon (:)) of zero elements. To store the elements of the matrix in computer memory, linear array concept of storing is used. When a sparse matrix is stored in full-matrix storage mode, all its elements, including its zero elements, are stored in an array, which is a wastage of memory. In order to avoid the memory and processing overhead many alternate forms are used. Each one has separate time and space complexities and performances. In this paper we are suggesting one way of representing the sparse matrix which has both time and space complexity O(2n) only, while all other methods work with complexity more than O(3n) where n is the total number of non-zero elements in the matrix .The implementation of this algorithm in applications may improve the performance especially in the area of adjacency matrix, tree representation, 3D representation to an object, network communication, electronics, mathematical calculations, picture storage/file storage, file compression, bioinformatics, and the computer performance.The proposed algorithm has a large scope not only in computing but also in different branches of science, electronics and graphics.