Lines Matching defs:fjac
108 JacobianType fjac;
179 fjac.resize(m, n);
222 Index df_ret = functor.df(x, fjac);
231 wa2 = fjac.colwise().blueNorm();
232 ColPivHouseholderQR<JacobianType> qrfac(fjac);
233 fjac = qrfac.matrixQR();
262 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
299 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
393 // Only R is stored in fjac. Q is only used to compute 'qtf', which is
398 fjac.resize(n, n);
449 fjac.fill(0.);
453 internal::rwupdt<Scalar>(fjac, wa3, qtf, fvec[i]);
462 if (fjac(j,j) == 0.)
464 wa2[j] = fjac.col(j).head(j).stableNorm();
468 wa2 = fjac.colwise().blueNorm();
471 ColPivHouseholderQR<JacobianType> qrfac(fjac);
472 fjac = qrfac.matrixQR();
473 wa1 = fjac.diagonal();
474 fjac.diagonal() = qrfac.hCoeffs();
477 for(Index ii=0; ii< fjac.cols(); ii++) fjac.col(ii).segment(ii+1, fjac.rows()-ii-1) *= fjac(ii,ii); // rescale vectors
480 if (fjac(j,j) != 0.) {
483 sum += fjac(i,j) * qtf[i];
484 temp = -sum / fjac(j,j);
486 qtf[i] += fjac(i,j) * temp;
488 fjac(j,j) = wa1[j];
512 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
525 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
549 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
