/dports/math/e-antic/flint2-ae7ec89/fmpz_factor/ |
H A D | refine.c | 57 fr_node_ptr L_j, fr_node_ptr L_j_tail); 331 fr_node_ptr L_j, fr_node_ptr L_j_tail) in augment_refinement() argument 352 while (L_j && !fmpz_is_one(m)) in augment_refinement() 354 if (!fr_node_is_one(L_j)) in augment_refinement() 358 fr_node_mref(L_j), L_j->e); in augment_refinement() 371 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 379 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 380 fr_node_list_concat(&L_jp1, &L_jp1_tail, L_j, L_j_tail); in augment_refinement()
|
/dports/math/flint2/flint-2.8.4/fmpz_factor/ |
H A D | refine.c | 57 fr_node_ptr L_j, fr_node_ptr L_j_tail); 331 fr_node_ptr L_j, fr_node_ptr L_j_tail) in augment_refinement() argument 352 while (L_j && !fmpz_is_one(m)) in augment_refinement() 354 if (!fr_node_is_one(L_j)) in augment_refinement() 358 fr_node_mref(L_j), L_j->e); in augment_refinement() 371 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 379 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 380 fr_node_list_concat(&L_jp1, &L_jp1_tail, L_j, L_j_tail); in augment_refinement()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_factor/ |
H A D | refine.c | 57 fr_node_ptr L_j, fr_node_ptr L_j_tail); 331 fr_node_ptr L_j, fr_node_ptr L_j_tail) in augment_refinement() argument 352 while (L_j && !fmpz_is_one(m)) in augment_refinement() 354 if (!fr_node_is_one(L_j)) in augment_refinement() 358 fr_node_mref(L_j), L_j->e); in augment_refinement() 371 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 379 fr_node_list_pop_front(&L_j, &L_j_tail); in augment_refinement() 380 fr_node_list_concat(&L_jp1, &L_jp1_tail, L_j, L_j_tail); in augment_refinement()
|
/dports/math/pari/pari-2.13.3/src/functions/linear_algebra/ |
H A D | matconcat | 44 let $L_j$ be the maximum over $i$ of the heights of the $v_{i,j}$. 46 $H_i \times L_j$. 49 of the block dimension $\min (H_i,L_j)$
|
/dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/DALTON/mlcc/ |
H A D | mlccsdpt_integrals.F90 | 57 real(dp), dimension(:), pointer, private :: L_j => null() variable 143 call work_allocator(L_j,n_occ_act*n_occ_gen) 481 call work_deallocator(L_j) 633 & b_beta,n_basis,zero,L_j,n_occ_gen) 672 call daxpy(n_occ_act*n_occ_gen,orb_coefficients(orb_c_delta),L_j,1,L_j_c_k(int_off),1)
|
H A D | mlcc3_intermediates.F90 | 66 real(dp), dimension(:), pointer, private :: L_j => null() variable 182 call work_allocator(L_j,n_occ_act*n_occ_gen) 681 call work_deallocator(L_j) 955 & b_beta,n_basis,zero,L_j,n_occ_gen) 1035 call daxpy(n_occ_act*n_occ_gen,lambda_part(lambda_c_delta),L_j,1,L_j_c_k(int_off),1) 1199 & b_beta,n_basis,zero,L_j,n_occ_gen) 1266 … call daxpy(n_occ_act*n_occ_gen,lambda_part_3(lambda_c_delta),L_j,1,L_j_c_k(int_off),1)
|
/dports/math/gap/gap-4.11.0/pkg/NConvex-2019.12.10/gap/ |
H A D | NPolytope.gd | 29 #! The operation takes a list $L$ of lists $[L_1, L_2, ...]$ where each $L_j$ represents 31 #! For example the $j$'th entry $L_j = [c_j,a_{j1},a_{j2},...,a_{jn}]$ corresponds to the inequality 99 #! $L_j=[c_j,a_{j1},a_{j2},...,a_{jn}]$ represents the inequality 124 #! The operation returns list of lists $L$. The entries of each $L_j$ 125 #! in $L$ consists of $0$'s or $1$'s. For instance, if $L_j=[1,0,0,1,0,1]$, then
|
H A D | NPolyhedron.gd | 28 #! The function takes a list of lists <C>L</C>$:=[L_1, L_2, ...]$ where each $L_j$ represents 30 #! For example the $j$'th entry $L_j = [c_j,a_{j1},a_{j2},...,a_{jn}]$ corresponds to the inequality
|
H A D | NCone.gd | 29 #! The function takes a list of lists $[L_1, L_2, ...]$ where each $L_j$ represents 31 #! For example the $j$'th entry $L_j = [a_{j1},a_{j2},...,a_{jn}]$ corresponds to the inequality
|
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
H A D | meshGFaceTransfinite.cpp | 321 double L_j = 0.0; in MeshTransfiniteSurface() local 330 L_j += 0.5 * (d1 + d2); in MeshTransfiniteSurface() 333 L_j += d1; in MeshTransfiniteSurface() 335 lengths_j.push_back(L_j); in MeshTransfiniteSurface() 383 double v = lengths_j[j] / L_j; in MeshTransfiniteSurface() 403 double v = lengths_j[j] / L_j; in MeshTransfiniteSurface()
|
H A D | meshGRegionTransfinite.cpp | 365 double L_i = 0., L_j = 0., L_k = 0.; in MeshTransfiniteVolume() local 378 L_j += v1->distance(v2); in MeshTransfiniteVolume() 379 lengths_j.push_back(L_j); in MeshTransfiniteVolume() 412 double v = lengths_j[j] / L_j; in MeshTransfiniteVolume()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/ |
H A D | tracking.rst | 32 L_j = L_{distance} ( \times L_{color} ) 34 w = \sum{}^{} L_j
|
/dports/net-p2p/c-lightning/lightning-0.10.2/external/libwally-core/src/secp256k1/src/modules/whitelist/ |
H A D | whitelist.md | 72 a key `W`, the participant computes the key `L_j = P_j + H(W + Q_j)(W + Q_j)` for 77 a ring signature over all the keys `L_j`. This proves that she knows the discrete
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/latex-theory/ |
H A D | Theory_UQ_StochExp.tex | 102 R(\xi) \cong I^l(R) = \sum_{j=1}^{m_l} r(\xi_j)\,L_j(\xi) \label{eq:lagrange_interp_1d} 130 L_j = \prod_{\stackrel{\scriptstyle k=1}{k \ne j}}^m 133 where it is evident that $L_j$ is 1 at $\xi = \xi_j$, is 0 for each of 200 L_j(\xi) = 213 L_j(\xi) = 220 function $L_j$ over the range $\xi \in [a, b]$. For the special case 266 same local or global definitions for $L_j(\xi)$, $H_j^{(1)}(\xi)$, and 276 \sum_{j=1}^{m_l} \left[ r(\xi_j) - I^{l-1}(R)(\xi_j) \right] \,L_j(\xi) & 302 \sum_{j=1}^{m_{\Delta_l}} s(\xi_j)\,L_j(\xi) & \text{value-based}\\
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/fe/ |
H A D | fe_nedelec.cc | 780 const double L_j = in initialize_restriction() local 785 system_rhs(j, k) += tmp(k) * L_j; in initialize_restriction()
|
/dports/graphics/frogr/frogr-1.6/po/ |
H A D | is.po | 483 msgstr "L_jósmynd"
|
/dports/math/giacxcas/giac-1.6.0/doc/fr/ |
H A D | algo.tex | 14012 $$ L_j \leftarrow L_j - M_{j,c} L_l, $$ 14017 $L_j \leftarrow L_j+M_{j,c} L_l $ (avec le coefficient de la matrice 14035 remplacer 2d par $ L_j \leftarrow L_j - \frac{M_{j,c}}{M_{l,c}} L_l, $ 14094 $L_j \leftarrow L_j - \frac{p_j}{p}L_i$.\\ 14118 par $L_j \leftarrow (pL_j -p_j L_i)/b$. 14483 \[ L_i \leftarrow uL_i +v L_j, \quad 14484 L_j \leftarrow -\frac{b}{d} L_i + \frac{a}{d} L_j \] 14497 une combinaison lin\'eaire de lignes $L_j = L_j-qL_p, j<p$ o\`u $q$ 14780 \[ L_j = \tilde{L}_j^{-1} = \left( \begin{array}{ccccccc} 14794 par ceux de $L_j$, ce qui donne une matrice $L$ triangulaire [all …]
|
/dports/math/pari/pari-2.13.3/doc/ |
H A D | usersch3.tex | 12111 let $L_j$ be the maximum over $i$ of the heights of the $v_{i,j}$. 12113 $H_i \times L_j$. 12116 of the block dimension $\min (H_i,L_j)$
|
/dports/graphics/gimp-app/gimp-2.10.30/po/ |
H A D | is.po | 5176 msgstr "L_jósbrotsmynstur..."
|
/dports/devel/godot-tools/godot-demo-projects-8d9d58f112d8/3d/material_testers/backgrounds/ |
H A D | schelde.hdr | 15923 …�ur��u����wlد�q����������{��wv|����Ҽ����������������p}��ϩ���������s��}Ρ����L_j~h�Ƃ�����z����n�Ǘ��…
|
/dports/security/hashcat-legacy/hashcat-legacy-2.00/salts/ |
H A D | brute-vbulletin.salt | 403160 L_j
|