搜索资源列表
mySOR
- 实现N阶线性方程组Ax=b逐次超松弛迭代法的通用程序-Realization of N-order linear equations Ax = b successive over-relaxation iteration method generic procedures
mathvalue
- 编写一个用SOR法解方程组Ax=b的计算机程序,其中 要求程序中不存系数A,分别对不同的阶数(例如n=15,80)取w=1.7,1.8,1.9,进行迭代,记录近似解 达到 时所用迭代次数k,观察松弛因子对收敛速度的影响。 -SOR method used to prepare a solution of equations Ax = b of the computer program, which calls f
sor
- 回溯算法的一些题目的源代码,希望对大家有帮助-Algorithm back some of the topics of the source code, I hope all of you will help
ISsource
- 图像分割中“Intelligent Scissors”的源码,也成为Livewire,效果不错,可直接运行-Image Segmentation Intelligent Scissors the source, has also become a Livewire, good results can be directly run
1
- 迭代法求解方程组,包括雅可比迭代法,高斯-赛德尔代法,SOR迭代法可供选择-Iterative method for solving equations, including the Jacobi iterative method, Gauss- Seidel generation method, SOR iterative method to choose
GSOR
- 给出了广义逐次超松弛( GSOR) 迭代算法,得到了GSOR 算法收敛的必要性和充分性 条件,当参数矩阵Ω = diag (ω1 ,ω2 , ⋯ ,ωn) = ωI n 时,即可得到熟知的SOR 算法,举例说明了 GSOR 算法的应用。-Gives the generalized successive over-relaxation (GSOR) iterative algorithm has been GSOR al
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
NewtonSorMethod
- 通过牛顿-SOR迭代法求解线性方程 不同的迭代因子有不同的迭代效率,从0至2迭代次数先减少后增加,在1.2附近迭代次数最少,而在0和2 附近次数最多。-Through the Newton-SOR iterative method for solving linear equations iterative different factors have different iteration efficiency, from 0-2
numerical-method
- 数值方法课程中的程序,如GaussSeidel迭代法解方程组,Jacobi迭代法解方程组,SOR迭代法解方程组,杜利特尔矩阵分解以及矩阵的直接解法,拉格朗日插值等11个程序。-Courses in numerical methods, such as iterative method for solution GaussSeidel equations, Jacobi iterative method for solution of e
homework
- Jacobi和SOR算法实现,自己写的-Jacobi and SOR
spgs
- 用途:利用二分法快速求解非线性方程f(x) = 0; 用向量形式(普通存储格式)的Gauss-Seidel迭代解线性方程组Ax=b;Newton迭代法解非线性方程f(x) = 0;用分量形式的SOR迭代解线性方程组Ax=b;用向量(稀疏存储)形式的Gauss-Seidel迭代解线性方程组Ax=b -Purposes: the use of dichotomy quickly solving nonlinear equations
Jacobi
- 用SOR迭代法求矩阵,可以求任意阶的矩阵,非常好用-SOR iterative method with matrix, can be arbitrary order for the matrix, very easy to use
xianxingfangchengzuqiugen
- 线性方程组求根实验,分别用平方根法,Jacobi迭代法(不收敛),SOR三种方法,包含实验报告-Root experimental system of linear equations, respectively, with the square root method, Jacobi iterative method (not convergence), SOR three methods, including test report
yuyinshiyan
- 线性方程组求根实验,分别用平方根法,Jacobi迭代法(不收敛),SOR三种方法,包含实验报告-Root experimental system of linear equations, respectively, with the square root method, Jacobi iterative method (not convergence), SOR three methods, including test report
GSandSOR
- 高斯GS与超松弛SOR迭代算法解线性方程组-Gaussian GS and SOR iterative algorithm over-relaxation solution of linear equations
SOR
- 数值分析的算法,松驰迭代算法,要的人可以下载-Numerical analysis algorithms, relaxation iterative algorithm, it is necessary to take a look at the people can download
feixianxing
- mulStablePoint 用不动点迭代法求非线性方程组的一个根 mulNewton 用牛顿法法求非线性方程组的一个根 mulDiscNewton 用离散牛顿法法求非线性方程组的一个根 mulMix 用牛顿-雅可比迭代法求非线性方程组的一个根 mulNewtonSOR 用牛顿-SOR迭代法求非线性方程组的一个根 mulDNewton 用牛顿下山法求非线性方程组的一个根 mulGXF1 用两点割线法的第一种形式求
experimentreport
- 用迭代法解方程组 Jacobi Gauss-Sedel SOW 超松弛迭代 各种技术的比较 数值实验报告-Iterative solution of equations Jacobi Gauss-Sedel SOW SOR numerical comparison of various techniques Experimental Report
seach_postiton
- 字典序问题:在数据加密和数据压缩中常需要对特殊的字符串进行编码。给定的字母表 A 由 26 个小 写英文字母组成 A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左到 右出现的次序与字母在字母表中出现的次序相同,且每个字符最多出现 1 次。例如,a,b,ab, bc,xyz 等字符串都是升序字符串。 -search the postion for the given ascend sor strin
ProjectTwo
- Iterative Techniques, Jacobi Iteration, Gauss Seidel iteration and SOR iteration