搜索资源列表
sierpinski_dt
- 利用分形中的迭代和递归算法实现Sierpinski地毯，程序简单易懂，改动程序中的n值即可控制递归次数。-use fractal iterative and recursive algorithm Sierpinski gasket, procedures simplified, changes to the procedures used for the control of n number of recursive.
2_C
- 利用90度角支撑迭代递归算法绘制C曲线，简单易懂！-use of 90 degree angle support recursive iterative algorithm mapping C curve, simple!
ART2
- CT重建算法，迭代算法ARTII，乘型ART算法，该算法法比初始值选择不能为0-CT reconstruction algorithm, iterative algorithm ARTII, x-ART algorithm, The algorithm method than the initial value of options can not be 0
Part_3_C_programmes
- 程序总结3:牛顿迭代|牛顿下山|秦九韶|三对角线追赶法|系统|弦割法|雅克比迭代|综合测评-procedures : Newton iteration | Newton down | Qinjiushao | 3 diagonal chasing France | System | Strings cutting France | Jacques than iterative | Comprehensive Assessment
Numberical
- 拉格郎日插值多项式,高斯-赛德尔迭代法,改进欧拉法（Ｃ＋＋），如果有什么错误，请联系tudaoyong456@163.com-Lagrange polynomial interpolation, Gauss - Seidel iterative method to improve Euler (C + +), If there is anything wrong, please contact tudaoyong456@163.com
RS_codec_system
- 这是我自己编写的一个完整的多进制GF域上RS信道编解码系统。解码采用梅西迭代算法。整个算法模块功能分明，GF域上运算都单独成为子模块，移植性强。还附有测试程序，方便了解各个模块的功能完成情况。-This is my own preparation of a comprehensive multi-band GF RS domain channel codec system. Messi iterative decoding algorithm used. The whole algorithm
chcapacity2
- 信道容量迭代算法用C++ 通过给定的信道转移矩阵-channel capacity iterative algorithm C through to the transfer matrix Channel
hopfield_for_tsp
- Hopfield网络解决旅行商问题（TSP），迭代过程中采用保优方法，并计算最优解和次优解的个数。-Hopfield network Traveling Salesman Problem (TSP), iterative process used method for ensuring quality, and calculating the optimal solution and sub-optimal number of solutions.
DrawH
- 一个绘制H型的分形图案的VC的源代码,内容完整,界面输入迭代次数后,可出图.-H-1 mapping of fractal pattern of the VC source code, the content is complete, the number of iterative interface input, Figure out to be.
niudunfa
- 计算方法实验，通过编程实现埃特金加速法，一般迭代法，牛顿法的收敛次数的计算-calculated experiment, Programming Aitken acceleration method, the general iterative method, the convergence of Newton's method of calculating the number of
FEAL8
- 本次的FEAL8轮叠代要求将64位的密文C与64位的密钥K经过要设计的解密程序运行得到所需的64位的明文P。由于2进制输入输出的位数太长不方便，再程序的数据运算中大量用上16进制。在数据的运算过程中又常常把输入的数据平均分成等份，因此在数据处理上用上数组形式。FEAL算法的三个基本运算函数是整个程序的重心，程序的密钥处理和解密过程都将以这三个运算函数为中心，因此，程序的设计以S函数 函数和 f函数来展开，再由主函数编写时调用三个函数。-the FEAL8 round of the iterati
Gauss-SerdelMATLAB
- 用Gauss-Serdel迭代法计算方程组的MATLAB函数文件-with Gauss - Serdel iterative method of calculating equations MATLAB function documents
JacobiMATLAB
- 用Jacobi迭代法计算大型方程组的MATLAB函数文件-Jacobi iterative method using large calculation equations MATLAB function documents
ZYB_NHD
- 程序采用当前最先进的Rijndael算法作为核心算法，带有可变块长和可变密钥长度的迭代块密码。块长和密钥长度可以分别指定成 128、192 或 256 位。假设一台一秒内可找出DES密钥的机器(如，每秒试255个密钥)，如果用它来找出Rijndael的密钥，大约需要149万亿年。程序内部还使用了其它算法和符合密钥学的数据结构。多线程操作，保证加密时程序界面流畅,程序是用VS2005,C#做的，现将源程序发布在此。供初学者学习，希望对大家有所帮助。-procedures using the mos
METHED_OF_STEEPEST_DESENT
- 通过最速下降算法研究基于梯度的自适应方法，最速下降是递归的，滤波器计算是一步步迭代进行-through the steepest descent gradient algorithm based on the adaptive method, the steepest decline is recursive, Filter is an iterative step by step
gaussianSrc
- The EM algorithm is short for Expectation-Maximization algorithm. It is based on an iterative optimization of the centers and widths of the kernels. The aim is to optimize the likelihood that the given data points are generated by a mixture of Gaussi
mm
- 雅可比迭代求解方程 用雅可比迭代计算一个线性方程组。用户只需要输入系数矩阵和常数矩阵就可以-Jacobi iteration equation Jacobian an iterative calculation of linear equations. Users only need to input matrix and constant coefficient matrix can
Mandel
- Mandel函数的迭代图像-Mandel function iterative image
diedai
- 迭代发解方程算法-iterative algorithm for solving equations made
mytree2
- 使用分形迭代算法，画出一棵简单的分支的树。没有树叶。顶端形成扇形，类似银杏树叶。-use fractal iterative algorithm, to give a simple tree branch. No leaves. Fan top form, similar ginkgo leaves.