上标n 表示模拟时刻,上标m为叠代次数(iteration number), 下标i与j 分别为x 与z 方向之格网点座标。初始条件及边界条件亦可利用上述有限 差方法将其离散化。
基于12个网页-相关网页
adaptive iteration number 自适应迭代次数
the iteration number 循环迭代次数
Optimal Iteration Number 最优迭代次数
average iteration number 平均迭代次数
Number of Iteration 迭代次数
number of iteration cycle 循环迭代次数
Let's assume that we're in Construction iteration number 5 of the Behemoth DW.
让我们假设我们处于Behemoth DW的第5个构建迭代。
The experimental results show that both the iteration number and the scheme analysis number required by SA are much greater than GA, while the optimal result of SA is better than that of GA.
实验结果表明SA达到收敛所需迭代次数及方案分析次数远较GA为多,但其优化结果要好于GA。
Xtrace:maximal=all,output={trace#.out,5m,5} traces sequentially into five files, each 5MB in size, with the # substituted for the file iteration number. In this instance, files named trace0.trc
maximal=all,output={trace#.out,5m,5} 将跟踪数据依次写到 5 个文件中,每个文件 5MB,# 用文件的序号代替。
N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.
但在选择排序中,肯定不会是1,也不是,注意,上周我们在这儿,实现的算法中,反复地,迭代进行选择,选出最小的数,然后将其放在合适的位置。
应用推荐