•   The nodes of each row are organized into a linked list via their rowLink pointers, with a head pointer containing a link to the first node of the list. Similarly, the elements of each column are organized into a linked list via their colLink pointers. Each column has a head pointer that points to the first node in the list or null if the column is empty.

  •   A system of linear equations is a set of linear equations involving the same n variables . A system of linear equations can be represented using a matrix equation in the form Ax=y , where A is a coefficient matrix, x is a column vector with n variable entries , and y is a column vector storing the constants. A solution to a system of linear equations is the assignment of n values to x1...xn such that each equation is satisfied.
      This sparse matrix is implemented in Java using link list. A sparse matrix is a matrix where a large proportion of the elements have a value of zero. In a linked list representation of such a matrix zero value elements are not represented, saving space. Each node will belong to exactly two singly linked lists: a row linked list and a column linked list.

  • Linked Sparse Matrix Representation