A Sparse Matrix is a matrix, usually very large, where most of the elements are zero. Sparse Matrix Technology is the study of computational algorithms designed specifically to take advantage of that knowledge. Issues addressed by the technology are, among others, how to store such a large matrix without having to store a large number of zeros, and how to perform algebraic operations such as matrix addition, multiplication, transposition, assembly, solution of linear equations, diagonalization and calculation of eigenvalues, and others, without having to operate on many zeros. In practice, a large sparse matrix may have millions of rows and columns. Even with today's most powerful computers, it would be impractical to store all the elements or to use them all to perform calculations. Specialized sparse matrix algorithms can deal with a matrix that size on personal computers.