/dports/math/R-cran-nloptr/nloptr/src/nlopt_src/isres/ |
H A D | isres.c | 78 int *irank = 0; in isres_minimize() local 208 if (fval[irank[j]] > fval[irank[j+1]]) { in isres_minimize() 209 int irankj = irank[j]; in isres_minimize() 210 irank[j] = irank[j+1]; in isres_minimize() 211 irank[j+1] = irankj; in isres_minimize() 215 else if (penalty[irank[j]] > penalty[irank[j+1]]) { in isres_minimize() 217 irank[j] = irank[j+1]; in isres_minimize() 218 irank[j+1] = irankj; in isres_minimize() 233 ri = irank[i]; in isres_minimize() 251 int rk = irank[k]; in isres_minimize() [all …]
|
/dports/math/nlopt/nlopt-2.7.1/src/algs/isres/ |
H A D | isres.c | 78 int *irank = 0; in isres_minimize() local 213 if (fval[irank[j]] > fval[irank[j+1]]) { in isres_minimize() 214 int irankj = irank[j]; in isres_minimize() 215 irank[j] = irank[j+1]; in isres_minimize() 216 irank[j+1] = irankj; in isres_minimize() 220 else if (penalty[irank[j]] > penalty[irank[j+1]]) { in isres_minimize() 222 irank[j] = irank[j+1]; in isres_minimize() 223 irank[j+1] = irankj; in isres_minimize() 238 ri = irank[i]; in isres_minimize() 256 int rk = irank[k]; in isres_minimize() [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/ndimage/src/ |
H A D | ni_interpolation.c | 273 int irank = 0, orank, spline_mode; in NI_GeometricTransform() local 282 irank = PyArray_NDIM(input); in NI_GeometricTransform() 314 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() 326 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() 328 for(jj = 0; jj < irank; jj++) { in NI_GeometricTransform() 343 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() 345 for(jj = 0; jj < irank; jj++) { in NI_GeometricTransform() 355 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() 375 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() 379 for(jj = 0; jj < irank; jj++) in NI_GeometricTransform() [all …]
|
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/fistr1/src/lib/contact/ |
H A D | fstr_contact_comm.f90 | 64 irank = hecMESH%node_ID(2*irow) 65 call rank_to_idom(hecMESH, irank, idom) 72 irank = hecMESH%neighbor_pe(idom) 79 irank = hecMESH%neighbor_pe(idom) 103 irank = hecMESH%node_ID(2*irow) 116 irank = hecMESH%neighbor_pe(idom) 128 irank = hecMESH%neighbor_pe(idom) 272 irank = neighbor_pe(idom) 283 irank = neighbor_pe(idom) 346 irank = neighbor_pe(idom) [all …]
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/rdmft/recycling/wfn1/ |
H A D | wfn1_overlap.F | 177 integer irank !< The rank of the matrix done so far 186 irank = 0 193 irank = 0 198 irank = 1 225 irank = irank + 1 300 integer irank !< The rank of the matrix done so far 303 irank = 0 309 irank = 0 313 irank = 1 340 irank = irank + 1
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/rdmft/recycling/wfn1/ |
H A D | wfn1_overlap.F | 177 integer irank !< The rank of the matrix done so far 186 irank = 0 193 irank = 0 198 irank = 1 225 irank = irank + 1 300 integer irank !< The rank of the matrix done so far 303 irank = 0 309 irank = 0 313 irank = 1 340 irank = irank + 1
|
/dports/science/cdo/cdo-2.0.0/src/ |
H A D | percentiles.cc | 50 auto irank = (size_t) std::ceil(len * (pn / 100.0)); in percentile_nrank() local 51 irank = std::min(std::max(irank, static_cast<size_t>(1)), len); in percentile_nrank() 52 return get_nth_element(array, len, irank - 1); in percentile_nrank() 101 size_t irank = 0; in percentile_numpy() local 103 … if (interpolation_method == InterpolationMethod::LOWER) irank = (size_t) std::floor(rank); in percentile_numpy() 104 … else if (interpolation_method == InterpolationMethod::HIGHER) irank = (size_t) std::ceil(rank); in percentile_numpy() 105 … else if (interpolation_method == InterpolationMethod::NEAREST) irank = (size_t) std::lround(rank); in percentile_numpy() 109 irank = std::min(std::max(irank, static_cast<size_t>(1)), len); in percentile_numpy() 111 percentil = get_nth_element(array, len, irank - 1); in percentile_numpy()
|
/dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
H A D | dpagerank2.m | 1 function [r,irank,iters] = dpagerank2 (A, tol, itermax) 4 % [r,irank,iters] = dpagerank2 (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 16 % [r,irank,iters] = dpagerank2 (A, tol, itermax) ; 56 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|
/dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/GraphBLAS/Demo/MATLAB/ |
H A D | dpagerank.m | 1 function [r,irank] = dpagerank (A) 4 % [r,irank] = dpagerank (A) ; 8 % irank is a permutation of 1:n with irank(1) being the top ranked page, 9 % irank(2) is the 2nd ranked page, and so on. r is the pagerank of the nodes, 10 % where r(k) is pagerank of page irank(k). 33 [r,irank] = sort (r, 'descend') ;
|