经过详细分析，证明了在此种三角网格剖分下h 1范数的收敛阶数仍是最优的。
After some detailed analysis, the optimal order convergence in H1-norm is obtained under this type of triangulation.
牛顿迭代法也称为牛顿切线法，是解非线性方程的一种方法，通过实例对该方法进行了介绍，包括其理论依据、误差估计、收敛阶数、迭代法初始值的选取规则等。
This paper introduces the method with examples to explain it, including its connective knowledge, theory bases, error estimation, convergence order, and the choosing rule for starting value of it.
该算法根据均方偏差的收敛条件，在迭代过程中不断减小投影阶数。
According to the condition of convergence on the Mean-Square Deviation, the algorithm decreases its order as iteration goes on.
分析了幂数级函数阶数M与其收敛性的关系。
The relationship between the order M of the exponential series function and astringency was also analyzed.
分析了幂数级函数阶数M与其收敛性的关系。
The relationship between the order M of the exponential series function and astringency was also analyzed.
应用推荐