Lines Matching full:permutation
49 * // Compute the ordering permutation vector from the structural pattern of A
150 * \returns a reference to the row matrix permutation \f$ P_r \f$ such that \f$P_r A P_c^T = L U\f$
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$
338 PermutationType m_perm_c; // Column permutation
339 PermutationType m_perm_r ; // Row permutation
361 * Compute the column permutation to minimize the fill-in
363 * - Apply this permutation to the input matrix -
367 * - Postorder the elimination tree and the column permutation
379 // Apply the permutation to the column of the input matrix
422 // Combine the two permutations : postorder the permutation for future use
463 // Apply the column permutation computed in analyzepattern()
486 { //FIXME This should not be needed if the empty permutation is handled transparently
537 m_detPermR = 1; // Record the determinant of the row permutation
625 // Update the determinant of the row permutation matrix
643 // Apply permutation to the L subscripts
