搜索资源列表
RecursiveFractalAnimationtreeimplementation
- 该代码采用递归算法编程实现下列分形树，并且提供界面允许用户输入分形树迭代次数,有程序绘制树形分形体并动画显示分形树生长过程 代码内含文档说明 -Recursive algorithm using the programming code to achieve the following fractal tree, and provides the interface allows the user to enter iteration fractal tree, the procedur
Fast32bitdivideKeil
- The functions fast_long_divide() and fast_int_divide() will divide a value (dividend) by a divisor in the range 0 to 16 inclusive. These functions are fast because they take full advantage 8051 microcontroller DIV instruction and require only one ite
rachos.releigh.powerritation.gmre
- 实现兰乔斯迭代，瑞利商迭代，幂迭代，和grme算法-The realization of ranchos iteration, Rayleigh quotient iteration, power iteration, and algorithm grme
Seidel_iterative_method
- 数值分析中的SEIDEL迭代法的MATLAB源程序，按照代码中的提示输入，可以直接得出结果-Numerical Analysis SEIDEL iteration of the MATLAB source code, in accordance with the prompt code input, the results can be directly
G_S
- Gauss-seidel迭代与两种Jacobi迭代的matlab实现-Gauss-seidel iterative realization of the matlab
Ex
- 实现迭代自组织数据分析算法，逻辑结构比较复杂。-Iteration to achieve self-organizing data analysis algorithm, more complex logical structure.
jiemi
- 这是一个简单的解密程序。利用置换算法进行五轮迭代-This is a simple process of decryption. Replacement algorithm using 5 iteration
1
- matlab开发环境，Broyden迭代法解非线性方程组，其中的M文件-matlab development environment, Broyden iteration method for solution of nonlinear equations, in which M-file
code5_1
- NEWTON迭代法求非线性方程的根，方便快捷！-NEWTON iteration of nonlinear equations for root
DLZTTC-FDTD
- 通过求解线性方程组来完成各个场量的迭代，能够计算导体球的散射截面。-By solving linear equations to complete the volume of each market iteration, to calculate the scattering cross section of conducting sphere.
c
- 松弛迭代法解线性方程组,含数值计算方法内容，c++程序。-Relaxation iteration method solving linear equations, numerical method with the content, c++ program.
newton
- 关于牛顿迭代法以及弦解法的相关程序，实验平台是vc.-Newton iteration on the solution as well as the string of related procedures, the experimental platform is vc.
fixed_point_systems
- Fixed-point for functions of several variables -Function fixed_point_systems(x0, N) approximates the solution of a system of nonlinear equations F(x) = (f1(x), f2(x), ..., fn(x)) = 0 rewritten in the fixed-point form x = G(x) = (g1(x), g2(x), ..., gn
nonlinear
- Nonlinear Problem Files Collection -A collection of example programs and algorithms dealing with the solution of nonlinear problems. The following files are included (among others): damped Newton s method (see screenshot) Newton s method
secant
- In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.-The secant iteration to find the zero of some non-linear function converges to zero if
List
- 详细介绍了.net泛型类的创建和实现适用,以及如何支持迭代(foreach)操作-Described in detail. Net generic categories applicable to the creation and realization, as well as how to support iteration (foreach) operation
fastica
- FastICA算法，又称固定点(Fixed-Point)算法，是由芬兰赫尔辛基大学Hyvä rinen等人提出来的。是一种快速寻优迭代算法，与普通的神经网络算法不同的是这种算法采用了批处理的方式，即在每一步迭代中有大量的样本数据参与运算。-FastICA algorithm, also known as fixed-point (Fixed-Point) algorithm, University of Helsinki, Finland by Hyvä rinen et al
Scientific_Computing_and_C_assembly
- 第二章 解线性方程组的直接法 第三章 解线性方程的迭代法 第四章 插值法 第五章 数据拟合 第六章 数值微分和积分 第七章 矩阵特征值问题 第八章 非线性方程数值解法 第九章 非线性方程组的抚今迭代解法 第十章 常微分方程初值问题的数值解法 第十一章 常微分方程边值问题的数值解法 附录A C语言屏幕绘图 -Chapter II solution of linear equations in Chapter III of the direct meth
cJuliaExSrc
- julia set fractals written in visual c+++. the it has the possibility to modify the values for the sets(like xc,number of iteration,or randomness)
math
- 非线性方程求根的各种算法的比较， //求非线性方程的根 //程序中共给出了以下几种方法求非线性方程的根 // (1)二分法 (2)牛顿法 (3)普通迭代法 (4)斯蒂芬森迭代法 (5)弦截法 //程序中用到的函数为： f(x)=x^3-x-1 //其中:(1)普通迭代法用的迭代函数为：x=(x+1)^(1/3) // (2)斯蒂芬森迭代法用的迭代函数为：x=x^3-1-Root of all kinds of non-linear equation algorithm,/