HomeSort by relevance Sort by last modified time
    Searched refs:nsing (Results 1 - 4 of 4) sorted by null

  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
qrsolv.h 75 Index nsing; local
76 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {}
78 wa.tail(n-nsing).setZero();
79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
lmpar.h 40 Index nsing = n-1; local
43 if (r(j,j) == 0. && nsing == n-1)
44 nsing = j - 1;
45 if (nsing < n-1)
48 for (j = nsing; j>=0; --j) {
74 if (nsing >= n-1) {
  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMqrsolv.h 87 Index nsing; local
88 for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {}
90 wa.tail(n-nsing).setZero();
91 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
173 Index nsing; local
    [all...]
  /external/lmfit/lib/
lmmin.c 624 int i, iter, j, nsing; local
632 nsing = n;
635 if (r[j*ldr+j] == 0 && nsing == n)
636 nsing = j;
637 if (nsing < n)
640 for (j = nsing-1; j >= 0; j--) {
659 printf("debug lmpar nsing=%d, n=%d, terminate[fp<=p1*del]\n", nsing, n);
670 if (nsing >= n) {
731 printf("debug lmpar nsing=%d, iter=%d,
963 int i, kk, j, k, nsing; local
    [all...]

Completed in 83 milliseconds