Robs algorithm

Title

Robs algorithm

Creator

George R.

Description

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. 2006 Elsevier Inc. All rights reserved.

Source

Applied Mathematics and Computation, Vol-189, No. 1, pp. 314-325.

Date

2007-01-01

Subject

Block compressed row storage; Compressed column storage; Compressed diagonal storage; Compressed row storage; Effective matrix representation; Jagged diagonal storage; Linked list method

Coverage

George R., Department of Computer Science, Christ College, Bangalore, 550 029 Karnataka, India

Rights

Restricted Access

Relation

ISSN: 963003; CODEN: AMHCB

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1016/j.amc.2006.11.096

https://www.scopus.com/inward/record.uri?eid=2-s2.0-34248402107&doi=10.1016%2fj.amc.2006.11.096&partnerID=40&md5=ab8dbc70ce003fdd5d78bb40e86fe0b1