查询词典 Jacobi method

The design procedure is based on Jacobi method and similar diagonal matrix.

并且利用Jacobi法求解相似对角形矩阵，避免解高次方程的难题。

Fourth, at basic of the improvement of Jacobi elliptic function expanded method, the extended Jacobi elliptic function expanded methods was proposed.

四、对Jacobi椭圆函数展开法进行改进和扩展，提出新的扩展的Jacobi椭圆展开法来求解非线性发展方程并得到许多新的周期波解。

Firstly, the natural frequencies and normal mode shapes of the fluid-conveying pipe with zero fluid velocity (i.e. U=0) were determined with the transfer matrix method. Next, these natural frequencies and normal mode shapes were used to derive the equation of motion for the fluid-conveying pipe with fluid velocity U.neq.0 by using the expansion theorem. Finally, the free and forced vibration responses of the pipe with flowing fluid were obtained by means of the Jacobi method and the Newmark direct integration method.

首先吾人使用转移矩阵法来求取一流速等於零(即U=0)、跨距数为N之流体输送管的自然频率及其所对应之正规化振态，然后利用振态重叠法原理来推导流速不等於零(即U.neq.0)时，整个流体输送管在外力作用下的运动方程式，最后再以Jacobi法及Newmark直接积分法来计算该水平流体输送管的自然频率及强迫振动反应。

Second, Jacobi elliptic function expanded methods proposed by Liu et al and its evolution and extendedness currently including double Jacobi elliptic function expanded method and F expanded method of solving nonlinear equations were introduced.

二、介绍刘等人提出的Jacobi椭圆函数展开法及当前一些主要的扩展——双Jacobi椭圆函数展开法和F展开法。

An optimal algorithm of the generalized Jacobi method is developed to solve the generalized eigen-problems in the finite element analysis of structural problems.

针对有限单元法结构分析中的对称方阵广义特征值问题，提出广义 Jacobi方法的一种优化算法。

Jacobi method and use a similar matrix of angular, high-equation solution to avoid problems.

并且利用Jacobi 法求解相似对角形矩阵，避免解高次方程的难题。

More than that, the use of conjugate gradient accelerated Jacobi method improves further the computational efficiency of the model.

同时，对离散后得到的五点差分方程，用共轭斜量加速Jacobi法进行求解，使计算效率进一步提高。

The main results of this research are as follows:(1) A parallel algorithm for solving dense matrix linear equations on distributed-memory multi-computer is presented. Convergent velocity of this algorithm is better than parallel Jacobi method"s, and parallelism is better than Gauss-Seidel method"s. According to theoretical analysis, convergent conditions are given. Moreover numerical experiments indicate that results agree with theory.

主要完成了如下研究工作：(1)提出了一种求解系数矩阵为稠密矩阵的线性方程组的适合于MIMD分布式存储的并行迭代算法，该算法设计上兼取了Jacobi算法并行性好的优点和Gauss-Seidel算法收敛速度快的长处，并且在理论上给出了该算法成立的收敛性条件，并通过数值计算验证了此算法结果与理论相符合。

We introduce the iterative method of Jacobi type to solve the discrete problem of the quasivariational inequality system. A new proof for the monotone convergence of the iterative method is given under appropriate conditions.

我们首先介绍求解Hamilton-Jacobi-Bellman方程的近似拟变分不等式组离散问题的一类Jacobi型迭代算法，在一定假设条件下，对这类算法的单调收敛性给出了一个新的证明。

Missirlis in article [1]. At the same time, a sufficient condition for convergence of the PSD method is given to be compared when the coefficient matrix A of the linear system Ax = b is a symmetric, positively defective matrix. In §3.2, an example is given to state that the range of our sufficient condition is wider than theorem 3.3 of article [1]. On the other hand, following a.n analogous approach of [14] and starting the functional relationshipwe have a perfect analysis for the PSD method to converge and optimum valves for the involved parameters under different conditions.Under the assumptions that A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are real,we get necessary and sufficient conditions for the PSD method to convergence.The result is equal to theorem 1 of article [9].Under the same condition, we can see the optimal parameter and of corresponding spectral radius of thePSD method in [8]:(2)When A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are imaginary or zero,we get necessary and sufficient conditions for the PSD method to convergence.In chapter 3, the optimal parameter and of corresponding spectral radius of the PSD method are given by table 3.3. Moreover, under the assumption 0

Missirlis在文献[1]中定理3.3的不准确，同时给出了当线性方程组Ax=b的系数矩阵A为对称正定阵时，PSD迭代法收敛的一个充分条件与之比较，并且在§2.3中用实例说明了对于一部分矩阵而言本文得到的充分条件广于[1]中定理3.3的充分条件；另一方面，按照文献[14]的方法，我们从PSD迭代法的特征值λ与其Jacobi迭代矩阵B的特征值μ的关系式：出发，在不同条件下对PSD迭代法的收敛性和最优参数以及最优谱半径进行了完整的分析：(1)在系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为实数的条件下，给出了PSD迭代法收敛的充分必要条件，此结果与[9]中的定理1等价，此时最优参数及最优谱半径由[8]得：(2)第三章表3.3中给出了，当系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为纯虚数或零时的PSD迭代法的收敛范围和最优参数，并且我们可以得到当0

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。