Home
last modified time | relevance | path

Searched refs:eps99 (Results 1 – 25 of 135) sorted by relevance

123456

/dports/math/cppad/CppAD-20210000.8/test_more/general/
H A Dsqrt.cpp47 ok &= NearEqual(Z[x] , 2., eps99 , eps99); in SqrtTestOne()
48 ok &= NearEqual(Z[y] , sqrt(2.), eps99 , eps99); in SqrtTestOne()
70 eps99 , in SqrtTestOne()
71 eps99 in SqrtTestOne()
82 eps99 , in SqrtTestOne()
83 eps99 in SqrtTestOne()
112 ok &= NearEqual(U[0] , Z[0], eps99 , eps99); in SqrtTestTwo()
167 ok &= NearEqual(y1[0], exp(x/2.)/2., eps99 , eps99); in SqrtTestThree()
188 ok &= NearEqual(r[0], exp(x/2.)/2., eps99 , eps99); in SqrtTestThree()
189 ok &= NearEqual(r[1], exp(x/2.)/4., eps99 , eps99 ); in SqrtTestThree()
[all …]
H A Dpow.cpp52 ok &= NearEqual(Z[i] , check, eps99, eps99); in PowTestOne()
61 ok &= NearEqual(dz[0], check, eps99, eps99); in PowTestOne()
62 ok &= NearEqual(dz[1], check, eps99, eps99); in PowTestOne()
63 ok &= NearEqual(dz[2], 0., eps99, eps99); in PowTestOne()
70 ok &= NearEqual(dz[0], check, eps99, eps99); in PowTestOne()
71 ok &= NearEqual(dz[1], 0., eps99, eps99); in PowTestOne()
72 ok &= NearEqual(dz[2], check, eps99, eps99); in PowTestOne()
231 ok &= NearEqual(dy[2], 1., eps99, eps99); in PowTestThree()
242 ok &= NearEqual(dw[0], 1., eps99, eps99); in PowTestThree()
305 ok &= NearEqual(dw[0], sum, eps99, eps99); in PowTestFour()
[all …]
H A Dnew_dynamic.cpp139 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
143 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
147 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
151 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
154 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
186 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
189 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
192 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
195 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
198 ok &= NearEqual(y[k] , check, eps99, eps99); in operator_with_variable()
[all …]
H A Ddiv.cpp70 ok &= NearEqual( Z[x] , 2. / 3. , eps99, eps99); in DivTestOne()
71 ok &= NearEqual( Z[y] , 2. / ( 3. * 4. ) , eps99, eps99); in DivTestOne()
72 ok &= NearEqual( Z[z] , 5. * 3. * 4. / 2. , eps99, eps99); in DivTestOne()
80 ok &= NearEqual(r[x], 1./U[t], eps99, eps99); // dx/ds in DivTestOne()
81 ok &= NearEqual(r[y], 1./(U[t]*4.), eps99, eps99); // dy/ds in DivTestOne()
101 eps99, in DivTestOne()
102 eps99 in DivTestOne()
147 ok &= NearEqual(w[0], value/jfac, eps99, eps99); // d^jz/du^j in DivTestTwo()
193 ok &= NearEqual(dy[0], check, eps99, eps99); in DivTestThree()
199 ok &= NearEqual(dw[0], check, eps99, eps99); in DivTestThree()
[all …]
H A Dexp.cpp47 ok &= NearEqual(Z[x] , exp(1.), eps99 , eps99); in ExpTestOne()
48 ok &= NearEqual(Z[y] , exp( exp(1.) ), eps99 , eps99); in ExpTestOne()
53 ok &= NearEqual(w[x], Z[x], eps99 , eps99); // dx/ds in ExpTestOne()
54 ok &= NearEqual(w[y], Z[y] * Z[x], eps99 , eps99); // dy/ds in ExpTestOne()
60 ok &= NearEqual(v[s], Z[y] * Z[x], eps99 , eps99); // dy/ds in ExpTestOne()
70 eps99 , in ExpTestOne()
71 eps99 in ExpTestOne()
82 eps99 , in ExpTestOne()
83 eps99 in ExpTestOne()
110 ok &= NearEqual(exp_u, Value(Z[0]), eps99 , eps99); in ExpTestTwo()
[all …]
H A Dlog.cpp47 ok &= NearEqual(Z[x] , log(2.), eps99 , eps99); in LogTestOne()
48 ok &= NearEqual(Z[y] , log( log(2.) ), eps99 , eps99); in LogTestOne()
53 ok &= NearEqual(w[x], 1. / U[s], eps99 , eps99); // dx/ds in LogTestOne()
54 ok &= NearEqual(w[y], 1. / (U[s] * Z[x]), eps99 , eps99); // dy/ds in LogTestOne()
60 ok &= NearEqual(v[s], 1. / (U[s] * Z[x]), eps99 , eps99); // dy/ds in LogTestOne()
70 eps99 , in LogTestOne()
71 eps99 in LogTestOne()
82 eps99 , in LogTestOne()
83 eps99 in LogTestOne()
112 ok &= NearEqual(U[0] , Z[0], eps99 , eps99); in LogTestTwo()
[all …]
H A Dsin_cos.cpp52 ok &= NearEqual(sin_u, Value(Z[0]), eps99 , eps99); in Sin()
81 ok &= NearEqual(jfac*w[0], sinj * yj, eps99 , eps99); in Sin()
112 ok &= NearEqual(r[p+j], value/jfac, eps99, eps99); in Sin()
151 ok &= NearEqual(cos_u, Value(Z[0]), eps99 , eps99); in Cos()
180 ok &= NearEqual(jfac*w[0], cosj * yj, eps99 , eps99); in Cos()
211 ok &= NearEqual(r[p+j], value/jfac, eps99, eps99); in Cos()
250 ok &= NearEqual(cosh_u, Value(Z[0]), eps99 , eps99); in Cosh()
275 ok &= NearEqual(jfac*w[0], coshj * yj, eps99 , eps99); in Cosh()
302 ok &= NearEqual(r[p+j], value/jfac, eps99, eps99); in Cosh()
341 ok &= NearEqual(sinh_u, Value(Z[0]), eps99 , eps99); in Sinh()
[all …]
H A Dforward.cpp48 ok &= NearEqual(y0[0] , x0[0]*x0[0]*x0[1], eps99, eps99); in ForwardCases()
56 ok &= NearEqual(y1[0] , 2.*x0[0]*x0[1], eps99, eps99); in ForwardCases()
65 ok &= NearEqual(F_00, 2.*x0[1], eps99, eps99); in ForwardCases()
71 ok &= NearEqual(y1[0] , x0[0]*x0[0], eps99, eps99); in ForwardCases()
76 ok &= NearEqual(F_11, 0., eps99, eps99); in ForwardCases()
88 ok &= NearEqual(F_01 , 2.*x0[0], eps99, eps99); in ForwardCases()
136 ok &= NearEqual(v0[0] , f0[0], eps99, eps99); in ForwardOlder()
137 ok &= NearEqual(v0[1] , f0[1], eps99, eps99); in ForwardOlder()
153 g0[0]*u1[0] + g0[1]*u1[1] + g0[2]*u1[2] , eps99, eps99); in ForwardOlder()
155 g1[0]*u1[0] + g1[1]*u1[1] + g1[2]*u1[2] , eps99, eps99); in ForwardOlder()
[all …]
H A Ddiv_eq.cpp25 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in DivEqTestOne() local
68 ok &= NearEqual(Z[x] , 3. / 2. , eps99, eps99); in DivEqTestOne()
69 ok &= NearEqual(Z[y] , 2. / 5. , eps99, eps99); in DivEqTestOne()
75 ok &= NearEqual(w[x] , -1.*U[s]/(U[t]*U[t]) , eps99, eps99); // dx/dt in DivEqTestOne()
76 ok &= NearEqual(w[y] , 1. / 5. , eps99, eps99); // dy/dt in DivEqTestOne()
84 , - 1. / (U[t] * U[t]) , eps99 , eps99 ); in DivEqTestOne()
86 , 2. * U[s] / (U[t] * U[t] * U[t]) , eps99 , eps99 ); in DivEqTestOne()
96 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in DivEqTestTwo() local
117 ok &= NearEqual(Z[0] , u0*u0/(2*4*u0), eps99, eps99); in DivEqTestTwo()
128 ok &= NearEqual(w[0], value/jfac, eps99, eps99); // d^jz/du^j in DivEqTestTwo()
[all …]
H A Dvec_unary.cpp30 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in VecUnary() local
90 ok &= NearEqual(z[0], - x[0], eps99, eps99); in VecUnary()
91 ok &= NearEqual(z[1], sin( x[1] ), eps99, eps99); in VecUnary()
92 ok &= NearEqual(z[2], fabs( x[2] ), eps99, eps99); in VecUnary()
93 ok &= NearEqual(z[3], atan(x[3] ), eps99, eps99); in VecUnary()
94 ok &= NearEqual(z[4], cos( x[4] ), eps99, eps99); in VecUnary()
95 ok &= NearEqual(z[5], exp( x[5] ), eps99, eps99); in VecUnary()
96 ok &= NearEqual(z[6], log( x[6] ), eps99, eps99); in VecUnary()
97 ok &= NearEqual(z[7], sqrt(x[7] ), eps99, eps99); in VecUnary()
H A Datan.cpp27 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in AtanTestOne() local
53 ok &= NearEqual(U[s] , Z[a], eps99 , eps99); in AtanTestOne()
58 ok &= NearEqual(w[a], 1e0, eps99 , eps99); // da/ds in AtanTestOne()
63 ok &= NearEqual(v[s], 1e0, eps99 , eps99); // da/ds in AtanTestOne()
70 ok &= NearEqual(2. * w[a], 0e0, eps99 , eps99); // d^2 a / (ds ds) in AtanTestOne()
76 ok &= NearEqual(r[2 * s + 1] ,0e0, eps99 , eps99 ); // d^2 a / (ds ds) in AtanTestOne()
88 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in AtanTestTwo() local
108 ok &= NearEqual(U[0] , Z[0], eps99 , eps99); in AtanTestTwo()
119 ok &= NearEqual(w[0], value/jfac, eps99, eps99);// d^jz/du^j in AtanTestTwo()
131 { ok &= NearEqual(r[j], value/jfac, eps99, eps99);// d^jz/du^j in AtanTestTwo()
H A Datan2.cpp26 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in ad_ad() local
30 NearEqual( Value( Value(z) ), atan(1.), eps99, eps99); in ad_ad()
43 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in general() local
64 ok &= NearEqual(U[0] , Z[0], eps99, eps99); in general()
69 ok &= NearEqual(w[0] , v[0], eps99, eps99); in general()
74 ok &= NearEqual(w[0] , v[0], eps99, eps99); in general()
79 ok &= NearEqual(w[0] , v[0], eps99, eps99); in general()
90 ok &= NearEqual(w[0], value/jfac, eps99, eps99); // d^jz/du^j in general()
102 { ok &= NearEqual(r[j], value/jfac, eps99, eps99); // d^jz/du^j in general()
H A Djson_graph.cpp493 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in acosh_op()
504 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in acosh_op()
569 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in log1p_op()
580 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in log1p_op()
645 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in expm1_op()
656 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in expm1_op()
721 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in erfc_op()
732 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in erfc_op()
797 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in erf_op()
808 ok &= CppAD::NearEqual(y[0], check, eps99, eps99); in erf_op()
[all …]
H A Dreverse.cpp65 v[0] * g0[i] + v[1] * g1[i], eps99, eps99); in reverse_one()
89 v[0] * g0[i] + v[1] * g1[i], eps99, eps99); in reverse_one()
158 ok &= NearEqual(W0[0] , check, eps99, eps99); in reverse_any_cases()
171 ok &= NearEqual(W1[0], check, eps99, eps99); in reverse_any_cases()
182 ok &= NearEqual(W2[0], check, eps99, eps99); in reverse_any_cases()
191 ok &= NearEqual(dw[0*p+0], u[1]*u[2], eps99, eps99); in reverse_any_cases()
192 ok &= NearEqual(dw[1*p+0], u[0]*u[2], eps99, eps99); in reverse_any_cases()
193 ok &= NearEqual(dw[2*p+0], u[0]*u[1], eps99, eps99); in reverse_any_cases()
201 ok &= NearEqual(dw[0*p+2], dx[1]*dx[2], eps99, eps99); in reverse_any_cases()
202 ok &= NearEqual(dw[1*p+2], dx[0]*dx[2], eps99, eps99); in reverse_any_cases()
[all …]
/dports/math/cppad/CppAD-20210000.8/example/general/
H A Dvec_ad.cpp125 ok &= NearEqual(Y[0] , num0 / den, eps99, eps99); in vec_ad()
126 ok &= NearEqual(Y[1] , num1 / den, eps99, eps99); in vec_ad()
134 ok &= NearEqual(dy[0], 0. - num0 * x[3] / dsq, eps99, eps99); in vec_ad()
135 ok &= NearEqual(dy[1], b[1] / den - num1 * x[3] / dsq, eps99, eps99); in vec_ad()
151 ok &= NearEqual(y[0] , num0 / den, eps99, eps99); in vec_ad()
152 ok &= NearEqual(y[1] , num1 / den, eps99, eps99); in vec_ad()
158 ok &= NearEqual(dy[0],-b[1] / den + num0 * x[2] / dsq, eps99, eps99); in vec_ad()
166 ok &= NearEqual(dw[0], 0. - num0 * x[3] / dsq, eps99, eps99); in vec_ad()
167 ok &= NearEqual(dw[1],-b[1] / den + num0 * x[2] / dsq, eps99, eps99); in vec_ad()
168 ok &= NearEqual(dw[2], 0. + num0 * x[1] / dsq, eps99, eps99); in vec_ad()
[all …]
H A Dindependent.cpp35 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in Test() local
61 ok &= NearEqual(Y[0] , 1., eps99 , eps99); in Test()
62 ok &= NearEqual(Y[1] , 0., eps99 , eps99); in Test()
70 ok &= NearEqual(y[0] , 3., eps99 , eps99); in Test()
71 ok &= NearEqual(y[1] , 2., eps99 , eps99); in Test()
79 ok &= NearEqual(dy[0] , 1., eps99 , eps99); in Test()
80 ok &= NearEqual(dy[1] , x[1], eps99 , eps99); in Test()
86 ok &= NearEqual(dy[0] , 1., eps99 , eps99); in Test()
87 ok &= NearEqual(dy[1] , x[0], eps99 , eps99); in Test()
H A Drev_one.cpp35 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in RevOneCases() local
67 ok &= NearEqual(dw[0], exp(x[1]), eps99, eps99); // w.r.t x[0] in RevOneCases()
68 ok &= NearEqual(dw[1], x[0]*exp(x[1]), eps99, eps99); // w.r.t x[1] in RevOneCases()
72 ok &= NearEqual(dw[0], sin(x[1]), eps99, eps99); in RevOneCases()
73 ok &= NearEqual(dw[1], x[0]*cos(x[1]), eps99, eps99); in RevOneCases()
77 ok &= NearEqual(dw[0], cos(x[1]), eps99, eps99); in RevOneCases()
78 ok &= NearEqual(dw[1], - x[0]*sin(x[1]), eps99, eps99); in RevOneCases()
H A Dfor_one.cpp35 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in ForOneCases() local
67 ok &= NearEqual( dy[0], exp(x[1]), eps99, eps99); // for y[0] in ForOneCases()
68 ok &= NearEqual( dy[1], sin(x[1]), eps99, eps99); // for y[1] in ForOneCases()
69 ok &= NearEqual( dy[2], cos(x[1]), eps99, eps99); // for y[2] in ForOneCases()
73 ok &= NearEqual( dy[0], x[0]*exp(x[1]), eps99, eps99); in ForOneCases()
74 ok &= NearEqual( dy[1], x[0]*cos(x[1]), eps99, eps99); in ForOneCases()
75 ok &= NearEqual( dy[2], -x[0]*sin(x[1]), eps99, eps99); in ForOneCases()
H A Djacobian.cpp37 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in JacobianCases() local
78 ok &= NearEqual( 2.*x[0]*exp(x[1]), jac[0*n+0], eps99, eps99); in JacobianCases()
79 ok &= NearEqual( 2.*x[0]*sin(x[1]), jac[1*n+0], eps99, eps99); in JacobianCases()
80 ok &= NearEqual( 2.*x[0]*cos(x[1]), jac[2*n+0], eps99, eps99); in JacobianCases()
82 ok &= NearEqual( x[0] * x[0] *exp(x[1]), jac[0*n+1], eps99, eps99); in JacobianCases()
83 ok &= NearEqual( x[0] * x[0] *cos(x[1]), jac[1*n+1], eps99, eps99); in JacobianCases()
84 ok &= NearEqual(-x[0] * x[0] *sin(x[1]), jac[2*n+1], eps99, eps99); in JacobianCases()
H A Dreverse_two.cpp35 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in reverse_two_cases() local
60 ok &= NearEqual(y[0] , x[0]*x[0]*x[1], eps99, eps99); in reverse_two_cases()
69 ok &= NearEqual(dy[0], check, eps99, eps99); in reverse_two_cases()
78 ok &= NearEqual(dw[0*2+0] , 2.*x[0]*x[1], eps99, eps99); in reverse_two_cases()
79 ok &= NearEqual(dw[1*2+0] , x[0]*x[0], eps99, eps99); in reverse_two_cases()
83 ok &= NearEqual(dw[0*2+1] , check, eps99, eps99); in reverse_two_cases()
85 ok &= NearEqual(dw[1*2+1] , check, eps99, eps99); in reverse_two_cases()
H A Dad_fun.cpp75 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in ad_fun() local
116 ok &= NearEqual( 2.*x[0]*exp(x[1]), jac[0*n+0], eps99, eps99); in ad_fun()
117 ok &= NearEqual( 2.*x[0]*sin(x[1]), jac[1*n+0], eps99, eps99); in ad_fun()
118 ok &= NearEqual( 2.*x[0]*cos(x[1]), jac[2*n+0], eps99, eps99); in ad_fun()
120 ok &= NearEqual( x[0] * x[0] *exp(x[1]), jac[0*n+1], eps99, eps99); in ad_fun()
121 ok &= NearEqual( x[0] * x[0] *cos(x[1]), jac[1*n+1], eps99, eps99); in ad_fun()
122 ok &= NearEqual(-x[0] * x[0] *sin(x[1]), jac[2*n+1], eps99, eps99); in ad_fun()
H A Dstack_machine.cpp137 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in StackMachine() local
200 ok &= NearEqual(dy[0], 1., eps99, eps99); in StackMachine()
201 ok &= NearEqual(dy[1], 2., eps99, eps99); in StackMachine()
202 ok &= NearEqual(dy[2], 2., eps99, eps99); in StackMachine()
203 ok &= NearEqual(dy[3], .5, eps99, eps99); in StackMachine()
207 ok &= NearEqual(dy[0], 1., eps99, eps99); in StackMachine()
208 ok &= NearEqual(dy[1], 2., eps99, eps99); in StackMachine()
209 ok &= NearEqual(dy[2], 2., eps99, eps99); in StackMachine()
210 ok &= NearEqual(dy[3], .5, eps99, eps99); in StackMachine()
H A Dmul_eq.cpp31 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in MulEq() local
54 ok &= NearEqual(y[0] , x0*2.*4.*x0, eps99, eps99); in MulEq()
55 ok &= NearEqual(y[1] , y[0], eps99, eps99); in MulEq()
62 ok &= NearEqual(dy[0], 8.*2.*x0, eps99, eps99); in MulEq()
63 ok &= NearEqual(dy[1], 8.*2.*x0, eps99, eps99); in MulEq()
71 ok &= NearEqual(dw[0], 8.*2.*x0, eps99, eps99); in MulEq()
H A Dsub_eq.cpp31 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in SubEq() local
54 ok &= NearEqual(y[0] , 3.*x0-(2.+4.+x0), eps99, eps99); in SubEq()
55 ok &= NearEqual(y[1] , y[0], eps99, eps99); in SubEq()
62 ok &= NearEqual(dy[0], 2., eps99, eps99); in SubEq()
63 ok &= NearEqual(dy[1], 2., eps99, eps99); in SubEq()
71 ok &= NearEqual(dw[0], 2., eps99, eps99); in SubEq()
H A Dadd_eq.cpp31 double eps99 = 99.0 * std::numeric_limits<double>::epsilon(); in AddEq() local
54 ok &= NearEqual(y[0] , x0+2.+4.+x0, eps99, eps99); in AddEq()
55 ok &= NearEqual(y[1] , y[0], eps99, eps99); in AddEq()
62 ok &= NearEqual(dy[0], 2., eps99, eps99); in AddEq()
63 ok &= NearEqual(dy[1], 2., eps99, eps99); in AddEq()
71 ok &= NearEqual(dw[0], 2., eps99, eps99); in AddEq()

123456