Search - iteration

Search - iteration - List

[Data structs] AniMatrix DL : 0: 用c写的对矩阵求逆的算法，采用直接迭代，适合2阶和3阶矩阵-used to write the right matrix inversion algorithm, the introduction of direct iteration, for two bands and three bands Matrix
Date : 2026-01-01 Size : 862kb User : 申魏
[Data structs] gaos DL : 0: 高斯迭代法求解线性方程组的源代码！ -Gauss iteration method for solving linear equations of the source code!
Date : 2026-01-01 Size : 1kb User : 佘志强
[Data structs] simpler DL : 0: Simpler程序，迭代，速度压力，半隐式，比simple收敛快-Simpler procedures, iteration, velocity pressure, semi-implicit, converges faster than the simple
Date : 2026-01-01 Size : 745kb User : 李志峰
[Data structs] DIJKSTRA DL : 0: Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain order, until you have a route highlighted from the starting point to the destination. The order is conceptually simple: at each iteration, create a set of intersections consisting of every unmarked intersection that is directly connected to a marked intersection, this will be your set of considered intersections. From that set of considered intersections, find the closest intersection to the destination (this is the "greedy" part, as described above) and highlight it and mark that street to that intersection, draw an arrow with the direction, then repeat. In each stage mark just one new intersection. When you get to the destination, follow the arrows backwards. There will be only one path back against the arrows, the shortest one.
Date : 2026-01-01 Size : 1kb User : synthia
[Data structs] 1 DL : 0: 迭代算法的具体实现,使用vc代码,计算方法课程试验-Iteration in the proposed algorithm, using vc code, the calculation program test
Date : 2026-01-01 Size : 383kb User : 刘
[Data structs] diedaifa DL : 0: // 编程序用迭代法求a的立方根,求立方根的迭代公式为 ::Xi+1=（2*Xi）/3+a/(3*Xi*Xi) 假定X的初值为a,迭代到|Xi+1-Xi|<10的-5次方为止. 显示a=3,27的值,并通过调用pow(a,1.0/3)函数加以验证.。-//Compile a program with Iteration Method and the cube root, find the cube root of the iteration formula is:: Xi+1 = (2* Xi)/3+ a/(3* Xi* Xi) assumes that the initial value of X is a iteration to | Xi+1- Xi | < 10 the-5 power up. shows the value of a = 3,27, and by calling pow (a, 1.0/3) function to be verified..
Date : 2026-01-01 Size : 1kb User : 赵汉卿
[Data structs] sort DL : 0: VLSI中有关搜索最短路径，来求iteration bound的算法，-VLSI in relation to search the shortest path algorithm to find iteration bound,
Date : 2026-01-01 Size : 113kb User : kaiyongx
[Data structs] SIRT DL : 1: 此程序为井间层析成像sirt算法，该算法能保证反演过程的稳定性，并提高迭代的收敛速度-This program sirt hole tomography algorithm can guarantee the stability of inversion and improve the convergence rate of iteration
Date : 2026-01-01 Size : 1kb User : yehua
[Data structs] 4.5 DL : 0: 使用modified Roboson 完全遍历一棵树并且输出每次遍历当前结点往后的路径，以及这些路径的孩子，其实这个程序功能远不如此-Complete Coverage using modified Roboson output of each iteration, a tree and the subsequent path of the current node, and the children of these paths, in fact, so far the program features
Date : 2026-01-01 Size : 3kb User : Yang
[Data structs] SOR DL : 0: 松弛因子的介绍（“松弛迭代法是高斯-塞德尔迭代法的一种加速方法，基本思想是将高斯-塞德尔迭代法得到的第k+1次近似解向量与第k次近似解向量作加权平均，当权因子（即松弛因子）w选择是适当时，加速效果很明显。因此这个方法最关键的是如何选取最佳松弛因子。"）和算法。-Relaxation factor of the introduction (" relaxation method is the Gauss- Seidel iteration method for an accelerated method, the basic idea is to Gauss- Seidel iteration the first k+1 obtained for solution vector with the first k for solution vector as the weighted average, power factor (ie the relaxation factor) w option is appropriate to accelerate the effect is obvious. Therefore, this method is how to select the most critical optimal relaxation factor. " ) and algorithms.
Date : 2026-01-01 Size : 4kb User : 陈倩倩
[Data structs] data-structure DL : 0: 数据结构的经典问题迭代穷举搜索递推背包问题有完整的程序-Classic problem of data structure iteration branch search
Date : 2026-01-01 Size : 41kb User : skyman
[Data structs] fengdong DL : 0: 矿井通风网络节点风压解算法。课程设计要求：要求从TXT文本中读入各个分支的始末节点和风阻值，并在控制台输入各分支的风量初值，通过迭代，得到各分支风量和各节点风压。-Pressure solution of mine ventilation network node algorithm. Course design: requirements TXT text read from the various branches of the circumstances leading to the node and wind resistance, and in the console input initial value of each branch of the air flow, through iteration, by all branches of air volume and pressure of each node.
Date : 2026-01-01 Size : 2kb User : 达人
[Data structs] solutions DL : 0: 各种常见的解方程组方法：Cholesky分解法解方程组、LU分解线性方程组、高斯消去法解方程组、列主元解线性方程组、雅可比迭代解线性方程组-Common solution of equations: the Cholesky decomposition of equations, LU decomposition of linear equations, Gaussian elimination method for solving equations, column element for solving linear equations, the Jacobi iteration for solving linear equations
Date : 2026-01-01 Size : 1.2mb User : wenwen
[Data structs] Newton-iterative DL : 0: 计算方法中一种牛顿迭代法的算法，C程序代码-Calculation method one kind Newton iteration algorithm, C code
Date : 2026-01-01 Size : 1kb User : laviequev
[Data structs] generate_ecg_data DL : 0: This program is written to generate ECG data for time length of 90 seconds. The program can be reconfigured (iteration size) to generate the data according to your need. Kindly do time calculation before reconfiguration of iteration size. Some data files generated using this program are also attached.
Date : 2026-01-01 Size : 1.17mb User : Ajitpal Brar
[Data structs] for-send DL : 0: this program for sidel method.sidel method is a method of numerical that solve problem by iteration and we use it in sbu unversity.
Date : 2026-01-01 Size : 1kb User : amir hossein
[Data structs] 4.2 DL : 0: 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法，路径必须经过要求的必经点，且不成环。该算法采用了一种自适应调整的方法，经过多次迭代，使解收敛。但只是寻找了一个略优的可行解（每次迭代都基于贪婪算法寻找），不能保证最优解。而且如果图过于稀疏，因为收敛速度过快，可能导致问题无解（收敛于一个局部最优解，没有经过所有点）。解决相对稠密的图（每个点的平均出入度4以上），表现良好。备注：里面有一个QT的工程，可以直接打开（源码里没用QT的库）-Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to point to the map, the path must pass through points, and not a ring. This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.
Date : 2026-01-01 Size : 16kb User : 凌凯
[Data structs] diedaijiefangchengzu DL : 0: 矩阵三角分解法解方程雅可比迭代法、高斯赛德尔迭代法、SOR迭代法解线性方程组。(Matrix triangulation method for solving equations Jacobi iterative method, Gauss Seidel iteration method and SOR iterative method are used to solve linear equations.)
Date : 2026-01-01 Size : 2kb User : 536536536