搜索资源列表
MATlabIterative-simulation
- 进行迭代仿真，实现耦合方程的求解。通过有限次的迭代，来实现无穷次的仿真。-Iterative simulation, to solve the coupling equations。Through the finite iteration, to realize the simulation of infinite time.
matlab_files
- 四阶龙格库塔方法，拉格朗日迭代，牛顿迭代，这几个有用的迭代方法，简单实用-Fourth-order Runge-Kutta method, Lagrange iteration, Newton iteration, several useful iterative method, simple and practical
grid
- 给定边界在内部用椭圆型微分方程画网格的程序，包括问题简介和分析和结果，以及源代码，采用了简单迭代，g-s迭代，aid方法等-Given boundary in the internal with elliptic differential painting grid program, including Introduction to the problem and the analysis and results, as well as source code, using a simple
Numerical-solutions-for-Matlab
- matlab常用数值计算，包括牛顿迭代，拉格朗日插值法，牛顿差值，高斯消元，三角分解法，追赶法等。-matlab numerical calculations, including Newton iteration, Lagrange interpolation, Newton difference, Gaussian elimination, triangular decomposition, and catch up with the law.
algorithms-for-nonlinear-equations
- 一个求解非线性方程根的算法的集合，包括牛顿迭代法，二分法，不动点迭代法等方法。-A collection of algorithms for solving nonlinear equations root, including the the Newton iteration dichotomy, fixed point iteration method.
xiashan
- MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x
dir_iterate
- ext2fs directory iteration operations.
shuzhi-(2)
- 通过算法分析用牛顿迭代法求一元线性方程，让我们更好的掌握公式，与编程能力-Newton iteration algorithm analysis a linear equation, let us a better grasp of the formula, and programming capabilities
dir_iterate
- ext2fs directory iteration operations.
Lanczos
- Lanczos迭代算法，计算大型稀疏对称矩阵特征值-Lanczos iteration
mdpPI
- Contains excellent and exact implementation of Markov Dec. Processes using Policy Iteration and Value Itreration from the book Perter Norvig for AI.-Contains excellent and exact implementation of Markov Dec. Processes using Policy Iteration and Value
201305236-7
- mathlab题目代码，编程分别用jocabi迭代法求解方程。在一般情况下，Guass-Seide迭代法比Jacobi迭代法收敛要快一些，但这也不是绝对的，在木些情况下，Jacobi迭代法收敛，Guass-Seide迭代却可能不收敛-use matlab to deal with the equation -mathlab subject code, programming respectively jocabi iterative method for solving equations. U
beijing03
- 背景提取，迭代法(Surendra算法）；即采用帧差的方法，一帧图像减去前一帧图像，即可以对比得到图像中变化（移动）的区域，扣除移动的区域，即得到不动的背景。采用多帧图像迭代的方法，得到更加准确的背景。-Background extraction, iterative method (Surendra algorithm) frame difference method is used, an image by subtracting the previous frame, which can
PSO
- PSO工具，用户只需要定义好自己需要优化的函数(计算最小值或者最大值)，并设置好函数自变量的取值范围、每步迭代允许的最大变化量(称为最大速度，Max_V)等，即可自行优化。-PSO tool, users only need to define their own needs optimization function (calculation of minimum or maximum), and set the good function from the range of variable
diedai
- 迭代算法，利用matlab编译环境实现迭代求解矩阵最大特征值和特征向量；包含雅克比迭代、高斯迭代和SOR-Iterative algorithm, using matlab compiler environment to achieve maximum iteration for solving matrix eigenvalues and eigenvectors contains Jacobi iteration, Gauss and SOR iteration
pthread_ms_static
- this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by rows to any other threads to complete the total jobs.-this is implemented by pthread(share library) to dr
pthread_ms_dynamic
- this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by dynamic mode (different from static)by rows to any other threads to complete the total jobs.-this is impl
openmp_ms_static
- this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(static rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share lib
openmp_ms_dynamic
- this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(dynamic rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share li
NumericalAnalysisWork2
- 代码实现了矩阵求逆等运算，实现了牛顿迭代法-Code implements the matrix inversion and other operations, to achieve a Newton iteration