搜索资源列表
CA
- CA算法可以将数量型属性划分成若干个优化的区间，它综合了分层聚类于划分聚类的优点，对于给定的不同的初始类个数，CA算法能随着迭代过程的不断进展改变类的数目，一些竞争力差的类即类的基数小于给定阙值的类将在迭代过程中不断消失，最终得到能够有效体现数据实际分布情况的优化聚类个数。-CA algorithm for quantitative attributes can be divided into a number of the interval optimization, hierarchical
tuxiangchuli
- 迭代法求最佳阈值 图像为baboon.bmp 分别对R,G,B三个颜色求阈值，进行分割-Iterative method for the optimal threshold image baboon.bmp respectively R, G, B three colors for the threshold segmentation
fx
- 一个分形压缩的程序： 1、因为本程序时间长，FX中先选择图片的大小 2、编码与解码 3、做误差图和只方图 4：画出每次迭代的解码图象 5、本程序来自本网站，修改了部分，解释说明更清楚。 6、增加了部分功能，希望对大家有所帮助，互相学习…… -A fractal compression process: 1, because this process a long time, FX in the first select the size of picture 2, e
poissonfdm
- 用有限差分法来解偏微分方程，采用高斯——赛德尔迭代方法，并用前后两次迭代差的矩阵的无穷范数作为是否停止迭代的依据。-Using finite difference method to solve partial differential equations, using Gauss- Seidel iterative methods, and poor before and after the two iterations of the infinite matrix norm as the b
paul
- 各种数值分析常用的程序，雅克比迭代，G_S法，牛顿 拟牛顿，拉格朗日数乘等-Numerical analysis of a variety of commonly used procedures, Jacobian iteration, G_S law, Newton' s quasi-Newton, Lagrange and so few take
EXIT
- 本源码包参考英国Southampton大学Robert G. Maunder教授2008年的EXIT charts开源demo，给出了通用(分量码多项式可自定义)并行级联Turbo码的EXIT charts的作图源码。同时可完成迭代轨线、BER等值线的绘制等工作。 由于对于码块长较大的情形仿真需要较长时间，源码包也给出了部分分量码多项式的仿真结果，可直接用于绘图。 源码包还给出了最经典的S.Ten Brink介绍EXIT charts基本原理的参考文献，以及本人对通信系统中迭代译码过程分
feixianxing
- mulStablePoint 用不动点迭代法求非线性方程组的一个根 mulNewton 用牛顿法法求非线性方程组的一个根 mulDiscNewton 用离散牛顿法法求非线性方程组的一个根 mulMix 用牛顿-雅可比迭代法求非线性方程组的一个根 mulNewtonSOR 用牛顿-SOR迭代法求非线性方程组的一个根 mulDNewton 用牛顿下山法求非线性方程组的一个根 mulGXF1 用两点割线法的第一种形式求非线性方程组的一个根 mulGXF2 用两点割线法的第二
atan_cordic
- 基于CORDIC算法计算反正切函数。输入横坐标纵坐标及迭代次数，输出角度及弧度值；附CORDIC英文文档说明-atan function based in CORDIC algorithm
art
- 用于解反问题的代数重建法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x-Algebraic solution of the inverse problem for the reconstruction of France, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x
ASA
- 自动谱分析：可用于丢失/采样/子束光谱分析；矢量自动迭代，可用于建模，故障诊断；-The applications of this additional toolbox are: - Automatic spectral analysis for Irregular sampling/Missing data, analysis of spectral subbands, - Vector Autoregressive modeling and Detection [uses ARMA
experimentreport
- 用迭代法解方程组 Jacobi Gauss-Sedel SOW 超松弛迭代 各种技术的比较 数值实验报告-Iterative solution of equations Jacobi Gauss-Sedel SOW SOR numerical comparison of various techniques Experimental Report
tree
- 混沌模型的Matlab演示程序，程序是通过迭代运算，形成了一个树叶型的分形结构-Chaos model Matlab demonstration program, the program is through iteration, forming a leaf-shaped fractal structure
fire
- 模拟退火算法是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。本文给出了该算法的详细介绍和伪代码。-Monte-Carlo simulated annealing algorithm is based on a heuristic iterative method for solving stochastic search process. This paper gives a detailed descr iption of the algorithm and pseudo code.
Iteration
- 摄影测量中解算外方位元素的迭代程序，很经典，很好用。用了就知道它的好。-Photogrammetry solution of exterior orientation elements of the iterative calculation procedure is very classic, very good use. Used to know it' s good.
matlab
- 自适应的最小均方算法：只要自适应线性组合器每次迭代运算时都知道输入信号和参考响应，选用LMS算法很合适。-Adaptive least mean square (LMS) algorithm: as long as the adaptive linear combiner for each iteration when they know that the input signal and reference response, selection of LMS algorithm is ver
exit
- EXIT图，外信息转移图，对做迭代分析的非常有帮助。-EXIT chart, extrinsic information transfer chart, right to do iterative analysis very helpful.
Beamforming
- MVDR自适应波束形成的LMS算法使用，LMS算法迭代次数对波束形成结果的影响-MVDR adaptive beamforming using the LMS algorithm, LMS algorithm is the number of iterations on the results of beam-forming
work
- 图像huffman编码程序，只对256色的图像有用，彩色图像会变成黑白图像，采用迭代算法一层一层的推出huffman编码-Image huffman coding process, only 256-color images useful for color image will become black and white images, using iterative algorithm level by level, the introduction of huffman coding
MATLAB1
- 计算方法用二分法 以及两种迭代法来进行迭代计算的码源-With the dichotomy, as well as the code source of two kinds of iterative
xindaorongliangdiedaisuanfa
- 用MATLAB软件编程实现一般信道容量迭代算法。-Programming with MATLAB software, the channel capacity of a general iterative algorithm.