| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| HybridNonLinearSolver.h | 92 JacobianType fjac; member in class:Eigen::HybridNonLinearSolver
150 fjac.resize(n, n);
198 if ( functor.df(x, fjac) < 0)
202 wa2 = fjac.colwise().blueNorm();
220 HouseholderQR<JacobianType> qrfac(fjac); // no pivoting:
225 /* accumulate the orthogonal factor in fjac. */
226 fjac = qrfac.householderQ();
229 qtf = fjac.transpose() * fvec;
327 wa2 = fjac.transpose() * wa4;
334 internal::r1mpyq<Scalar>(n, n, fjac.data(), v_givens, w_givens)
[all...] |
| LevenbergMarquardt.h | 108 JacobianType fjac; member in class:Eigen::LevenbergMarquardt
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)
[all...] |
| /external/lmfit/lib/ |
| lmmin.c | 211 double* fjac = (double*)pws; local
268 fjac[j*m+i] = (wf[i] - fvec[i]) / step;
277 printf("%.5e ", fjac[j*m+i]);
284 /* fjac is an m by n array. The upper n by n submatrix of fjac is made
294 * The lower trapezoidal part of fjac contains information generated
304 lm_qrfac(m, n, fjac, Pivot, wa1, wa2, wa3);
312 temp3 = fjac[j*m+j];
316 sum += fjac[j*m+i] * wf[i];
319 wf[i] += fjac[j*m+i] * temp
[all...] |
