AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

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 (CSR) format and Modified Sparse Row (MSR) format

___

  • Esmond G. Ng and Daniel J. Pierce, Introduction to the Special Section on Sparse and Structured Matrices and Their Applications, SIAM. J. Matrix Anal. and Appl. 20, 887 (1999).
  • Y. Saad, Modi…ed from SPARSKIT: a basic tool kit for sparse matrix computations,( June 6, 1994).
  • Y. Saad, Iterative Methods For Sparse Linear Systems, 2nd edition with corrections.( Jan. 3RD, 2000).
  • A.Brameller, R.N. Allan and Y.M. Hamam, Sparsity, Pitman, New York, (1976).
  • D.J. Rose and R.N. Willoughby, Sparse Matrix and its Applicatios, Plenum Pres, New York , (1972).
  • R.C. Mittal and A.H. Al-Kurdi, LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems, Computers Math. Applic. 42, 131-155, (2001).
  • R.C. Mittal and A.H. Al-Kurdi, An e¢ cient method for constructing an ILU preconditioner for solving large systems by the GMRES method, Computers Math. Applic. 45, 1757-1772, (2003).
  • A. Pinar and V. Vassilevska, Finding Nonoverlapping Substructures of a Sparse Matrix, Electronic Transactions on Numerical Analysis (ETNA), Volume 21, 107-124, 2005.
  • J. Dongarra, Sparse matrix storage formats, in: Z. Bai, et al. (Eds.), Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000. Electronic version available at: http://www.cs.utk.edu/ dongarra/etemplates/node372.html.