搜索资源列表
NewTon
- Newton迭代法,用Newton迭代法求方程,(内附题目) #include<stdio.h> #include<math.h> #define N 100 #define PS 1e-4 #define TA 1e-4 float Newton(float (*f)(float),float(*f1)(float),float x0 ) { float x1,d=0 int k=0 do { x1= x0-
NewtonFG
- 利用牛顿迭代法编写,可以用来求的方程的复根,当然如果有复根的话-Written by Newton iteration method can be used to find the complex roots of the equation, of course, if there are complex roots, then
pso
- 粒子群算法,也称粒子群优化算法(Particle Swarm Optimization),缩写为 PSO, 是近年来发展起来的一种新的进化算法((Evolu2tionary Algorithm - EA)。PSO 算法属于进化算法的一种,和遗传算法相似,它也是从随机解出发,通过迭代寻找最优解,它也是通过适应度来评价解的品质,但它比遗传算法规则更为简单,它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作,它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现
zhengshufenlei
- 按照下面方法对整数x进行分类:如果x是一个个位数,则x属于x类;否则将x的各位上的数码累加,得到一个新的x,依次迭代,可以得到x的所属类。比如说24,2+4=6,则24的类别数是6;39,3+9=12,1+2=3,则39的类别数是3。输入 每行输入一个非负整数n,n的位数<500,n为0时结束。输出 每行输出对应整数的分类数。-In accordance with the following methods for integer x classification: if x is a n
a
- 矩阵与数值分析:高斯法,高斯列主元法,G_S迭代,牛顿法,jacobi迭代法,G-S迭代法 ,牛顿法求根,三次样条插值,多项式拟合,复化Simpson方法,复化梯形方法,n=3的Gauss_Lengendre公式,4阶Runge-Kutta法求解微分方程-Matrix and numerical analysis: Gauss method out PCA Gaussian law, G_S iteration, Newton' s method, jacobi iterative m
kalman
- 该函数实现了卡尔曼滤波中关键的循环迭代过程。-This function is the key to achieve a Kalman filter loop iteration.
K_Means_image_compression
- - K means algorithm is performed with different initial centroids in order to get the best clustering. - The total cost is calculated by summing the distance of each point to its cluster centre and then summing over all the clusters.Based on the mi
code---c
- Economic Load Dispatch using lamda iteration c - code
CBWH_IET_Computer-Vision
- 背景加权直方图算法(BWH)在[2]中提出了尝试 减少干扰的背景均值漂移跟踪的目标定位。然而, 在本文中,我们证明了权重分配给候选目标区域的像素 BWH是那些没有背景资料成正比,即不会引入BWH 任何新的信息,因为均值漂移迭代公式是不变的规模 改造砝码。然后,我们提出了一个校正BWH(CBWH)的公式 只转型的目标模式,但不是目标候选模型。 CBWH计划 可以有效地降低背景的干扰,在目标定位。实验 结果表明,CBWH可能会导致更快的收敛速度和更准确的定位比 通
pso
- pso基础算法代码,能够进行基本pso算法处理,并且能够计算每次迭代例子中心的位移步长 -pso algorithm code base that can perform basic pso algorithm processing, and be able to calculate the displacement of the center of each iteration step examples
b0b1b2b3
- 实现求线性回归方程的参数使用的是牛顿迭代法-Seeking to achieve the parameters of the linear regression equation using a Newton iteration
hanshu
- MATLAB中用C语言编写的S函数,牛顿迭代法-Using C language MATLAB S-function, Newton iteration
main
- 将红外图像进行迭代分割,经边缘检测后,检测所包含的直线,并在原图像中显示出来-Iteration to infrared image segmentation, edge detection, linear detection contains, and displayed in the original image
solver_Eq
- 本程序包采用matlab编写的几种数值计算中经典的解方程组的算法,包括LU分解、Gauss消元法、Jacobi迭代法、以及Guass-Seidel迭代法的源代码。供大家参考。-This package prepared using matlab several numerical solution of equations of classical algorithms, including LU decomposition, Gauss elimination method, Jacobi i
five-matlab-procedure
- 这5个小程序分别为:用Monte Carlo随机法圆柱相交体的体积;用刘徽割圆法计算pi;梯形法.辛普森法计算圆周率;蒲丰掷针实验程序;线性函数的迭代-This five small programs were: using Monte Carlo random method cylinder intersects the volume cyclotomic method with Liu Hui pi trapezoidal method Simpson method to calcula
diedai
- 这5个小程序分别为:用Monte Carlo随机法圆柱相交体的体积;用刘徽割圆法计算pi;梯形法.辛普森法计算圆周率;蒲丰掷针实验程序;线性函数的迭代-This five small programs were: using Monte Carlo random method cylinder intersects the volume cyclotomic method with Liu Hui pi trapezoidal method Simpson method to calcula
simplex-matlab(1)
- 实现数值分析中单纯形法改进方法的matlab代码,即改进单纯形法算法,能够实现大型稀疏矩阵的迭代,这是3/3-Numerical analysis to achieve improved method simplex method matlab code that modified simplex method algorithm, to achieve large sparse matrix iteration, which is 3/3
simplex-matlab(2)
- 实现数值分析中单纯形法改进方法的matlab代码,即改进单纯形法算法,能够实现大型稀疏矩阵的迭代,代码分为三分。这是2/3-Numerical analysis to achieve improved method simplex method matlab code that modified simplex method algorithm, to achieve large sparse matrix iteration, the code is divided into thirds.
simplex-matlab(3)
- 实现数值分析中单纯形法改进方法的matlab代码,即改进单纯形法算法,能够实现大型稀疏矩阵的迭代,这是3/3-Numerical analysis to achieve improved method simplex method matlab code that modified simplex method algorithm, to achieve large sparse matrix iteration, which is 3/3 ..
1
- 关于香蕉函数的牛顿迭代法 梯度法的计算 其中有梯度和hesse矩阵计算-About Banana Newton iteration function gradient calculation method which has gradients and hesse matrix calculation