Lines Matching refs:actual_n

593   Index actual_n = n;
594   while(actual_n>1 && diag(actual_n-1)==Literal(0)) --actual_n;
596   for(Index k=0;k<actual_n;++k)
621     Index actual_n = n;
622     while(actual_n>1 && abs(col0(actual_n-1))<considerZero) --actual_n;
623     std::cout << "\n\n    mus:    " << mus.head(actual_n).transpose() << "\n\n";
624 …pect0) : " << ((singVals.array()-(shifts+mus)) / singVals.array()).head(actual_n).transpose() << "…
625 …eck2 (>0)      : " << ((singVals.array()-diag) / singVals.array()).head(actual_n).transpose() << "…
626 …check3 (>0)      : " << ((diag.segment(1,actual_n-1)-singVals.head(actual_n-1).array()) / singVals…
627 …:cout << "    check4 (>0)      : " << ((singVals.segment(1,actual_n-1)-singVals.head(actual_n-1)))…
666   for(Index i=0; i<actual_n-1; ++i)
679   singVals.head(actual_n).reverseInPlace();
680   U.leftCols(actual_n).rowwise().reverseInPlace();
681   if (m_compV) V.leftCols(actual_n).rowwise().reverseInPlace();
713   Index actual_n = n;
714   while(actual_n>1 && col0(actual_n-1)==Literal(0)) --actual_n;
718     if (col0(k) == Literal(0) || actual_n==1)
731     if(k==actual_n-1)
732       right = (diag(actual_n-1) + col0.matrix().norm());
737       while(col0(l)==Literal(0)) { ++l; eigen_internal_assert(l<actual_n); }
759     RealScalar shift = (k == actual_n-1 || fMid > Literal(0)) ? left : right;
770       if (k == actual_n-1) muCur = right - left;
816       std::cout << "useBisection for k = " << k << ", actual_n = " << actual_n << "\n";
824 …rightShifted = (k==actual_n-1) ? right : ((right - left) * RealScalar(0.6)); // theoretically we c…