• 数值计算表明这种方法可以降低方程迭代次数约40%,明显减少方程求解时间。

    Numerical results present that this method can decrease the number of iterative by 40% and reduce the computation time greatly.

    youdao

  • 数值计算表明这种方法可以降低方程的迭代次数约35%,明显减少方程求解时间

    Numerical results present that this method can decrease the iterative number by 35% and reduce the computation time greatly.

    youdao

  • 两个典型算例理论分析实际计算表明这种预条件方法可以降低方程迭代次数约30%,明显减少方程求解时间

    The theoretical analysis and numerical results of two typical examples show that this method can decrease the numbers of iterative by30%and reduce the computation time greatly.

    youdao

  • 点法一种求解线性规划问题多项式时间算法显著特征是其迭代次数系统规模关系不大。

    The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.

    youdao

  • 利用对偶规划求解一个单纯形法循环例子,由此减少了单纯形法迭代次数,达到简化计算、加快计算速度、节省存储空间的效果

    This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well.

    youdao

  • 求解迭代过程中,残差变化作为加速因子修正函数减少迭代次数,加快了算法计算速度。

    During the solution iterations, the residual change is used as accelerating factor to revise weight function. As a result, the number of iteration and the calculation time are decreased.

    youdao

  • 算法利用多项式除法相关推论通过矩阵变换求解关键方程,这样可以快速地得到余式,从而可以减少迭代运算的次数

    The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix.

    youdao

  • 程序执行结果包括求解结果迭代次数迭代误差数据、误差曲线图

    Procedures for implementation of the findings include: solving a result, the number of iterations, iterative error data, error curve and so on.

    youdao

  • 根据可逆冷轧生产特点,采用了种简单迭代方法求解负荷比例分配构成的非线性方程组,得到总轧制道次数以及各个道次的中间厚度。

    Based on the rolling feature and practice of reversible cold mill, a new calculating method to determine the load distribution is put forward by means of nonlinear equations.

    youdao

  • 实际系统计算结果表明算法迭代收敛次数稳定,系统规模关系不大,在求解大规模系统无功优化问题时,其性能优于具有指数时间复杂性的单纯性法。

    The computation results of practical power systems show that the number of iterations of this algorithm is independent of system's size, and it is superior to simplex...

    youdao

  • 实际系统计算结果表明算法迭代收敛次数稳定,系统规模关系不大,在求解大规模系统无功优化问题时,其性能优于具有指数时间复杂性的单纯性法。

    The computation results of practical power systems show that the number of iterations of this algorithm is independent of system's size, and it is superior to simplex...

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定