Lines Matching full:fjac
102 JacobianType fjac;
172 fjac.resize(m, n);
212 Index df_ret = functor.df(x, fjac);
221 wa2 = fjac.colwise().blueNorm();
222 ColPivHouseholderQR<JacobianType> qrfac(fjac);
223 fjac = qrfac.matrixQR();
252 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
289 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
383 // Only R is stored in fjac. Q is only used to compute 'qtf', which is
388 fjac.resize(n, n);
436 fjac.fill(0.);
440 internal::rwupdt<Scalar>(fjac, wa3, qtf, fvec[i]);
449 if (fjac(j,j) == 0.)
451 wa2[j] = fjac.col(j).head(j).stableNorm();
455 wa2 = fjac.colwise().blueNorm();
458 ColPivHouseholderQR<JacobianType> qrfac(fjac);
459 fjac = qrfac.matrixQR();
460 wa1 = fjac.diagonal();
461 fjac.diagonal() = qrfac.hCoeffs();
464 for(Index ii=0; ii< fjac.cols(); ii++) fjac.col(ii).segment(ii+1, fjac.rows()-ii-1) *= fjac(ii,ii); // rescale vectors
467 if (fjac(j,j) != 0.) {
470 sum += fjac(i,j) * qtf[i];
471 temp = -sum / fjac(j,j);
473 qtf[i] += fjac(i,j) * temp;
475 fjac(j,j) = wa1[j];
499 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
512 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
