搜索资源列表
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.
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
FLOW1
- C语言牛拉法潮流计算程序.包括导纳矩阵形成,牛拉法迭代.-C language Rafah cattle flow calculation procedures. Including admittance matrix formation, cattle Rafah iteration.
Subspace
- 子空间迭代算法求解结构的特征值,对结构动力分析必须的基本代码,希望对大家有用。-subspace iteration algorithm for the eigenvalue structure, the structural dynamic analysis must be the basic code we hope that the right useful.
hertt
- 矩阵的最大特征值的幂法. 对于工程计算而言,矩阵的特征值和特征向量都是相当重要和常见的数据,这里给出的幂法是一种常见的求解方法,用的是迭代的思想。 符号说明: 1A为待求的矩阵, 2Uk,Vk为迭代用的列向量。 3最后的最大特征值maxLamda由最后一次的max(Uk)-----求Uk中的绝对值最大的元素的绝对值.所决定。 而maxLamda所对应的特征向量由最后一次迭代的Vk所决定. 主要的想法就是先选一个不为0的初始向量U0!=0,然后按下面的式
iterative_SOR
- 这是一个迭代法实现的C代码。本算法采用的是SOR迭代法。-This is an iterative method to achieve the C code. This algorithm is used SOR iteration.
bipso
- 围绕粒子群的当前质心对粒子群重新初始化.这样,每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”(wvi)向Pi,Pg的方向前进,从而可以在粒子群的运动过程中获得新的位置,增加求得更优解的机会.随着迭代的继续,经过变异的粒子群又将趋向于同一点,当粒子群收敛到一定程度时又进行下一次变异,如此反复,直到迭代结束.-particle swarm around the center of mass of the current PSO reinitialization. Thus,
atan_base_on_CORDIC_arithmetic
- 用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关,迭代次数越多,精度越高。本例子中精确到小数点后4位。要提高迭代次数,还得把增加1QN格式的位数,比如32位long,程序多处需要修改,有需要的话自己改吧。 -CORDIC algorithm with the two parameters arc tangent. And the accuracy of the CORDIC iteration number, the more the number of iter
newton_iter
- 牛顿迭代法的C++类,数值计算很实用的封装类,可以作为数值计算应用软件的一部分使用-Newton iteration of the C - numerical very practical Packaging category, Numerical calculations can be used as part of the application software use
Fixed_pt
- matlab语言开发的图像去噪的固定点迭代法, 基于偏微分方程的一个算法。-Matlab language Image Denoising fixed-point iteration method, based on partial differential equations of an algorithm.
invGreville
- 矩阵的广义逆计算,共两种方法,其中迭代法有一阶收敛和二阶收敛-generalized inverse matrix calculation, a total of the two methods, which iteration is a second-order convergence and convergence
Machin
- 复化simponson求积数值分析算法之复化simpson求积算法,详细情形请见源程序,,Visual C++ my赛德尔迭代法.rar - 在VC++实现的赛德尔迭代法,有每次迭代的结果,,Visual C++ -complex plot of simponson for numerical analysis algorithm from a plot of simpson seeking algorithm, details, see the source,, Visual C my
computerdisign-C
- 算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm
Calculatetheprobability
- calculatePXTheta---Calculate the probability of each pixel being its color conditioned on all of the clusters that were found at the previous (coarser) iteration. -calculatePXTheta -- Calculate the proba bility of each pixel being its color conditi
brsola
- brsola 解非线性方程 经典算法 改进版的拟牛顿叠代,收敛很快了-brsola solving nonlinear equations of classical algorithm for improved version of the quasi-Newton iteration, the convergence soon
yakebidiedaifa
- 数值分析算法雅可比迭代法,用C语言实现。-numerical analysis algorithm Jacobi iteration, using C language.
Jacobidiedai
- Jacobi迭代的算法 根据给出的系数矩阵和函数值以及需要精度 能求出方程值,以及迭代次数-Jacobi iteration of the algorithm is based on the coefficient matrix and function values and the need for accuracy can be obtained value equation , and the number of iterations
Jacobiupdate
- 数值分析中的经典求解算法jacobi迭代法的改进算法。-numerical analysis of the classical algorithm jacobi iteration of the algorithm improvements.