搜索资源列表
niudundiedaifa
- visual basic初学的经典算法牛顿迭代法的源码-visual basic beginner' s classical algorithm for Newton' s iteration of the source
hill
- A hill climbing algorithm for finding the minimum of a function fitnessfun in the real space. x is the scalar/vector of the functon minimum fval is the function minimum gfx contains the minimization solution each iteration (columns 2
2
- 方程求根的数值试验，利用Newton迭代法，求所给出的方程的跟。-Equation Roots of numerical experiments, using Newton iteration method, find the equation with the given.
SOR
- 逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯—塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯—塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Su
shuzhijisuan
- 数值计算，利用newton迭代法和弦截法计算插值多项式-Numerical calculation, using newton iteration method chord intercept method to calculate the interpolation polynomial
Jacobi
- 通过迭代方法计算非线性方程组，主要是通过雅克比迭代的方法-Be calculated by iteration of nonlinear equations, mainly through the Jacobi iterative method
JacRelPthreads
- pthreads jacobi iteration
Artificial_fish
- 每条人工鱼迭代20次的位置,每条人工鱼迭代20次的位置,对应的Y的值,每条人工鱼迭代20次的临时位置,公告牌,每条人工鱼迭代20次的位置,对应的Y的临时值，公告牌,人工鱼移动的最大步长,求出最优的函数值；-Each of artificial fish, the location of 20 iterations, each iteration of artificial fish, the location of 20 times the corresponding value of Y, e
simpler
- Simpler程序，迭代，速度压力，半隐式，比simple收敛快-Simpler procedures, iteration, velocity pressure, semi-implicit, converges faster than the simple
NumericalAlgorithms
- 各种数值算法，包括，艾特肯，杜氏分解法，二分法，分段线性插值，复合梯形法，复合辛普森，高斯消去法，列主元素消去法，龙贝格算法，雅克比迭代等等。-Numerical Algorithms,includeing Aitken,Duchenne decomposition,Dichotomy,Piecewise linear interpolation,Composite trapezoidal rule,Composite Simpson,Gaussian elimination,Out the m
ProjectTwo
- Iterative Techniques, Jacobi Iteration, Gauss Seidel iteration and SOR iteration
cvt_dense
- 采用密度函数计算CVT胞的尺寸。通常情况下，任意给定的初始数据，并不断密度，无级变速器将包括面积大致相等的细胞。-CVT_DENSE was an effort to compute a centroidal Voronoi tessellation (CVT) in which there were cells of specified size. Normally, given arbitrary initial data and a constant density, the CVT wo
DataMining_apiori
- apiori算法的实现程序。使用侯选产生发现频繁项集算法。每一次迭代分为连接步和剪枝步。-apiori Algorithm program. Generated using the candidate frequent itemsets discovery algorithm. Each iteration is divided into connecting step and pruning steps.
Newton3
- 一元二次方程牛顿迭代法的可视化，只要你输入参数以及逼近值，即以界面的形式输出结果以及图形-Dollar Quadratic Newton iteration method for visualization, as long as you enter the parameters and the approximation value, that is in the form of output interface, and graphical
Files
- 有限差分的迭代算法的控制台程序，可以输出每一次迭代的记录。有需要的自己试试吧-Iterative finite difference algorithm console program, you can record the output of each iteration. The need to own a try
jacobi.m
- jacobi solves the equation System A x = b with a Jacobi-Iteration [x] = jacobi(A,b,omega) -jacobi solves the equation System A x = b with a Jacobi-Iteration [x] = jacobi(A,b,omega)
newton
- 用简单迭代法和牛顿迭代法求exp(x)+10*x-2=0的近似根，误差不超过0.0005，取初值为0，简单迭代法用迭代过程(2-exp(x))/10-With a simple iteration method and Newton iterative method seeking exp (x)+10* x-2 = 0 approximation of the root, the error does not exceed 0.0005, take initial value of 0, a
tree
- 混沌模型的Matlab演示程序，程序是通过迭代运算，形成了一个树叶型的分形结构-Chaos model Matlab demonstration program, the program is through iteration, forming a leaf-shaped fractal structure
gauss_seidel
- 数值分析：Gauss_Seidel迭代法求解线性方程组。界面美化。c源代码-Numerical Analysis: Gauss_Seidel iteration method for solving linear equations. Interface landscaping. c source code
111
- 用迭代法求a的立方根,求立方根 迭代公式为 ::Xi+1=2/3*Xi+a/(3*Xi*Xi) -Iterative method of seeking a cube root, cube root iteration formula is seeking:: Xi+1 = 2/3* Xi+ a/(3* Xi* Xi)