Search - iteration

Search - iteration - List

[Documents] IMGS DL : 0: 该文给出线性方程组改进的Gauss-Seidel迭代（被称之为IMGS方法）对于H矩阵的收敛性定理-In this paper, linear equations Improved Gauss-Seidel iteration (IMGS method is called) for the H matrix convergence theorem
Date : 2025-12-31 Size : 215kb User : 柳
[Documents] code DL : 0: 对偶单纯形法的迭代仍然是以为主元的旋转变换，但是它也有自己的特点。它是首先确定离开基的变量，即首先确定然后确定进入基的变量，即确定xk，一下就是求解单纯形法一例-Dual simplex method iteration is still the main element of the rotation transformation, but it also has its own characteristics. It is the first to leave the base to determine the variables, namely, first to identify and then determine the variables to enter the base, that is, to determine xk, what is the simplex method to solve a case
Date : 2025-12-31 Size : 6kb User : 蒙仕旺
[Documents] NewtonSorMethod DL : 0: 通过牛顿-SOR迭代法求解线性方程不同的迭代因子有不同的迭代效率，从0至2迭代次数先减少后增加，在1.2附近迭代次数最少，而在0和2 附近次数最多。-Through the Newton-SOR iterative method for solving linear equations iterative different factors have different iteration efficiency, from 0-2 to reduce the number of iterations after the first increase in the vicinity of 1.2 iterations at least, and in the vicinity of 0 and 2 Views maximum.
Date : 2025-12-31 Size : 5kb User : xulin
[Documents] IndependentComponentAnalysis DL : 0: FastICA算法，又称固定点(Fixed-Point)算法，该算法采用了定点迭代的优化算法，使得收敛更加快速、稳健。-FastICA algorithm, also known as fixed-point (Fixed-Point) algorithm, which uses fixed-point iteration of the optimization algorithm, making convergence more rapid, and robust.
Date : 2025-12-31 Size : 6.58mb User : huilian.Li
[Documents] fengli DL : 0: 数值计算方法程序及试题，有关于二分查找，牛顿迭代法-The numerical calculus method procedures and the test question, have about two point search, Newton iteration method and so on
Date : 2025-12-31 Size : 5kb User : 冯李
[Documents] Partialdelaunaytriangulationanddegreelimitedlocali DL : 0: Partial delaunay triangulation and degree limited localized bluetooth scatternet formation- This paper addresses the problem of localized scatternet formation for multi-hop Bluetooth based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional, and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized structures. In the next mandatory phase, the degree of each node is limited to 7 by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbo
Date : 2025-12-31 Size : 397kb User : wang
[Documents] BM DL : 0: The Berlekamp-Massey algorithm is an efficient algorithm for determining the linear complexity of a finite binary sequence sn of length n. The algorithm takes n iterations, with the Nth iteration computing the linear complexity of the subsequence sN consisting of the first N terms of sn. Returned value (L) is the length of the shortest linear feedback shift register sequence that generates all bits in sequence sn.
Date : 2025-12-31 Size : 1kb User : Maor Karisi
[Documents] linear-Bregman-super-resolution- DL : 0: 低信噪比下的二维联合线性布雷格曼迭代快速超分辨成像算法文章-Low SNR two-dimensional joint linear Bregman iteration of the fast super-resolution imaging algorithm.
Date : 2025-12-31 Size : 796kb User : 何志彪
[Documents] 高斯赛德尔迭代法matlab编程 DL : 0: 高斯赛德尔迭代法matlab编程，可以供使用者下载。(Gauss saidel iteration method)
Date : 2025-12-31 Size : 7kb User : abc卡布奇诺555
[Documents] 解线性方程组 DL : 0: 求解线性方程组的方法：高斯赛德尔迭代法，LU分解法(Solving linear equations by Gauss Seidel iteration)
Date : 2025-12-31 Size : 2kb User : l玲子l
[Documents] Fortran Newton法求解非线性方程组 DL : 0: 通过Fortran语言，利用牛顿方程迭代来求解非线性方程组，可设置为二元或多元(Through the Fortran language, the Newton equation iteration is used to solve the nonlinear equations, which can be set to two yuan or multivariate.)
Date : 2025-12-31 Size : 1kb User : wagzijian