Cross Reference: /external/eigen/unsupported/test/NonLinearOptimization.cpp

Lines Matching defs:fvec
17 int fcn_chkder(const VectorXd &x, VectorXd &fvec, MatrixXd &fjac, int iflag)
22     assert(15 ==  fvec.size());
38             fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3));
63   VectorXd x(n), fvec(m), xp, fvecp(m), err;
71   internal::chkder(x, fvec, fjac, xp, fvecp, 1, err);
72   fcn_chkder(x, fvec, fjac, 1);
73   fcn_chkder(x, fvec, fjac, 2);
75   internal::chkder(x, fvec, fjac, xp, fvecp, 2, err);
77   fvecp -= fvec;
100   VERIFY_IS_APPROX(fvec, fvec_ref);
133     int operator()(const VectorXd &x, VectorXd &fvec) const
144             fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3));
186   VERIFY_IS_APPROX(lm.fvec.blueNorm(), 0.09063596);
215   fnorm = lm.fvec.blueNorm();
246     int operator()(const VectorXd &x, VectorXd &fvec)
250         assert(fvec.size()==n);
258             fvec[k] = temp - temp1 - 2.*temp2 + 1.;
300   VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
335   VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
351     int operator()(const VectorXd &x, VectorXd &fvec) const
356         assert(fvec.size()==n);
364             fvec[k] = temp - temp1 - 2.*temp2 + 1.;
388   VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
419   VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
433     int operator()(const VectorXd &x, VectorXd &fvec)
440         assert(15==fvec.size());
448             fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3));
491   VERIFY_IS_APPROX(lm.fvec.blueNorm(), 0.09063596);
520   fnorm = lm.fvec.blueNorm();
533     int operator()(const VectorXd &x, VectorXd &fvec) const
541         assert(fvec.size()==15);
549             fvec[i] = y[i] - (x[0] + tmp1/(x[1]*tmp2 + x[2]*tmp3));
560   VectorXd x(n), fvec(15);
575   functor(x, fvec);
576   VERIFY_IS_APPROX(fvec.blueNorm(), 0.09063596);
606   fnorm = lm.fvec.blueNorm();
638     int operator()(const VectorXd &b, VectorXd &fvec)
643         assert(fvec.size()==54);
646             fvec[i] = exp(-b[0]*x)/(b[1]+b[2]*x) - m_y[i];
691   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.1304802941E+02);
712   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.1304802941E+02);
725     int operator()(const VectorXd &b, VectorXd &fvec)
728         assert(fvec.size()==14);
730             fvec[i] = b[0]*(1.-exp(-b[1]*m_x[i])) - m_y[i] ;
771   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.2455138894E-01);
788   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.2455138894E-01);
798     int operator()(const VectorXd &b, VectorXd &fvec)
807         assert(fvec.size()==236);
810             fvec[i] = (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) / (1.+b[4]*x+b[5]*xx+b[6]*xxx) - m_y[i];
861   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.5324382854E+00);
883   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.5324382854E+00);
900     int operator()(const VectorXd &b, VectorXd &fvec)
903         assert(fvec.size()==14);
905             fvec[i] = b[0]*b[1]*x[i]/(1.+b[1]*x[i]) - y[i];
947   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.6419295283E-02);
964   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.6419295283E-02);
976     int operator()(const VectorXd &b, VectorXd &fvec)
979         assert(fvec.size()==24);
981             fvec[i] = b[0]*exp(-b[1]*x[i]) + b[2]*exp(-b[3]*x[i]) + b[4]*exp(-b[5]*x[i])  - y[i];
1025   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.430899764097e-25);  // should be 1.4307867721E-25, but nist results are on 128-bit floats
1046   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.428595533845e-25);  // should be 1.4307867721E-25, but nist results are on 128-bit floats
1062     int operator()(const VectorXd &b, VectorXd &fvec)
1065         assert(fvec.size()==9);
1067             fvec[i] = b[0] / (1.+exp(b[1]-b[2]*x[i])) - y[i];
1111   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.0565229338E+00);
1129   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.0565229338E+00);
1141     int operator()(const VectorXd &b, VectorXd &fvec)
1144         assert(fvec.size()==16);
1146             fvec[i] =  b[0] * exp(b[1]/(x[i]+b[2])) - y[i];
1189   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.7945855171E+01);
1207   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.7945855171E+01);
1219     int operator()(const VectorXd &b, VectorXd &fvec)
1223         assert(fvec.size()==6);
1225             fvec[i] =  b[0]*(1.-exp(-b[1]*x[i])) - y[i];
1268   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.1680088766E+03);
1288   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.1680088766E+03);
1299     int operator()(const VectorXd &b, VectorXd &fvec)
1302         assert(fvec.size()==33);
1304             fvec[i] =  b[0] + b[1]*exp(-b[3]*x[i]) +  b[2]*exp(-b[4]*x[i]) - y[i];
1350   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.4648946975E-05);
1371   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.4648946975E-05);
1385     int operator()(const VectorXd &b, VectorXd &fvec)
1388         assert(fvec.size()==11);
1391             fvec[i] = b[0]*(xx+x*b[1])/(xx+x*b[2]+b[3]) - y[i];
1437   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 3.0750560385E-04);
1457   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 3.0750560385E-04);
1472     int operator()(const VectorXd &b, VectorXd &fvec)
1475         assert(fvec.size()==154);
1477             fvec[i] = b[0]* pow(b[1]+x[i],-1./b[2]) - y[i];
1523   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.2404744073E-04);
1541   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.2404744073E-04);
1553     int operator()(const VectorXd &b, VectorXd &fvec)
1557         assert(fvec.size()==37);
1560             fvec[i] = (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) / (1.+b[4]*x+b[5]*xx+b[6]*xxx) - _y[i];
1611   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.6427082397E+03);
1636   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 5.6427082397E+03);
1652     int operator()(const VectorXd &b, VectorXd &fvec)
1655         assert(fvec.size()==15);
1657             fvec[i] = b[0] * pow(1.+exp(b[1]-b[2]*x[i]),-1./b[3]) - y[i];
1703   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.7864049080E+03);
1725   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 8.7864049080E+03);
1740     int operator()(const VectorXd &b, VectorXd &fvec)
1743         assert(fvec.size()==35);
1745             fvec[i] = b[0]/b[1] * exp(-0.5*(x[i]-b[2])*(x[i]-b[2])/(b[1]*b[1])) - y[i];
1788   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.4635887487E-03);
1806   VERIFY_IS_APPROX(lm.fvec.squaredNorm(), 1.4635887487E-03);
1858   printf("fvec.blueNorm() : %.32g\n", solver.fvec.blueNorm());
1859   printf("fvec.blueNorm() : %.32g\n", lm.fvec.blueNorm());
1862   printf("fvec.squaredNorm() : %.13g\n", lm.fvec.squaredNorm());