Home
last modified time | relevance | path

Searched refs:gap_around (Results 1 – 3 of 3) sorted by relevance

/dports/science/ergo/ergo-3.8/source/test/recursive_expansion_tests/
H A Drecexp_eigenv_test.cc99 double gap_around; in test1() local
122 gap_around = atof(argv[5]); in test1()
138 gap_around = 0.5; in test1()
186 printf("gap_around %lf\n", gap_around); in test1()
381 double gap_around; in test2() local
388 gap_around = 0.5; in test2()
434 printf("gap_around %lf\n", gap_around); in test2()
574 double gap_around; in test3() local
581 gap_around = 0.5; in test3()
766 double gap_around; in test4() local
[all …]
H A Drecexp_diag_test.cc109 double gap_around; in main() local
128 gap_around = atof(argv[5]); in main()
141 gap_around = 0.5; in main()
155 eigvalList[i] = (double)i/(N_occ-1)*(gap_around-gap/2); in main()
158 eigvalList[N_occ+i] = (double)i/(N-N_occ-1)*(1-(gap_around+gap/2)) + gap_around+gap/2; in main()
165 eigvalList[i] = (double)rand()/RAND_MAX*(gap_around-gap/2); in main()
166 eigvalList[N_occ-1] = gap_around-gap/2; in main()
168 eigvalList[N_occ] = gap_around+gap/2; in main()
170 eigvalList[N_occ+i] = (double)rand()/RAND_MAX*(1-(gap_around+gap/2)) + gap_around+gap/2; in main()
182 printf("gap_around %lf\n", gap_around); in main()
H A Drecexp_sprandsym.cc126 double gap_around = 0.5; in main() local
145 gap_around = atof(argv[5]); in main()
168 printf("gap_around %lf\n", gap_around); in main()
190 eigvalList[i] = (real)i/(N_occ-1)*(gap_around-gap/2); in main()
193 … eigvalList[N_occ+i] = (real)i/(N-N_occ-1)*(1-(gap_around+gap/2)) + gap_around+gap/2; in main()
201 eigvalList[i] = (real)rand()/RAND_MAX*(gap_around-gap/2); in main()
202 eigvalList[N_occ-1] = gap_around-gap/2; in main()
204 eigvalList[N_occ] = gap_around+gap/2; in main()
206 … eigvalList[N_occ+i] = (real)rand()/RAND_MAX*(1-(gap_around+gap/2)) + gap_around+gap/2; in main()
221 gap_around = (eigvalList[N_occ] + eigvalList[N_occ-1])/2; in main()