稀疏矩阵及行压缩存储(CRS).ppt

Lab 3 Why Compressed Row Storage A sparse matrix has a lot of elements of value zero. Using a two dimensional array to store a sparse matrix wastes a lot of memory. Compressed Row Storage (CRS) format only stores the nonzero elements. Using CRS format to store a sparse matrix will save a lot of memory. Compressed Row Storage val array stores the values of the nonzero elements in a row-wise fashion. col_ind array stores the corresponding column indices of the elements in the val array. E.g. col_ind[5] stores the column index of val[5]. row_ptr array stores the locations in the val array and col_ind array that start a row. //Compressed Row Storage format //for a sparse square (mSize X mSize) matrix public class CRS{ //the values of the nonzero elements of the matrix float[] val; //the column indices of the elements in val array int[] col_idx; //locations in the val and col_idx array that start a row int[] row_ptr; //the size of the matrix: the number of rows int mSize=0; //constructor that takes a sparse matrix and convert it to a CRS object CRS( float[][] matrix){... } //print the matrix in CRS format. public void printCRS(){... } //test the program public static void main(String[] args){... } } CRS( float[][] matrix){ int i, j, index; //the total number of nonzero in the matrix int totalNonZeros; //get the number of rows and columns mSize = matrix.length; //get the total number of nonzero entries in the matrix totalNonZeros = 0; for( i=0; imSize; i++){ for( j=0; jmSize; j++){ if(matrix[i][j] != 0) totalNonZeros++; } } //allocate memory for val and col_idx array val = new float[ totalNonZeros ]; col_idx = new int[ totalNonZeros ]; //allocate memory for row_ptr row_ptr = new int[ mSize+1]; row_ptr[ 0 ] = 0; //store the matrix in CRS format index = 0;// point to the next position to store the value for( i=0; imSize; i++ ){//each row for( j=0; jmSize;