搜索资源列表
jl-444
- 在vc环境下对koch雪花算法,mandlbrot分行算法的实现,可以交互选择迭代次数.-in vc environment right koch snowflakes algorithm, the algorithm mandlbrot branch realization can choose interactive iteration number.
函数迭代系统
- 这是一个函数迭代系统,可以很直观地了解函数迭代。-This is a method, system, it is quite intuitive understanding of function iteration.
srcV0624
- 这个代码是policy iteration算法关于强化学习的. 请您用winzip 解压缩-policy iteration algorithm for enhanced learning. Please use winzip decompress
my雅可比迭代法
- 在VC++中实现成功的雅可比迭代法,有每次迭代的结果。-in VC achieve success Jacobi iterative method, the results of each iteration.
my赛德尔迭代法
- 在VC++实现的赛德尔迭代法,有每次迭代的结果-VC in the Seidel iterative method, the results of each iteration
共轭梯度法
- 上述算法的④输出结果要求包含最优解、最优值、迭代次数,以及每次迭代的中间结果(对 而言)终止准则为H终止准则-above algorithm output requirements include optimal solution, the optimal values, the number of iteration, and each iteration of the intermediate results (in terms of) the termination criteria f
惩罚函数法
- ④输出结果要求包含最优解、最优值、迭代次数,以及每次迭代的中间结果(对 而言)- output requirements include optimal solution, the optimal values, the number of iteration, and each iteration of the intermediate results (to run)
JGSSOR
- 该程序用于数值分析中计算J迭代,GS迭代,SOR迭代。-procedures for the numerical analysis of iterative calculations J, GS iteration, the SOR iteration.
单片机子程序库
- 目前已有若干版本的子程序库公开发表,它们各有特色。本程序库中的开平方算法为快速逼近算法,它能达到牛顿迭代法同样的精度,而速度加快二十倍左右,超过双字节定点除法的速度.-there are several versions of the subroutine library published their own characteristics. The library opened in the square approximation algorithm for rapid algorithm
G_S_ITER
- Gauss-Seidel 迭代 本程序能处理的方程最大阶数-Gauss - Seidel iteration of this program can handle the largest order equation
Iteration_Singular
- computing singular value of matrix by iteration-computing singular value of matrix by iter ation
dossier
- For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics
mydes
- 以上介绍了DES算法的加密过程。DES算法的解密过程是一样的,区别仅仅在于第一次迭代时用子密钥K15,第二次K14、......,最后一次用K0,算法本身并没有任何变化。 -introduced over the DES encryption algorithm process. DES algorithm decryption process is the same, the only difference is that the first iteration used Subkey K
Cprograms
- 中南大学C语言程序设计实习 1 实验一:C语言图形模式的设置 2 实习二:一元函数的图形绘制 3 实习三:二维图形的几何变换 4 实习四:非线性方程求根的二分法 5 实习五:非线性方程求根的牛顿法 6 实习六:数值积分的矩形法和梯形法 7 实习八:级数求和问题 8 实习九:曲线拟合 9 实习十一:解线性方程组的Gauss消元法 10 实习十四:解线性方程组的Jacobi迭代法 11 实习十六:空间曲面和曲线的绘
immunity
- 提供一个人工免疫算法源程序,其算法过程包括: 1.设置各参数 2.随机产生初始群体——pop=initpop(popsize,chromlength) 3.故障类型编码,每一行为一种!code(1,:),正常;code(2,:),50%;code(3,:),150%。实际故障测得数据编码,这里Unnoralcode,188% 4.开始迭代(M次): 1)计算目标函数值:欧氏距离[objvalue]=calobjvalue(pop,i) 2)计算群体中
SORxx
- 雅可比、塞德尔和SOR迭 代法的原理。代法的原雅可比、塞德尔和SOR迭代法的原理。理。-Jacobian, Seidel and SOR Diez Jacobian, Seidel SOR iteration method and the principle. On behalf of the original law Jacobian, Seidel SOR iteration method and the principle. Jimmy.
PSO-C
- 在C语言环境下使用的粒子群优化算法,需要给出最大速度、迭代次数、作为中断条件的最小误差等初始条件。-in the C-language environment to the use of the PSO algorithm, the greatest need is speed, the number of iteration, as the smallest disruption error conditions such as initial conditions.
cutphoto
- 第一幅图被称作曼德勃罗特集,曼德勃罗特集的数学模型非常简单。假设有复数Z和μ,用下式迭代计算:Z=Z2+μ,由于μ的取值不同,经过若干次数迭代以后Z的幅值可能趋向无穷,也可能保持有界,曼德勃罗特集就是那些使Z保持有界的μ的集合,把μ在复平面上的分布作成图像,就像上面演示的那样具有极其复杂的结构。 假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo Lott episode is very simple ma
Ygpc
- 像片外方位元素计算程序,根据已知坐标数据和最小二乘原理进行间接平差,得到外方位元素的改正数,迭代求解-porno elements outside position calculation procedures, according to the known coordinates data and the principle of least squares indirect adjustment, outside the position to be the correct number o
20041121125751
- SHA算法,一个安全散列算法,通过把数据变成相应的消息摘要,根据迭代值,进行四次循环运算而产生的消息摘要.-SHA algorithm, a secure hash algorithm, the data into corresponding news summary, according to the value iteration, for the fourth cycle of operation and the news summary.