Lines Matching full:column
57 * \warning The input matrix A should be in a \b compressed and \b column-major form.
65 * \tparam _MatrixType The type of the sparse matrix. It must be a column-major SparseMatrix<>
110 * The input matrix should be in column-major storage.
158 * \returns a reference to the column matrix permutation\f$ P_c^T \f$ such that \f$P_r A P_c^T = L U\f$
382 PermutationType m_perm_c; // Column permutation
384 IndexVector m_etree; // Column elimination tree
405 * Compute the column permutation to minimize the fill-in
409 * - Compute the column elimination tree on the permuted matrix
411 * - Postorder the elimination tree and the column permutation
423 // Apply the permutation to the column of the input matrix
428 //Then, permute only the column pointers
444 // Compute the column elimination tree of the permuted matrix
507 // Apply the column permutation computed in analyzepattern()
513 //Then, permute only the column pointers
592 Index nseg1; // Number of segments in U-column above panel row jcol
593 Index nseg; // Number of segments in each U-column
620 k = (jj - jcol) * m; // Column index for w-wide arrays
623 //Depth-first-search for the current column
634 // Numeric updates to this column
660 m_lastError = "THE MATRIX IS STRUCTURALLY SINGULAR ... ZERO COLUMN AT ";
673 // Prune columns (0:jj-1) using column jj
676 // Reset repfnz for this column
696 // Create the column major upper sparse matrix U;
