AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
Volume:58 Issue:2
AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

Authors : Aiyoub FARZANEH, Hossein KHEIRI, Mehdi ABBASPOUR SHAHMERSI

Pages : 1-10

Doi:10.1501/Commua1_0000000648

View : 20 | Download : 8

Publication Date : 2009-08-01

Article Type : Research Paper

Abstract :In this paper we consider linear system Ax = b where A is a largesparse matrix. A new e¢ cient, simple and inexpensive method for storage of coefficient matrix A was presented. The purpose of this method is to reduce thestorage volume of large non-symmetric sparse matrices. The results shows thatthe proposed method is very inexpensive in comparison with current methodssuch as Coordinate format, Compressed Sparse Row insert ignore into journalissuearticles values(CSR); format and Modified Sparse Row insert ignore into journalissuearticles values(MSR); format
Keywords : Sparse matrix, Storage schemes, Data structures

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.