Browse Prior Art Database

Addition of 2 Sparse Matrices Technique

IP.com Disclosure Number: IPCOM000077293D
Original Publication Date: 1972-Jul-01
Included in the Prior Art Database: 2005-Feb-25
Document File: 2 page(s) / 63K

Publishing Venue

IBM

Related People

Kugel, LE: AUTHOR

Abstract

This method provides for rapid repetitive addition of 2 sparse matrices A+B=C.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Addition of 2 Sparse Matrices Technique

This method provides for rapid repetitive addition of 2 sparse matrices A+B=C.

Sparse matrices A,B, and C are stored rowwise with the column numbers of each nonzero entry in a data vector and the nonzero entries in another data vector. For example: 1 2 3 4

(Image Omitted)

Additional pointers are used to denote the beginning and end of each row.

Consider the vector of nonzero entries of A, V(A), of B, V(B) and of C, V(C). Every entry in V(C) is either an entry in V(A), an entry in V(B), or (an entry in V(A)) + (an entry in V(B)). The improvement is:

(Image Omitted)

During the computation only the data part of V(C) changes, and the algorithm for performing this mapping operation is as follows.

Matrix subtraction can also be performed by this algorithm, i.e. (C=A-B). The only difference is that entries in B are negated.

1

Page 2 of 2

2

[This page contains 7 pictures or other non-text objects]