| /external/eigen/unsupported/test/ |
| D | levenberg_marquardt.cpp | 42 int df(const VectorXd &x, MatrixXd &fjac) const in df()
51 fjac(i,0) = -1; in df()
52 fjac(i,1) = tmp1*tmp2/tmp4; in df()
53 fjac(i,2) = tmp1*tmp3/tmp4; in df()
255 int df(const VectorXd &b, MatrixXd &fjac) in df()
258 assert(fjac.rows()==54); in df()
259 assert(fjac.cols()==3); in df()
264 fjac(i,0) = -x*e*factor; in df()
265 fjac(i,1) = -e*factor*factor; in df()
266 fjac(i,2) = -x*e*factor*factor; in df()
[all …]
|
| D | NonLinearOptimization.cpp | 17 int fcn_chkder(const VectorXd &x, VectorXd &fvec, MatrixXd &fjac, int iflag) in fcn_chkder() argument
51 fjac(i,0) = -1.; in fcn_chkder()
52 fjac(i,1) = tmp1*tmp2/tmp4; in fcn_chkder()
53 fjac(i,2) = tmp1*tmp3/tmp4; in fcn_chkder()
64 MatrixXd fjac(m,n); 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()
74 fcn_chkder(xp, fvecp, fjac, 1); in testChkder()
75 internal::chkder(x, fvec, fjac, xp, fvecp, 2, err); in testChkder()
[all …]
|
| D | NumericalDiff.cpp | 53 int actual_df(const VectorXd &x, MatrixXd &fjac) const in actual_df()
62 fjac(i,0) = -1; in actual_df()
63 fjac(i,1) = tmp1*tmp2/tmp4; in actual_df()
64 fjac(i,2) = tmp1*tmp3/tmp4; in actual_df()
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | LevenbergMarquardt.h | 102 JacobianType fjac; variable
172 fjac.resize(m, n); in minimizeInit()
215 Index df_ret = functor.df(x, fjac); in minimizeOneStep()
224 wa2 = fjac.colwise().blueNorm(); in minimizeOneStep()
225 ColPivHouseholderQR<JacobianType> qrfac(fjac); in minimizeOneStep()
226 fjac = qrfac.matrixQR(); in minimizeOneStep()
255 …gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.in… in minimizeOneStep()
292 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1); in minimizeOneStep()
391 fjac.resize(n, n); in minimizeOptimumStorageInit()
442 fjac.fill(0.); in minimizeOptimumStorageOneStep()
[all …]
|
| D | HybridNonLinearSolver.h | 92 JacobianType fjac; variable
150 fjac.resize(n, n); in solveInit()
198 if ( functor.df(x, fjac) < 0) in solveOneStep()
202 wa2 = fjac.colwise().blueNorm(); in solveOneStep()
220 HouseholderQR<JacobianType> qrfac(fjac); // no pivoting: in solveOneStep()
226 fjac = qrfac.householderQ(); in solveOneStep()
229 qtf = fjac.transpose() * fvec; in solveOneStep()
327 wa2 = fjac.transpose() * wa4; in solveOneStep()
334 internal::r1mpyq<Scalar>(n, n, fjac.data(), v_givens, w_givens); in solveOneStep()
389 fjac.resize(n, n); in solveNumericalDiffInit()
[all …]
|
| D | fdjac1.h | 10 Matrix< Scalar, Dynamic, Dynamic > &fjac, in fdjac1()
48 fjac.col(j) = (wa1-fvec)/h; in fdjac1()
67 fjac.col(j).setZero(); in fdjac1()
70 … fjac.col(j).segment(start, length) = ( wa1.segment(start, length)-fvec.segment(start, length))/h; in fdjac1()
|
| D | chkder.h | 12 const Matrix< Scalar, Dynamic, Dynamic > &fjac, in chkder()
49 err += temp * fjac.col(j); in chkder()
|
| /external/eigen/test/ |
| D | sparseLM.cpp | 83 int df(const VectorType& uv, JacobianType& fjac) in df()
88 eigen_assert(fjac.rows() == m); in df()
89 eigen_assert(fjac.cols() == n); in df()
104 fjac.coeffRef(row,col) = -(1-coeff)*(1-coeff); in df()
117 fjac.coeffRef(row,col+half) = -4 * (u(col)/v(col))*coeff*(1-coeff); in df()
|
| D | denseLM.cpp | 78 int df(const VectorType& uv, JacobianType& fjac) in df()
83 eigen_assert(fjac.rows() == m); in df()
84 eigen_assert(fjac.cols() == n); in df()
92 fjac.coeffRef(j,i) = -std::exp(-(m_x(j)-i)*(m_x(j)-i)/(v(i)*v(i))); in df()
93 …fjac.coeffRef(j,i+half) = -2.*u(i)*(m_x(j)-i)*(m_x(j)-i)/(std::pow(v(i),3)) * std::exp(-(m_x(j)-i)… in df()
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | pr17168.ll | 491 !434 = !DIGlobalVariable(name: "fjac", line: 84, isLocal: true, isDefinition: true, scope: null, fi…
|