/dports/lang/maude/maude-2.7.1/src/Utility/ |
H A D | mpzGcdTrivial.cc | 141 mpz_class y_k; in solveTwoVariableProblem() local 144 if (y_k > t) in solveTwoVariableProblem() 145 t = y_k; in solveTwoVariableProblem() 165 mpz_class y_k; in solveTwoVariableProblem() local 168 if (y_k < 0) in solveTwoVariableProblem() 171 bound = y_k; in solveTwoVariableProblem() 181 mpz_class y_k; in solveTwoVariableProblem() local 184 if (y_k > t) in solveTwoVariableProblem() 185 t = y_k; in solveTwoVariableProblem() 205 mpz_class y_k; in solveTwoVariableProblem() local [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/ |
H A D | DUPLICATE-sr1 | 8 B_{k+1} = B_k + \frac{(y_k - B_k s_k)(y_k - B_k s_k)^T}{(y_k - B_k s_k)^T s_k} 13 \f$y_k = \nabla f_{k+1} - \nabla f_k\f$ is the corresponding yield 19 \f$\frac{y_k^T y_k}{y_k^T s_k} I\f$ is used for \f$B_0\f$ prior to the first 24 \f$|(y_k - B_k s_k)^T s_k| < 10^{-6} ||s_k||_2 ||y_k - B_k s_k||_2\f$
|
H A D | DUPLICATE-bfgs | 9 \frac{y_k y_k^T}{y_k^T s_k} 14 \f$y_k = \nabla f_{k+1} - \nabla f_k\f$ is the corresponding yield 20 \f$\frac{y_k^T y_k}{y_k^T s_k} I\f$ is used for \f$B_0\f$ prior to the first 25 \f$|y_k^T s_k| < 10^{-6} s_k^T B_k s_k\f$ 28 damped BFGS update when the curvature condition \f$y_k^T s_k > 0\f$
|
/dports/science/dynare/dynare-4.6.4/tests/lmmcp/ |
H A D | rbc.mod | 47 y_k = (Efficiency^(-psi)*(1/beta-1+delta)/alpha)^(1/(1-psi)); 48 c_k = y_k - delta; 49 n_k = (((y_k/Efficiency)^psi-alpha)/(1-alpha))^(1/psi); 50 y_n = y_k/n_k; 52 Labour = y_k*(1-alpha)/(((1-theta)/theta)*c_k*(alpha*n_k^(-psi)+1-alpha)+y_k*(1-alpha));
|
/dports/science/dynare/dynare-4.6.4/tests/steady_state/ |
H A D | walsh1_old_ss_steadystate.m | 18 y_k = (1/alphha)*(1/betta-1+delta); variable 19 ek = en*y_k^(-1/(1-alphha)); 20 ec = ek*(y_k-delta); 22 ey = ek*y_k;
|
H A D | walsh1_ssm_block.mod | 56 y_k = (1/alpha)*(1/beta-1+delta); 57 ek = en*y_k^(-1/(1-alpha)); 58 ec = ek*(y_k-delta); 60 ey = ek*y_k;
|
H A D | walsh1_ssm.mod | 56 y_k = (1/alpha)*(1/beta-1+delta); 57 ek = en*y_k^(-1/(1-alpha)); 58 ec = ek*(y_k-delta); 60 ey = ek*y_k;
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/tools/thermal/tmon/ |
H A D | pid.c | 75 p_param.y_k = 0.0; in controller_reset() 116 p_param.y_k = *yk; in controller_handler() 118 set_ctrl_state(lround(fabs(p_param.y_k))); in controller_handler()
|
/dports/multimedia/libv4l/linux-5.13-rc2/tools/thermal/tmon/ |
H A D | pid.c | 75 p_param.y_k = 0.0; in controller_reset() 116 p_param.y_k = *yk; in controller_handler() 118 set_ctrl_state(lround(fabs(p_param.y_k))); in controller_handler()
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/tools/thermal/tmon/ |
H A D | pid.c | 75 p_param.y_k = 0.0; in controller_reset() 116 p_param.y_k = *yk; in controller_handler() 118 set_ctrl_state(lround(fabs(p_param.y_k))); in controller_handler()
|
/dports/math/cppad/CppAD-20210000.8/example/general/ |
H A D | base2ad.cpp | 154 a_vector y_k = y; in taylor_ode() local 161 a_vector z_k = fun_g.Forward(k, y_k); in taylor_ode() 169 y_k[i] = z_k[i] / a_double(k + 1); in taylor_ode() 173 next[i] += y_k[i] * dt_k; in taylor_ode()
|
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/quadrature/ |
H A D | pardgsimplexquadrature2d.cc | 68 double y_k = 1.0; in check() local 70 for(int i=1; i<=k; i++) y_k *= x(r)[1]; in check() 71 sum += w(r) * x_n * y_k; in check()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/optimization/ |
H A D | solver_bfgs.h | 311 VectorType g(x), p(x), y_k(x), s_k(x); in solve() 363 y_k = g; in solve() 367 y_k.sadd(-1, 1, g); in solve() 380 const Number curvature = s_k * y_k; in solve() 387 y.add(y_k); in solve()
|
/dports/math/viennacl/ViennaCL-1.7.1/viennacl/linalg/detail/spai/ |
H A D | fspai.hpp | 327 std::vector<std::vector<NumericT> > y_k(A.size1()); in computeFSPAI() local 344 fill_blocks(STL_A, subblocks_A, J, y_k); in computeFSPAI() 368 for (vcl_size_t i=0; i<y_k.size(); ++i) in computeFSPAI() 377 cholesky_solve(subblocks_A[i], y_k[i]); in computeFSPAI() 390 computeL(A, L, L_trans, y_k, J); in computeFSPAI()
|
/dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/what4-1.1/src/What4/Expr/ |
H A D | UnaryBV.hs | 284 go m x_prev x_a@((x_k,x_p):x_r) y_prev y_a@((y_k,y_p):y_r) = 285 case compare x_k y_k of 291 go (Map.insert y_k p m) x_prev x_a y_p y_r 300 go1 m fn ((y_k,y_p):y_r) = do 302 go1 (Map.insert y_k p m) fn y_r 340 | Just (y_k, y_p) <- Map.lookupGE x_k y = 341 case x_k == y_k of 343 go sym r y_k y_p y x 373 , Just (y_k, _) <- Map.lookupGT x_k y 375 , Just (x_k_max, x_p) <- Map.lookupLT y_k x = do [all …]
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/utils/ |
H A D | multiclass.py | 413 classes_k, y_k = np.unique( 416 class_prior_k = np.bincount(y_k, weights=nz_samp_weight) 434 classes_k, y_k = np.unique(y[:, k], return_inverse=True) 437 class_prior_k = np.bincount(y_k, weights=sample_weight)
|
/dports/math/py-jax/jax-0.2.9/jax/_src/scipy/optimize/ |
H A D | bfgs.py | 140 y_k = g_kp1 - state.g_k 141 rho_k = jnp.reciprocal(_dot(y_k, s_k)) 143 sy_k = s_k[:, jnp.newaxis] * y_k[jnp.newaxis, :]
|
/dports/devel/ppl/ppl-1.2/src/ |
H A D | Polyhedron_widenings.cc | 609 Linear_Expression::const_iterator y_k = y.begin(); in modify_according_to_evolution() local 618 while (y_k != y_end && y_k.variable().id() < k) { in modify_according_to_evolution() 619 ++y_k; in modify_according_to_evolution() 622 if (y_k == y_end) { in modify_according_to_evolution() 626 const Variable y_k_var = y_k.variable(); in modify_according_to_evolution() 630 Linear_Expression::const_iterator y_h = y_k; in modify_according_to_evolution() 656 Parma_Polyhedra_Library::sub_mul_assign(tmp, *x_h, *y_k); in modify_according_to_evolution()
|
/dports/math/octave-forge-control/control-3.3.1/inst/ |
H A D | moesp.m | 139 ## $$ y_k = C x_k + D u_k $$ 156 ## $$ y_k = C x_k + D u_k + e_k $$ 173 ## $$ y_k = C x_k + D u_k + L v_k $$ 189 ## $$ \\widehat{x}_{k+1} = A \\widehat{x}_k + B u_k + K (y_k - \\widehat{y}_k) $$ 204 ## $$ \\widehat{x}_{k+1} = (A-KC) \\widehat{x}_k + (B-KD) u_k + K y_k $$ 205 ## $$ \\widehat{y}_k = C \\widehat{x}_k + D u_k + 0 y_k $$
|
H A D | n4sid.m | 139 ## $$ y_k = C x_k + D u_k $$ 156 ## $$ y_k = C x_k + D u_k + e_k $$ 173 ## $$ y_k = C x_k + D u_k + L v_k $$ 189 ## $$ \\widehat{x}_{k+1} = A \\widehat{x}_k + B u_k + K (y_k - \\widehat{y}_k) $$ 204 ## $$ \\widehat{x}_{k+1} = (A-KC) \\widehat{x}_k + (B-KD) u_k + K y_k $$ 205 ## $$ \\widehat{y}_k = C \\widehat{x}_k + D u_k + 0 y_k $$
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/Eigen3/src/itkeigen/Eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); in upperbidiagonalization_blocked_helper() 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper() 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper() 211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper() 212 y_k *= numext::conj(tau_v); in upperbidiagonalization_blocked_helper()
|
/dports/devel/bullet/bullet3-3.21/examples/ThirdPartyLibs/Eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); in upperbidiagonalization_blocked_helper() 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper() 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper() 211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper() 212 y_k *= numext::conj(tau_v); in upperbidiagonalization_blocked_helper()
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/eigen/vtkeigen/eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); in upperbidiagonalization_blocked_helper() 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper() 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper() 211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper() 212 y_k *= numext::conj(tau_v); in upperbidiagonalization_blocked_helper()
|
/dports/math/pdal/PDAL-2.3.0/vendor/eigen/Eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); in upperbidiagonalization_blocked_helper() 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper() 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper() 211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper() 212 y_k *= numext::conj(tau_v); in upperbidiagonalization_blocked_helper()
|
/dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 203 SubColumnType y_k( Y.col(k).tail(remainingCols) ); in upperbidiagonalization_blocked_helper() 207 y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; // bottleneck in upperbidiagonalization_blocked_helper() 209 y_k.noalias() -= Y_k.leftCols(k) * tmp; in upperbidiagonalization_blocked_helper() 211 y_k.noalias() -= U_k1.adjoint() * tmp; in upperbidiagonalization_blocked_helper() 212 y_k *= numext::conj(tau_v); in upperbidiagonalization_blocked_helper()
|