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