搜索资源列表
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 representa
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
Cprograms
- 中南大学C语言程序设计实习 1 实验一：C语言图形模式的设置 2 实习二：一元函数的图形绘制 3 实习三：二维图形的几何变换 4 实习四：非线性方程求根的二分法 5 实习五：非线性方程求根的牛顿法 6 实习六：数值积分的矩形法和梯形法 7 实习八：级数求和问题 8 实习九：曲线拟合 9 实习十一：解线性方程组的Gauss消元法 10 实习十四：解线性方程组的J
immunity
- 提供一个人工免疫算法源程序，其算法过程包括： 1.设置各参数 2.随机产生初始群体——pop=initpop(popsize,chromlength) 3.故障类型编码，每一行为一种！code(1,:)，正常；code(2,:)，50％；code(3,:)，150％。实际故障测得数据编码，这里Unnoralcode,188％ 4.开始迭代（M次）： 1）计算目标函数值：欧氏距离[objvalue]
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. Ji
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 in
cutphoto
- 第一幅图被称作曼德勃罗特集，曼德勃罗特集的数学模型非常简单。假设有复数Z和μ，用下式迭代计算：Z=Z2＋μ，由于μ的取值不同，经过若干次数迭代以后Z的幅值可能趋向无穷，也可能保持有界，曼德勃罗特集就是那些使Z保持有界的μ的集合，把μ在复平面上的分布作成图像，就像上面演示的那样具有极其复杂的结构。 假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo
Ygpc
- 像片外方位元素计算程序，根据已知坐标数据和最小二乘原理进行间接平差，得到外方位元素的改正数，迭代求解-porno elements outside position calculation procedures, according to the known coordinates data and the principle of least squares indirect adjustment, outside the posit
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 sum
team16i1_1
- 采用XP极限开发方法进行软件开发时，进行语音通信软件开发写的软件工程的迭代计划（第一次迭代）-Limit use XP development method for software development, voice communications software written in the iterative software engineering (first iteration)
gaosidiedaifa
- 计算方法中的高斯迭代法 C++算法源程序-calculation method of Gaussian iteration algorithm C source
Part_2_C_programmes
- 程序总结2 改进欧拉法|高斯消去法|简单迭代法|列主元元素消元|龙贝格算法|龙格库塔方法|牛顿插值多项式-procedures to improve Euler France | Gaussian Elimination | simple iteration | out the main elements Consumers billion yuan | Romberg Algorithm | Runge Kutta method |
Part_3_C_programmes
- 程序总结3:牛顿迭代|牛顿下山|秦九韶|三对角线追赶法|系统|弦割法|雅克比迭代|综合测评-procedures : Newton iteration | Newton down | Qinjiushao | 3 diagonal chasing France | System | Strings cutting France | Jacques than iterative | Comprehensive Assessment
zd_48
- 一个复杂的迭代运算-iteration of a complex operation.
FLOW1
- C语言牛拉法潮流计算程序．包括导纳矩阵形成，牛拉法迭代．-C language Rafah cattle flow calculation procedures. Including admittance matrix formation, cattle Rafah iteration.
yagao
- 雅可比迭代法 高斯迭代法 中国矿业大学计算机学院 计算方法实验三-Jacobi iteration Gaussian iteration of China University of Mining Institute computer calculation experiment 3
niudun
- 图是用牛顿法求方程z3-1=0的根所得到的“项链”。以上程序采用浮点运算，速度是比较慢的。如果每迭代一次就计算一次距离，则速度会更慢。为了使不同吸引区域有不同的颜色，并且能够表现收敛速度，必须做更多的距离计算，但得到的图形也更美丽。特别是将分界处的“项链”放大来看，会得到精致的结构。-Fig Newton method is used Equation z3-1 = 0 has been the root of the "ne
mm
- 雅可比迭代求解方程 用雅可比迭代计算一个线性方程组。用户只需要输入系数矩阵和常数矩阵就可以-Jacobi iteration equation Jacobian an iterative calculation of linear equations. Users only need to input matrix and constant coefficient matrix can