查询词典 iterative method

In VC achieve success Jacobi iterative method, the results of each iteration.

在VC++中实现成功的雅可比迭代法，有每次迭代的结果。

The Gauss-Seidel iteration and modified successive over-relaxation iterative method are used to solve linear equation group.

同时，对主动式多用户动态检测方法的软件无线电实现进行了初步考虑。

By this iterative method, the solvability of the matrix equation can be determined automatically.

此迭代法可以自动地判定矩阵方程AX+XB+C=0的可解性。

In this paper,an iterative method is constructed to find the centrosymmetric solution of matrix equation where is real matrix pair .

本文构造了一种迭代法求矩阵方程的中心对称解对。

In this paper an iterative method is presented to find the bisymmetric least-squares solutions of the matrix equation AXB = C.

本文给出了求矩阵方程AXB=C的双对称最小二乘解的一种迭代解法。

Dichotomy, a simple iterative method Yi Newton iteration of these three methods for nonlinear equations ro...

二分法，简单迭代法矣牛顿迭代法这三种方法来求非线性的方程的根，比较这三种的收敛性。

On the one hand,by using the monotone iterative method with upper and lower solutions or anti-order upper and lower solutions,the author obtains the existence of maximum solution and minimum solution.

存Banach空间，一方面运用一般上下解及反序上下解单调迭代方法，并结合非紧性测度的性质，研究了二阶常微分方程周期边值问题最大解与最小解的存在性。

The compared experiment between iterative method and MUSCAT was conducted.

进行了迭代算法和MUSCAT算法的比较试验，两者反演结果比较类似。

With the help of Newton formula and Vieta theorem, iterative method was used to solve problems of power sum.

借助牛顿公式和韦达定理，采用迭代的方法求解类似于自然数等幂和的问题。

Exive least-squares solutions, antire?exive least-squares solutions, bisymmetric least-squaressolutions, symmetric and antipersymmetric least-squares solutions, symmetric or-thogonal symmetric least-squares solutions, symmetric orthogonal antisymmetricleast-squares solutions and their optimal approximation to the linear matrix equa-tion AX = B, and solve them successfully. 2. For Problem II, we can convert it to another problem of finding the least-squares solutions with the least norm of a new consistent matrix equation. Onthe base of the solutions of Problem I we can apply the iterative method to get

本文所构造的迭代法的优点在于先利用法方程变换将求矩阵方程的最小二乘解转化为求一个相容矩阵方程的解的问题，再利用迭代法对于任意给定的初始矩阵进行迭代，均可在有限步内迭代出所求问题的一个解；可将问题II转化为求新方程的极小范数解的问题，同样用迭代法求解，从而系统且全面地解决了问题I、II在约束矩阵类如中心对称、中心反对称、自反矩阵、反自反矩阵、双对称、对称次反对称、对称正交对称、对称正交反对称矩阵中的最小二乘解及其最佳逼近问题。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。