AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

Aiyoub Farzaneh; Hossein Kheırı; Mehdi Abbaspour Shahmersı

doi:10.1501/Commua1_0000000648

Year 2009, , 1 - 10, 01.08.2009

Aiyoub Farzaneh Hossein Kheırı Mehdi Abbaspour Shahmersı

https://doi.org/10.1501/Commua1_0000000648

Cited By: 3

Abstract

References

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.

AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES

Year 2009, , 1 - 10, 01.08.2009

Aiyoub Farzaneh Hossein Kheırı Mehdi Abbaspour Shahmersı

https://doi.org/10.1501/Commua1_0000000648

Cited By: 3

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

Keywords

Sparse matrix, Storage schemes, Data structures

References

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.

There are 9 citations in total.

Details

Primary Language	English
Journal Section	Research Articles
Authors	Aiyoub Farzaneh This is me Hossein Kheırı This is me Mehdi Abbaspour Shahmersı This is me
Publication Date	August 1, 2009
Published in Issue	Year 2009

Cite

APA	Farzaneh, A., Kheırı, H., & Abbaspour Shahmersı, M. (2009). AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, 58(2), 1-10. https://doi.org/10.1501/Commua1_0000000648
AMA	Farzaneh A, Kheırı H, Abbaspour Shahmersı M. AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. August 2009;58(2):1-10. doi:10.1501/Commua1_0000000648
Chicago	Farzaneh, Aiyoub, Hossein Kheırı, and Mehdi Abbaspour Shahmersı. “AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 58, no. 2 (August 2009): 1-10. https://doi.org/10.1501/Commua1_0000000648.
EndNote	Farzaneh A, Kheırı H, Abbaspour Shahmersı M (August 1, 2009) AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 58 2 1–10.
IEEE	A. Farzaneh, H. Kheırı, and M. Abbaspour Shahmersı, “AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES”, Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat., vol. 58, no. 2, pp. 1–10, 2009, doi: 10.1501/Commua1_0000000648.
ISNAD	Farzaneh, Aiyoub et al. “AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 58/2 (August 2009), 1-10. https://doi.org/10.1501/Commua1_0000000648.
JAMA	Farzaneh A, Kheırı H, Abbaspour Shahmersı M. AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2009;58:1–10.
MLA	Farzaneh, Aiyoub et al. “AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES”. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, vol. 58, no. 2, 2009, pp. 1-10, doi:10.1501/Commua1_0000000648.
Vancouver	Farzaneh A, Kheırı H, Abbaspour Shahmersı M. AN EFFICIENT STORAGE FORMAT FOR LARGE SPARSE MATRICES. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2009;58(2):1-10.