1) complex iteration
复迭代
1.
Having extended the concept of filled Julia set of a complex iteration,one asserts that every triangle domain is the filled Julia set of certain complex iteration,then some comments are given.
提出了把复迭代的Ｊｕｌｉａ集及充满Ｊｕｌｉａ集的概念作一定程度的拓广（原先在文献中所认为的Ｊｕｌｉａ集仍是拓广后的Ｊｕｌｉａ集），后指出当指定任何一个三角形区域之后，它必可是某个复迭代的Ｊｕｌｉａ集。
2.
This paper discusses the complex iteration concerned with Julia sets and Mandelbrot sets.
讨论了Ｊｕｌｉａ集与Ｍａｎｄｅｌｂｒｏｔ集的复迭代。
2) complex iteration
复合迭代
1.
Then the various improved measures and complex iteration techniques are given for raising precision and saving memory.
通过采用经典的有限元方法对城市配水网络进行分析,针对求解方程组的形成特点,证明了其系数矩阵的对称正定性,进而给出了求解方程组的LDL~T法,特别是为满足大型、复杂配水网络的计算要求,笔者给出了计算精度可靠,大量节省计算机内存的Ls法,并提出了几种改进措施及复合迭代技术;经采用实例与牛顿法进行比较,证明该法具有明显的优越性,这将更有利于计算机(特别是微机)对大型复杂配水网络的分析与计算。
3) iterative complex
迭代复合
4) iterative repetition
迭代反复
5) iterative repair
迭代修复
1.
Then mathematical model is proposed,and an iterative repair method is introduced to solve the multiple earth observing satellites imaging scheduling problem of multiple EOS.
面向多种类型卫星的联合任务规划问题,考虑上述多种约束,建立数学规划模型,引入迭代修复方法对问题进行求解,并提出了基于成像任务分布的插入选择和撤销选择启发式准则。
6) iteration complexity
迭代复杂性
1.
We also prove that its iteration complexity is O(n~(1/2)log(x0)Ts0/ε).
基于邻近度量函数的最小值,对单调线性互补问题提出了一种新的宽邻域预估-校正算法,在较一般的条件下,证明了算法的迭代复杂性为O(n~(1/2)log(x0)Ts0/ε)。
2.
This algorithm uses the Newton-direction as its iteration direction;its iteration step is determined by potential function;and the polynomial iteration complexity of O(nL) iterations of this new algorithm is proved.
算法取牛顿方向作为迭代方向,利用势函数选择迭代步长,并证明了新算法具有O(nL)的迭代复杂性。
3.
Zhao presented a wide-neighborhood predictor-corrector algorithm for linear programming via the least values of proximity measure functions,and he also proved the algorithm has the polynomial iteration complexity.
由于新算法的迭代方向向量Δx,Δs不再满足正交性,因此算法的收敛性分析不同于线性规划的情形,同时也证明了新算法具有已知的最好迭代复杂性O (n~(1/2)ln〔((x0)Ts0/ε)〕,初步数值实验验证了算法的有效性。
补充资料：复迭
1.亦作"复叠"。 2.重叠。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条