查询词典 fast algorithm

A fast algorithm for calculating the inverse and Moore-Penrose inverse of the permutation factor circulant matrix is presented. Then, a fast algorithm for the product of the permutation factor circulant matrix is given. Finally, The least-square solutions of inverse problems and the optimal approximation problems for the permutation factor circulant matrix are discussed.

首先给出了一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法，然后给出了计算两n阶置换因子循环矩阵之乘积阵的一种快速算法，最后给出了其反问题的最小二乘解的存在性定理及它的一般表示，并证明了逼近矩阵的存在唯一性且给出它的具体表达式。

When scaled factor circulant matrices are nonsingular, we can find the single solution of the scaled factor circulant matrix equation; When scaled factor circulant matrices are singular, we can find the special as well as the general solution of the scaled factor circulant matrix equation; There is only an error of approximation when the fast algorithm is implemented on computers, and only the elements in the first row of the scaled factor circulant matrix and the constants in the diagonal matrix are needed by the fast algorithm.

当鳞状因子循环矩阵非奇异时，该快速算法求出线性方程组的唯一解；当鳞状因子循环矩阵奇异时，该快速算法求出线性方程组的特解与通解。该快速算法仅用到鳞状因子循环矩阵的第一行元素及对角矩阵中的对角上的常数进行计算。在计算机上实现时只有舍入误差。

Fast algorithm of minimal norm least square solution for Cauchy linear system;2. For the m×n Cauchy-type matrix with full column rank,the fast algorithm of the minimal norm least square solution to the linear system Cx=b was obtained by construction of a special block matrix and study of the triangular decomposition.

对于秩为n的m×n阶Cauchy型矩阵C，通过构造特殊分块矩阵并研究其三角分解，进而得到了线性方程组C x=b的极小范数最小二乘解的快速算法，所需运算量为O+O(n2)，而通常构造法方程组的方法所需运算量为O(m n2)+O(n3)，用正交化法虽然避免了构造法方程组，但所需的运算量更大些。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

This paper studies QinJiuShao algorithm for fast computation of high-rank polynomial,analyses fast algorithm of modular exponentiation in RSA,and gives its implementation.

介绍了用于快速计算高次多项式值的"秦九韶算法"，并用类似思路分析了RSA算法中方幂模快速实现算法，最后给出了该算法的具体实现。

The buffered-crossbar switch architecture is studied. In this paper, the maximum weight fast algorithm is used in BX, we discover the null row phenomenon in BX's maximum weight fast algorithms, and propose a doubling weight solution for null row, this promotes the performance of maximum weight fast algorithms in BX.

对缓冲Crossbar交换结构进行了研究，论文中将最大权重优先算法应用于BX结构，并对其在BX结构由于存在空列现象所导致的性能恶化提出了空列权重加倍的解决方案，提高了最大权重优先算法在不均衡负载下的性能。

To improve the performances of Saitou and Nei's algorithm and Studier and Kepler's improved algorithm for constructing the Neighbor-Joining phylogenetic trees, reducing the time complexity of the computation, a fast algorithm has been developed.

以混沌游戏为例子，利用二分技术对这类递推问题进行了并行算法设计，分析了这类算法的时间和空间复杂性以及适用范围。

Inspired by binary tree, based on T-Man protocol and fast algorithm for building Kademlia, this paper proposed a fast algorithm for building CAN over unstructured P2P network.

受二叉树思想的启发，在P2P网络拓扑管理协议T-Man和Kademlia网络快速构建算法的基础上，提出了从非结构化P2P网络快速构建CAN网络的算法。

By using the noncircular characteristics, the fast algorithm provides a better performance than the traditional fast algorithm such as propagator method.

快速算法由于利用了信号的非圆特性比常见的快速算法，如传播因子算法等具有更高的测向精度。

The motion scope judgement search method based prognosticating the search beginning point, it utilizes the time relativity and the space relativity of block to prognosticate the search beginning point, and adopts the different search pattern according to the block motion scope, the search efficiency is close to the Three Step Search, which proves the feasibility of researching the new efficient motion estimation algorithm according to the characteristic of block motion to use the different search methods; In the end, this paper evaluates the advantage and disadvantage of the different fast algorithms through the data get from the experiment, it will have some reference value to bringing the new and effective motion estimation fast algorithm in the later research.

基于预测起点的运动幅度判断搜索法，该算法利用块的时间相关性和空间相关性来预测搜索起点，根据块的运动幅度大小分别采用不同步长的搜索策略，搜索效率比较接近三步法，证明了根据块运动的特性以结合运用不同的搜索算法来研究有效的运动估计算法的可行性。最后本文通过实验得来的数据来定量地分析评价各快速算法的优缺点，对今后提出新的更有效的运动估计快速算法具有一定的参考价值。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。