/dports/security/putty-nogtk/putty-0.76/ |
H A D | ecc.c | 225 mp_int *lambda_n2 = monty_mul(wc->mc, lambda_n, lambda_n); in ecc_weierstrass_epilogue() 265 mp_int **lambda_n, mp_int **lambda_d) in ecc_weierstrass_add_prologue() argument 286 *lambda_n = monty_sub(wc->mc, Qy, *Py); in ecc_weierstrass_add_prologue() 303 mp_int *Px, *Py, *Qx, *denom, *lambda_n, *lambda_d; in ecc_weierstrass_add() local 311 assert(!mp_eq_integer(lambda_n, 0)); in ecc_weierstrass_add() 320 mp_free(lambda_n); in ecc_weierstrass_add() 346 *lambda_n = monty_add(wc->mc, threeX2, aZ4); in ecc_weierstrass_tangent_slope() 362 mp_int *lambda_n, *lambda_d; in ecc_weierstrass_double() local 365 mp_free(lambda_n); in ecc_weierstrass_double() 401 mp_select_into(lambda_n, lambda_n, lambda_n_tangent, equality); in ecc_weierstrass_add_general() [all …]
|
/dports/security/putty/putty-0.76/ |
H A D | ecc.c | 225 mp_int *lambda_n2 = monty_mul(wc->mc, lambda_n, lambda_n); in ecc_weierstrass_epilogue() 265 mp_int **lambda_n, mp_int **lambda_d) in ecc_weierstrass_add_prologue() argument 286 *lambda_n = monty_sub(wc->mc, Qy, *Py); in ecc_weierstrass_add_prologue() 303 mp_int *Px, *Py, *Qx, *denom, *lambda_n, *lambda_d; in ecc_weierstrass_add() local 311 assert(!mp_eq_integer(lambda_n, 0)); in ecc_weierstrass_add() 320 mp_free(lambda_n); in ecc_weierstrass_add() 346 *lambda_n = monty_add(wc->mc, threeX2, aZ4); in ecc_weierstrass_tangent_slope() 362 mp_int *lambda_n, *lambda_d; in ecc_weierstrass_double() local 365 mp_free(lambda_n); in ecc_weierstrass_double() 401 mp_select_into(lambda_n, lambda_n, lambda_n_tangent, equality); in ecc_weierstrass_add_general() [all …]
|
/dports/ftp/filezilla/filezilla-3.55.1/src/putty/ |
H A D | ecc.c | 225 mp_int *lambda_n2 = monty_mul(wc->mc, lambda_n, lambda_n); in ecc_weierstrass_epilogue() 265 mp_int **lambda_n, mp_int **lambda_d) in ecc_weierstrass_add_prologue() argument 286 *lambda_n = monty_sub(wc->mc, Qy, *Py); in ecc_weierstrass_add_prologue() 303 mp_int *Px, *Py, *Qx, *denom, *lambda_n, *lambda_d; in ecc_weierstrass_add() local 311 assert(!mp_eq_integer(lambda_n, 0)); in ecc_weierstrass_add() 320 mp_free(lambda_n); in ecc_weierstrass_add() 346 *lambda_n = monty_add(wc->mc, threeX2, aZ4); in ecc_weierstrass_tangent_slope() 362 mp_int *lambda_n, *lambda_d; in ecc_weierstrass_double() local 365 mp_free(lambda_n); in ecc_weierstrass_double() 401 mp_select_into(lambda_n, lambda_n, lambda_n_tangent, equality); in ecc_weierstrass_add_general() [all …]
|
/dports/science/bagel/bagel-1.2.2/src/opt/ |
H A D | update.cc | 207 double lambda_n = 0.0; in get_step_ef() local 209 lambda_n += -(f[i] * f[i]) / (eigv[i] - lambda); in get_step_ef() 210 lambda = lambda_n; in get_step_ef() 245 double lambda_n = 100.0; in get_step_ef_pn() local 276 const double lambda_n_prev = lambda_n; in get_step_ef_pn() 279 lambda_n_n += -(f2[j] * f2[j]) / (eigv[j+size_p] - lambda_n); in get_step_ef_pn() 280 lambda_n = lambda_n_n; in get_step_ef_pn() 282 const double error = fabs(lambda_n_prev - lambda_n); in get_step_ef_pn() 299 const double fb = f2[j] / (eigv[j+size_p] - lambda_n); in get_step_ef_pn()
|
/dports/science/mpqc/mpqc-2.3.1/src/lib/math/optimize/ |
H A D | efc.cc | 269 double lambda_n; in update() local 272 lambda_n=nlambda; in update() 278 (lambda_n - evals.get_element(i)); in update() 280 } while(fabs(nlambda-lambda_n) > 1.0e-8); in update() 284 << indent << scprintf("lambda_n = %8.5g",lambda_n) << endl; in update() 295 double Fiobil = F(i) / (evals(i)-lambda_n); in update()
|
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
H A D | trafontmortar2.c | 180 constantt=1.E10,atau,lambda_n,nlambda_t,*u_tilde=NULL,resreg[2], in trafontmortar2() local 319 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 539 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 765 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 1068 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 1308 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 1621 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 1845 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 2148 lambda_n=n2[0]*cstress2[(islavnodeentry-1)*mt]+ in trafontmortar2() 2223 hpn=gap[islavnodeentry-1]+gnc-dgnc*lambda_n; in trafontmortar2() [all …]
|
/dports/science/mpqc/mpqc-2.3.1/src/bin/mpqc/validate/ref/ |
H A D | optts_az2scf321gc1opt.out | 167 lambda_n = -1.8414e-06 252 lambda_n = -0.00016716 339 lambda_n = -0.00019114 424 lambda_n = -2.6814e-05 511 lambda_n = -2.4015e-05 598 lambda_n = -1.3739e-06 687 lambda_n = -2.6291e-07 774 lambda_n = -2.3085e-08 859 lambda_n = -1.9461e-08 963 lambda_n = -1.4615e-08 [all …]
|
H A D | optts_az3scf321gc1opt.out | 159 lambda_n = -4.6606e-07 242 lambda_n = -0.00012782 327 lambda_n = -0.00014922 414 lambda_n = -1.3192e-05 497 lambda_n = -4.8219e-06 580 lambda_n = -2.7075e-07 669 lambda_n = -1.0883e-07 762 lambda_n = 1.4137e-09
|
H A D | ckpt_efcopt.out | 115 lambda_n = -0.011841 196 lambda_n = -0.0041882 277 lambda_n = -0.0017873
|
H A D | ckpt_1efcopt.out | 89 lambda_n = -0.0041882
|
H A D | ckpt_2efcopt.out | 89 lambda_n = -0.0017873
|
H A D | ckpt_0efcopt.out | 115 lambda_n = -0.011841
|
/dports/math/openturns/openturns-1.18/python/doc/theory/meta_modeling/ |
H A D | enumeration_strategy.rst | 204 appropriate increasing sequence :math:`(\lambda_n)_{\Nset}` that tends 213 sequence :math:`(\lambda_n)_{\Nset}` as the set of natural integers 282 :math:`(\lambda_n)_{\Nset}` recursively by: 289 \forall \; n \geq 1 \, \, , \, \, \lambda_n \, \, = \, \, 294 In other words, :math:`\lambda_n` is the infimum of the real numbers 303 …\forall \; n \geq 1 \, \, , \, \, \Delta_n \, \, = \, \, \cA_{\lambda_n} \; \setminus \; \cA_{\l… 330 :math:`(\lambda_n)_{\Nset}` is equal to :math:`\Nset` and the sets
|
/dports/science/siesta/siesta-4.1.5/Src/ |
H A D | m_zminim.F90 | 553 real(dp) :: lambda_n local 1295 lambda_n=0.0_dp 1299 lambda_n=lambda_n+aimag(pg(k,l))*(aimag(g(k,l))-aimag(g_p(k,l))) 1310 lambda_n=0.0_dp 1313 lambda_n=lambda_n+real(g(k,l),dp)*(real(g(k,l),dp)-real(g_p(k,l),dp)) 1314 lambda_n=lambda_n+aimag(g(k,l))*(aimag(g(k,l))-aimag(g_p(k,l))) 1523 real(dp) :: lambda_n local 2087 lambda_n=0.0_dp 2091 lambda_n=lambda_n+aimag(pg(k,l))*(aimag(g(k,l))-aimag(g_p(k,l))) 2102 lambda_n=0.0_dp [all …]
|
H A D | m_dminim.F90 | 471 real(dp) :: lambda_n local 1206 lambda_n=ddot(N_occ_loc(1,ispin)*h_dim_loc(2),pg,1,g-g_p,1) 1209 lambda_n=ddot(N_occ_loc(1,ispin)*h_dim_loc(2),g,1,g-g_p,1) 1213 call mpi_allreduce(lambda_n,lambda_n_tot,1,mpi_double_precision,mpi_sum,mpi_comm_world,info) 1217 lambda=lambda_n/lambda_d 1392 real(dp) :: lambda_n local 1957 lambda_n=ddot(N_occ_loc(1,ispin)*h_dim_loc(2),pg,1,g-g_p,1) 1960 lambda_n=ddot(N_occ_loc(1,ispin)*h_dim_loc(2),g,1,g-g_p,1) 1964 call mpi_allreduce(lambda_n,lambda_n_tot,1,mpi_double_precision,mpi_sum,mpi_comm_world,info) 1968 lambda=lambda_n/lambda_d
|
/dports/devel/R-cran-sfsmisc/sfsmisc/man/ |
H A D | posdefify.Rd | 29 \lambda_2 \ge \ldots \ge \lambda_n}{l[1] >= l[2] >= ... >= l[n]}. 31 When the smallest eigenvalue \eqn{\lambda_n}{l[n]} are less than
|
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/alberta/src/Common/ |
H A D | parametric.c | 983 static void nl_update(void *vdata, int dim, const REAL *lambda_n, in nl_update() argument 1003 (const REAL_B *)lambda_n, &x_n); in nl_update() 1007 f[DIM_OF_WORLD] += lambda_n[i]; in nl_update() 1017 grd_phi = GRD_PHI(bfcts, k, lambda_n); in nl_update()
|
/dports/math/R-cran-spdep/spdep/R/ |
H A D | lextrW.R | 57 res <- c(lambda_n=c(resln_3), lambda_1=c(resl1)) nameattr in c 209 res <- c(lambda_n=c(resln_3), lambda_1=c(resl1)) nameattr in c
|
H A D | lextrB.R | 128 res <- c(lambda_n=c(lambda.n), lambda_1=c(resl1)) nameattr in c
|
/dports/math/pari/pari-2.13.3/src/functions/elliptic_curves/ |
H A D | ellpadiclambdamu | 33 Let $\lambda_n,\mu_n$ be the invariants of $P_n$. We find that
|
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
H A D | meshMetric.cpp | 544 double lambda_n = in computeMetricEigenDir() local 552 lambda_n = 1. / (h_dista * h_dista); in computeMetricEigenDir() 559 lambda_n = in computeMetricEigenDir() 630 std::min(std::max(lambda_n, metric_value_hmax), in computeMetricEigenDir()
|
/dports/astro/siril/siril/src/opencv/ecc/ |
H A D | ecc.cpp | 528 const double lambda_n = (imgNorm * imgNorm) in findTransform_ECC() local 540 const double lambda = (lambda_n / lambda_d); in findTransform_ECC()
|
/dports/graphics/opencv/opencv-4.5.3/modules/video/src/ |
H A D | ecc.cpp | 584 const double lambda_n = (imgNorm*imgNorm) - imageProjection.dot(imageProjectionHessian); in findTransformECC() local 592 const double lambda = (lambda_n/lambda_d); in findTransformECC()
|
/dports/math/arb/arb-2.21.1/doc/source/ |
H A D | examples.rst | 85 `\lambda_0, \ldots, \lambda_n`. The Keiper-Li coefficients 86 have the property that `\lambda_n > 0` for all `n > 0` if and only if the
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/doc/tex/inputs/dev/ |
H A D | Kernel.tex | 228 $$K(x,y)=\sum_{1\le n\le N} \psi_n(x)\lambda_n\phi_n(y).$$
|