查询词典 iterative method

The quasi-Newton iterative method in optimization is used to solve the numerical solution of this variational problem.

该模型最终由最优化领域中的拟牛顿迭代法实现数值求解。

Then as for an arbitrary initializing bisymmetric matrix, we just need to get the bisymmetric solutions of the new equation in finite steps by applying the iterative method.

并将求最佳逼近的问题转化为求一个新方程的极小范数解的问题，同样可用迭代法求解。

In this paper, an iterative method is established to solve the linear matrix equation $AXB=C$ over generalized bisymmetric $X$.

本文给出了求解矩阵方程AXB=C广义双对称解的迭代解法。

Iterative method; Generalized bisymmetric solution; Least-norm solution; Optimal approximation

迭代解法；广义双对称解；极小范数解；最佳逼近。

Model updating; modal parameter; centrosymmetric; iterative method; least squares problem; quadratic constraint

模型修正；模态参数；中心对称矩阵；迭代法；最小二乘问题；二次约束

By this iterative method ,the solvability of the matrix equation can be judged automatically.When the matrix equation is consistent ,then,for any initial centrosymmetric matrix pair ,a centrosymmetric solution pair can be obtained within finite iteration steps in the absence of roundoff errors, and the least norm centrosymmetric solution pair can be obtained by choosing a special kind of initial centrosymmetric matrix pair.

当矩阵方程相容时，对任意初始的中心对称矩阵对在没有舍入误差的情况下，经过有限步迭代，得到它的一个中心对称解，并且，通过选择一种特殊的中心对称矩阵对，得到它的最小范数中心对称解。

And two kinds of efficient iterative method, GMRES and Bi-CGSTAB, with different preconditioners are applied to solve the resulted nonsymmetrical systems of Fourier coefficients.

接著利用两种有效的迭代法(GMRES，BI-CGSTAB)来解离散后，傅利叶系数所形成非对称的线性系统并配合不同的preconditioner。

In this paper, a kernel quantification theory IV is proposed through organical combining kernel function theory and quantification theory IV. The algorithm framework for the new model with large scale-sampling data is established on the basis of Lanczos algorithm which is an iterative method for finding the eigenpairs of a square matrix.

把核函数理论与数量化理论IV模型有机结合，提出了核数量化理论IV模型，并以高阶对称矩阵端部特征对求解的Lanczos算法为基础设计了大样本核数量化理论IV模型的算法框架。

Firstly, in order to measure the algorithmic scalability and the parallelization scalability of a iterative method, a suit of scalability analysis approach is presented.

该方法从算法可扩展和并行可扩展的两个角度，衡量它们对并行计算时间的贡献。

When the systems are singular, one requires only the semiconvergence of the iterative method.

然而当线性方程组奇异时，我们只能要求迭代法半收敛。

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.

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