Lines Matching refs:rows
41 /** Allocate memory for a matrix with the specified number of rows and
44 static elem_t* new_matrix(const int rows, const int cols)
46 assert(rows > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols)
61 for (i = 0; i < rows; i++)
63 for (j = 0; j < rows; j++)
72 const elem_t* const a, const int rows, const int cols)
76 for (i = 0; i < rows; i++)
154 * has at least as many columns as rows, the result of this algorithm is that
155 * submatrix p->a[0..p->rows-1,0..p->rows-1] is the identity matrix.
158 static void gj(elem_t* const a, const int rows, const int cols)
162 for (i = 0; i < rows; i++)
167 for (k = i + 1; k < rows; k++)
193 // Reduce all rows j != i.
198 for (j = 0; j < rows; j++)
213 for (j = 0; j < rows; j++)
