搜索资源列表
Netow.rar
- 牛顿迭代法(Newton s method)又称为牛顿-拉夫逊方法(Newton-Raphson method),它是牛顿在17世纪提出的一种在实数域和复数域上近似求解方程的方法。多数方程不存在求根公式,因此求精确根非常困难,甚至不可能,从而寻找方程的近似根就显得特别重要。,Newton iteration (Newton' s method) is also known as the Newton- Raphson method (Newton-Raphson method), it i
gaosisaideer.rar
- 用高斯-赛德尔迭代法求方程组的根。它的原理与简单迭代法相似,但在赛德尔迭代法中,每次迭代时充分利用当前最新的迭代值,With the Gauss- Seidel iterative method seeking the roots of equations. Its principle with simple iterative method similar, but the Seidel iteration method in each iteration to take full advan
test3_5
- 解方程组的雅克比迭代法,其中描述了迭代法的收敛条件-Jacobi equations solution iteration, which describes the convergence conditions for iterative methods
NEWT
- 用牛顿迭代法求解方程的一个实根。方程为一元三次方程。-Newton iteration method for solving equations with one real root. Equation is a cubic equation.
yaccobi
- 数值计算方法,将连续方程离散化,用迭代方法求解最优解,这里是雅可比迭代C++的代码-Numerical methods, discretization of continuous equations, iterative method for solving the optimal solution, here is the Jacobi iteration code in C++
ADP
- 近似动态规划(ADP)的无限时间值函数迭代的例子-Approximate Dynamic Programming (ADP) of the infinite time value function iteration example
code.rar
- (1)用Doolittle三角分解(LU)法解方程组。 (2)分别用Jacobi迭代, Gauss-Seidel迭代法解方程组。 ,(1) Triangle Doolittle decomposition (LU) Solving equations. (2), respectively, with Jacobi iteration, Gauss-Seidel iteration method for solution of equations.
SOR
- 松弛因子的介绍(“松弛迭代法是高斯-塞德尔迭代法的一种加速方法,基本思想是将高斯-塞德尔迭代法得到的第k+1次近似解向量与第k次近似解向量作加权平均,当权因子(即松弛因子)w选择是适当时,加速效果很明显。因此这个方法最关键的是如何选取最佳松弛因子。")和算法。-Relaxation factor of the introduction (" relaxation method is the Gauss- Seidel iteration method for an accelerated
sor.rar
- 求解线性方程组——超松弛迭代法,程序用c语言编写。,Solving linear equations- over-relaxation iteration method, procedures using c language.
The_Levenberg-Marquardt_Algorithm
- LM算法 老外写的The Levenberg-Marquardt (LM) algorithm is the most widely used optimization algorithm. It outperforms simple gradient descent and other conjugate gradient methods in a wide variety of problems. This document aims to provide an intuitiv
newton
- 用牛顿迭代法解非线性方程组的源程序,在MATLAB中可用-Newton iteration method for nonlinear equations of the source, available in MATLAB
k-means-segamen-method
- 本实验基于K-Means聚类算法思想实现了字符分割,因为车牌规定是7位的,所以K取7。另外本实验对K-Means算法进行了改进,充分考虑了初始点的设置及迭代结束条件。实验结果证明这种改进的K-Means算法实现车牌字符分割是快速、有效的。-In this study, K-Means clustering algorithm based on the ideology of the character segmentation, because the license plate require
jacobi
- Jacobi Iteration - Method of Simultaneous Displacement for a system of linear equations
IC_linear_equation
- Hilbert矩阵的J、GS和SOR迭代-Hilbert matrix of J, GS and SOR iteration
MinTV_Test
- 采用MinTV算法对图像进行处理,用MinTV恢复算法+牛顿迭代法实现压缩感知对图像的处理。-MinTV algorithm using image processing, with MinTV recovery algorithm+ Newton iteration method to achieve compression perception of the image processing.
yuandaima
- 用C语言实现高斯顺序消元法和行尺度化的方法,以及雅克比迭代法和高斯赛都迭代法-Using C language Gaussian elimination method and line order scaling methods, and Jacobi iteration and Gauss iterative method match all
Newtoniterate
- 数值计算牛顿迭代法的matlab源程序 说明如下: %fun----input,the part as the form of f(x) in the equation f(x)=0 % ini----input,sets the starting point to ini % err----input,sets admissible error % sol----output,returns the root of equation-Numerical calculati
sy3
- Jacobi迭代法、Gauss-Seidel迭代法、超松弛迭代法(SOR方法)分别求解线性方程组的近似解-Jacobi iteration, Gauss-Seidel iteration, SOR (SOR method) for solving linear equations are approximate solutions
IKAnalyzer3.2.8-source
- IKAnalyzer的源码包,实现中文分词功能,(1) 采用了特有的“正向迭代最细粒度切分算法”,具有60万字/ 秒的高速处理能力。 (2) 采用了多子处理器分析模式,支持:英文字母( IP 地址、Email、URL )、数字(日期,常用中文数量词,罗马数字,科学计数法),中文词汇(姓名、地名处理)等分词处理 。 (3) 优化的词典存储,更小的内存占用。支持用户词典扩展定义 (4) 针对 Lucene 全文检索优化的查询分析器 IKQueryParser;采用歧义分析算法优化查询关键
exact_alm_rpca
- RPCA (Robust Principal Component Analysis)是目前用于矩阵填充、图像去噪的最有效的优化方法。该代码是求解RPCA的一种数值算法——Exact ALM(Exact Augmented Lagrange Multiplier)-The most basic form of the exact ALM function is [A, E] = exact_alm_rpca(D, λ), and that of the inexact ALM function i