The stability, starting problem, initial value of sub-iteration and convergence criterion of implicit iteration of the dual-time stepping method are studied.
对双时间步方法隐式迭代的稳定性、启动问题、子迭代初值和收敛性准则进行分析。
An iteration is not a sub-step.
一个迭代并不是一个子步。
In this paper, two sub-swarms substituting particle swarm optimization algorithm (TSSPSO) is proposed. The algorithm parameters are analyzed and the iteration equations are amended.
提出一种两群替代微粒群优化算法(TSSPSO)，并对算法参数进行分析和对算法方程进行修正。
Also aimed at duplicated covering of a point, this paper proposes a heuristic improvement of the result of each iteration, which removed the redundancy sub-collection.
并针对点的重复覆盖问题对每次迭代的结果进行了启发式改进，消除了冗余的子集。
Each iteration, some bad particles of one sub-swarm are replaced with some good particles of another under a substituting probability.
搜索时，每一次迭代均以一定的替代率用一分群中若干优势微粒取代另一分群中相同数目的劣势微粒。
Each iteration, some bad particles of one sub-swarm are replaced with some good particles of another under a substituting probability.
搜索时，每一次迭代均以一定的替代率用一分群中若干优势微粒取代另一分群中相同数目的劣势微粒。
应用推荐