搜索资源列表
Jacobi-and-Gauss-Seidel
- Jacobi迭代法和Gauss-Seidel迭代法求解线性方程组，matlab语言编程。-Jacobi iteration method and Gauss-Seidel iteration method for solving linear equations, using the Matlab programming language.
math
- 通过C语言编程实现数值计算方法中的雅可比迭代，输入各个方程组的系数和迭代次数可以得到方程的精确解和中间计算结果。另外方程组未知数的个数可以自行设定。-Through the C language programming to achieve numerical method of Jacobi iteration, enter all equations of the coefficients and number of iterations can be exact solutions of
C++数值分析代码
- 里面包含了一个用VC开发的二分法程序，牛顿迭代法程序源码-Which contains a dichotomy with VC development procedures, Newton iteration procedure source
Jacobi_etc
- ％Jacobi迭代法求方程组等程序，内含有七个解放程组的程序，希望这些程序对大家有一点用处- Jacobi iteration procedures for equations, etc., which contain seven-way group liberation process, we hope that these procedures there is one point on the usefulness of
Matlab
- 矩正实验室的源代码，包括牛顿迭代法 拉格朗日法 和其他的经典算法-Moment is the laboratory s source code, including the Newton iteration Lagrangian and other classical algorithm
erfenfaheNewtonXiashan
- 包括二分法，Newton下山法和improved Newton迭代法-Including the dichotomy, Newton downhill method and improved Newton iteration method
NewtonAndromberg
- 非线性方程牛顿迭代法和数值积分的龙贝格解法-Newton iteration of nonlinear equations and numerical solution of integral Romberg
3107002005_4th_jocabiGS
- 非线性方程组不能用消去和分解法进行求解，jacabi迭代和高斯迭代是最常用的两种迭代方法-Nonlinear equations can not be eliminated and the decomposition method to solve, jacabi iteration and Gauss iteration is the most commonly used two types of iterative methods
jacobi
- 此代码是数值分析中的jacobi迭代法的实现方法-This code is a numerical analysis of the realization of jacobi iteration method
kexingfangxiangfa
- 线性约束条件的只需一次迭代的可行方向法。-Linear constraints only the first iteration of the feasible direction method.
duff
- 吸引到某个吸引子的点集叫该吸引子的吸引盆 吸引子：点在迭代的作用下得到的结构。一般可以用微分方程确立。例如：Lorenz吸引子-Attracted to the attractor of a point set is called the attractor basin of attraction of attractor: point in the role of iteration under the structure. Ordinary differential equations
mltemplates.v1_1
- Matrix Iteration Methods. Matlab Implementation.
NewtonMethod
- 用牛顿迭代的方法，编写程序，是函数迭代的效率提高，比一般的迭代法要好很多-By Newton iteration method, the preparation procedure is to improve the efficiency function iteration, iterative method than the average much better
haha
- 牛顿迭代法 需要的同学尽量来拿吧 不要钱-Newton iteration needs of students as far as possible it should not来拿money
tenlei
- function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent for U max_iter = 100 ％ Max. iteration min_impro =1e-5 ％ Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if
C++3
- 杜里特尔分解法.c改进平方根法.c拉格朗日插值法.cpp牛顿迭代.cpp梯形法积分.cpp追赶法.c 杜里特尔分解法.c改进平方根法.c拉格朗日插值法.cpp牛顿迭代.cpp梯形法积分.cpp追赶法.c-Duri Ritter decomposition. C to improve the square root law. C Lagrange interpolation method. Cpp Newton iteration. Cpp trapezoidal integrat
Jacobi
- 雅克比迭代法求实对称矩阵的特征值和特征向量-Jacobian iteration realistic symmetric matrix of eigenvalues and eigenvectors
CG
- 数值计算CG算法函数，记录迭代中最小误差及迭代的中间结果-CG algorithm for numerical calculation function, recording the smallest iteration errors and intermediate results of iteration
CalculationAlgorithm
- Gauss,加速迭代,拉格朗日插值法,龙贝格算法,牛顿迭代算法，梯形法积分，自适应梯形公式-Gauss, to accelerate the iteration, the Lagrange interpolation method, Romberg algorithm, Newton algorithm, trapezoidal integration method, adaptive trapezoid formula
NewtonIter
- 牛顿迭代法的C++ 算法，通过初始值和原方程进行有限次迭代，就可以得到接近真实值的解-Newton iteration of the C++ Algorithm, through the initial value and the original equation limited iterations, you can get closer to the true value of the solution