| /external/eigen/unsupported/test/ |
| D | NonLinearOptimization.cpp | 17 int fcn_chkder(const VectorXd &x, VectorXd &fvec, MatrixXd &fjac, int iflag) in fcn_chkder() argument
22 assert(15 == fvec.size()); in fcn_chkder()
38 fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3)); in fcn_chkder()
63 VectorXd x(n), fvec(m), xp, fvecp(m), err; in testChkder() local
71 internal::chkder(x, fvec, fjac, xp, fvecp, 1, err); in testChkder()
72 fcn_chkder(x, fvec, fjac, 1); in testChkder()
73 fcn_chkder(x, fvec, fjac, 2); in testChkder()
75 internal::chkder(x, fvec, fjac, xp, fvecp, 2, err); in testChkder()
77 fvecp -= fvec; in testChkder()
100 VERIFY_IS_APPROX(fvec, fvec_ref); in testChkder()
[all …]
|
| D | levenberg_marquardt.cpp | 26 int operator()(const VectorXd &x, VectorXd &fvec) const in operator ()()
37 fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3)); in operator ()()
79 VERIFY_IS_APPROX(lm.fvec().blueNorm(), 0.09063596); in testLmder1()
108 fnorm = lm.fvec().blueNorm(); in testLmder()
138 int operator()(const VectorXd &x, VectorXd &fvec) const in operator ()()
146 assert(fvec.size()==15); in operator ()()
154 fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3)); in operator ()()
165 VectorXd x(n), fvec(15); in testLmdif1() local
180 functor(x, fvec); in testLmdif1()
181 VERIFY_IS_APPROX(fvec.blueNorm(), 0.09063596); in testLmdif1()
[all …]
|
| D | NumericalDiff.cpp | 37 int operator()(const VectorXd &x, VectorXd &fvec) const in operator ()()
48 fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3)); in operator ()()
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | chkder.h | 11 const Matrix< Scalar, Dynamic, 1 > &fvec, in chkder()
30 const Index m = fvec.size(), n = x.size(); in chkder()
53 if (fvec[i] != 0. && fvecp[i] != 0. && abs(fvecp[i] - fvec[i]) >= epsf * abs(fvec[i])) in chkder()
54 … temp = eps * abs((fvecp[i] - fvec[i]) / eps - err[i]) / (abs(fvec[i]) + abs(fvecp[i])); in chkder()
|
| D | HybridNonLinearSolver.h | 91 FVectorType fvec, qtf, diag; variable
148 fvec.resize(n); in solveInit()
170 if ( functor(x, fvec) < 0) in solveInit()
172 fnorm = fvec.stableNorm(); in solveInit()
229 qtf = fjac.transpose() * fvec; in solveOneStep()
291 fvec = wa4; in solveOneStep()
390 fvec.resize(n); in solveNumericalDiffInit()
410 if ( functor(x, fvec) < 0) in solveNumericalDiffInit()
412 fnorm = fvec.stableNorm(); in solveNumericalDiffInit()
441 …if (internal::fdjac1(functor, x, fvec, fjac, parameters.nb_of_subdiagonals, parameters.nb_of_super… in solveNumericalDiffOneStep()
[all …]
|
| D | fdjac1.h | 9 Matrix< Scalar, Dynamic, 1 > &fvec, in fdjac1()
30 eigen_assert(fvec.size()==n); in fdjac1()
48 fjac.col(j) = (wa1-fvec)/h; in fdjac1()
70 … fjac.col(j).segment(start, length) = ( wa1.segment(start, length)-fvec.segment(start, length))/h; in fdjac1()
|
| D | LevenbergMarquardt.h | 101 FVectorType fvec, qtf, diag; variable
171 fvec.resize(m); in minimizeInit()
194 if ( functor(x, fvec) < 0) in minimizeInit()
196 fnorm = fvec.stableNorm(); in minimizeInit()
246 wa4 = fvec; in minimizeOneStep()
325 fvec = wa4; in minimizeOneStep()
385 fvec.resize(m); in minimizeOptimumStorageInit()
413 if ( functor(x, fvec) < 0) in minimizeOptimumStorageInit()
415 fnorm = fvec.stableNorm(); in minimizeOptimumStorageInit()
446 internal::rwupdt<Scalar>(fjac, wa3, qtf, fvec[i]); in minimizeOptimumStorageOneStep()
[all …]
|
| /external/eigen/test/ |
| D | denseLM.cpp | 56 int operator()(const VectorType& uv, VectorType& fvec) in operator ()()
63 eigen_assert(fvec.size() == m); in operator ()()
69 fvec(j) = m_y(j); in operator ()()
72 fvec(j) -= u(i) *std::exp(-(m_x(j)-i)*(m_x(j)-i)/(v(i)*v(i))); in operator ()()
|
| D | sparseLM.cpp | 59 int operator()(const VectorType& uv, VectorType& fvec) in operator ()()
68 fvec = m_y; in operator ()()
77 fvec(j) -= u(i)*std::pow((1-coeff), 2); in operator ()()
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| D | LevenbergMarquardt.h | 200 FVectorType& fvec() {return m_fvec; } in fvec() function
|