Efficient memory handling is one of the key issues that engineers and programmers face in developing software for numerical analysis such as the Finite Element Method. This method operates on huge matrices that have a large number of zero coefficients which waste memory, so it is necessary to save it and to work only with non-zero coefficients using so called "SPARSE" matrices. Analysis of two methods used for the improvement of "SPARSE" matrix creation is presented in this paper and their pseudo code is given. Comparison is made on a wide range of problem sizes. Results show that "indexing" method is superior to "dotting" method both in memory usage and in elapsed time.
Adle R, Aiguier M, Delaplace F. Toward an automatic parallelization of sparse matrix computations. Journal of Parallel and Distributed Computing. 2005;313–30.
2.
Amestoy P, Duff I, ’excellent L, Li J, X. Analysis and comparison of two general sparse solvers for distributed memory computers. ACM Transactions on Mathematical Software (TOMS). 2001;388–421.
3.
Amestoy P, Duff I, Excellent L, Li J, X. Impact of the implementation of MPI point-topoint communications on the performance of two general sparse solvers. Parallel Computing. 2003;833–49.
4.
Armstrong W, Rendell A. Runtime sparse matrix format selection. Procedia Computer Science. 2010;135–44.
5.
Ashari A, Sedaghati N, Eisenlohr J, Sadayappan P, P. A model-driven blocking strategy for load balanced sparse matrix-vector multiplication on GPUs. Journal of Parallel and Distributed Computing. 2015;3–15.
6.
Bathe K. Finite element procedures. Klaus-Jurgen Bathe. 2007;
7.
Borštnik U, Vondele J, Weber V, Hutter J. Sparse matrix multiplication: The distributed block-compressed sparse row library. Parallel Computing. 2014;47–58.
8.
Duncan W, Collar A. A method for the solution of oscillations problems by matrices. Philosophical Magazine. 1934;865.
9.
Duncan W, Collar A. Matrices applied to the motions of damped systems Philosophical Magazine. 1935;197.
10.
Felippa C. A historical outline of matrix structural analysis: a play in three acts. Computers & Structures. 2001;1313–24.
11.
Gilbert J, Moler C, Schreiber R. Sparse matrices in matlab: design and implementation. SIAM Journal on Matrix Analysis and Applications. 1992;333–56.
12.
Hiemstra R, Sangalli G, Tani M, Calabrò F, Hughes T. Fast formation and assembly of finite element matrices with application to isogeometric linear elasticity. Computer Methods in Applied Mechanics and Engineering. 2019;234–60.
13.
Kaveh A, Ghaderi I. Conditioning of structural stiffness matrices. Computers & Structures. 1997;719–25.
14.
Kojić M, Slavković R, Živković M, Grujović N. Metod konačnih elemenata I (linearna analiza). Mašinski fakultet u Kragujevcu. 1998;
15.
Mofrad A, Sadeghi M, Panario D. Solving sparse linear systems of equations over finite fields using bit-flipping algorithm. Linear Algebra and its Applications. 2013;1818–24.
16.
Oyarzun G, Borrell R, Gorobets A, Oliva A. MPI-CUDA sparse matrix-vector multiplication for the conjugate gradient method with an approximate inverse preconditioner. Computers & Fluids. 2014;244–52.
17.
Pichel J, Rivera F, Fernández M, Rodríguez A. Optimization of sparse matrix-vector multiplication using reordering techniques on GPUs. Microprocessors and Microsystems. 2012;65–77.
18.
Romero L, Zapata E. Data distributions for sparse matrix vector multiplication. Parallel Computing. 1995;583–605.
19.
Turner M. The direct stiffness method of structural analysis. Structural and Materials Panel Paper, AGARD Meeting, Aachen, Germany. 1959;
20.
Wilson E. Finite element analysis of two-dimensional structures. Department of Civil Engineering, University of California at Berkeley, USA. 1963;
21.
Živković M. Nelinearna analiza konstrukcija. Mašinski fakultet u Kragujevcu. 2005;
The statements, opinions and data contained in the journal are solely those of the individual authors and contributors and not of the publisher and the editor(s). We stay neutral with regard to jurisdictional claims in published maps and institutional affiliations.
