Lines Matching full:divide
4 // We used the "A Divide-And-Conquer Algorithm for the Bidiagonal SVD"
31 * \brief class Bidiagonal Divide and Conquer SVD
199 void divide (Index firstCol, Index lastCol, Index firstRowW,
284 //**** step 2 Divide
294 divide(0, this->m_diagSize - 1, 0, 0, 0);
352 // The divide algorithm is done "in place", we are always working on subsets of the same matrix. The divide methods takes as argument the
363 void BDCSVD<MatrixType>::divide (Index firstCol, Index lastCol, Index firstRowW,
396 // We use the divide and conquer algorithm
399 // The divide must be done in that order in order to have good results. Divide change the data inside the submatrices
400 // and the divide of the right submatrice reads one column of the left submatrice. That's why we need to treat the
402 divide(k + 1 + firstCol, lastCol, k + 1 + firstRowW, k + 1 + firstColW, shift);
403 divide(firstCol, k - 1 + firstCol, firstRowW, firstColW + 1, shift + 1);
498 }// end divide
