搜索资源列表
zizhi
- 8.2.3利用子指针数组的普通树后根遍历算法-8.2.3 the use of common sub-tree pointer array root traversal algorithm
sumyuandaima
- 自己编写的有关数学的算法代码，加减乘除和开根运算都可以。-Imagecut.rar related mathematical algorithms code, add, subtract, multiply and divide and open root operation.
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
shuzhifenxichengxu
- 包含多个数值分析程序，高斯消去法，拉格朗日插值法，牛顿插值法，sor，平方根法等。-Multiple numerical analysis program, Gaussian elimination method, Lagrange interpolation, Newton interpolation, sor, the square root law.
gauss_seidel
- matlab编写的Gauss_Seidel迭代算法求解方程组的根 -iterative algorithm matlab prepared Gauss_Seidel root of solving equations
complex_roots
- This calculate n th degree root of complex number. Comments are polish, but math is universal.
Rapson_numerical
- In this experiment our equation is f(x0)=x^3-3x-1.We have to find the real root of this equation between 1 and 2.The programme has been shown in the"new_rap" We have done the comparison between the Newton Rapson method the false position method
HW1--Root-Difination
- Equation Solver (3 methods)
aitkenroot
- 埃特金求解C语言代码 //函数名：aitkenroot //功能描述：求出[a,b]区间内的非线性方程f(x)的一个实根 //输入参数：*x0（指向迭代初值和终值的指针） // f（迭代函数） // eps（精度要求） // max（最大迭代次数） //返回值：0（迭代失败），1（迭代成功）-Aitken Solution C language code// function name: aitkenroot// Function Descr iption: Fin
toolMga
- 遗传工具箱类构造函数。分为染色体类构造函数。一般基类的构造根 ，对于连续型设计变量的数据提取的构造。得到的染色体设置属性-Genetic toolbox class constructor. Divided into the chromosome class constructor. The general structure of the root base class for the continuous design variables of the structure of data e
timings
- 本程序计算1到10000的开根号通过三种不同方法所需要的时间-The program calculates the 1 to 10,000 square root of three different methods by the time required
include
- 哈夫曼编码的应用很广泛，利用哈夫曼树求得的用于通信的二进制编码称为哈夫曼编码。树中从根到每个叶子都有一条路径，对路径上的各分支约定：指向左子树的分支表示“0”码，指向右子树的分支表示“1”码，取每条路径上的“0”或“1”的序列作为和各个对应的字符的编码，这就是哈夫曼编码。-Huffman coding application is comprehensive, the use of Huffman tree obtained is called binary code used for comm
pingfanggen
- 平方根 求解线性方程组的解 数值计算-The square root of the solution for solving linear equations
fr_psnr
- PSNR is used to measure the difference between two images. It is defined as PSNR = 20 * log10(b/rms) where b is the largest possible value of the signal (typically 255 or 1), and rms is the root mean square difference between two images. The PS
lx
- 完成二叉树的基本算法，包括二叉树的生成（多种方式，先根、层次、双序列），遍历（前序、中序、层次等），求叶子节点数等-Completion of the basic binary tree algorithm, including the generation of binary tree (a variety of ways, first the root, level, two-sequence), traversal (pre-order, in sequence, level, etc.)
white_black
- 1、问题描述 设平面上分布着n个白点和n个黑点,每个点用一对坐标(x, y)表示.一个黑点b=(xb,yb)支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw.若黑点b支配白点w,则黑点b和白点w可匹配(可形成一个匹配对).在一个黑点最多只能与一个白点匹配,一个白点最多只能与一个黑点匹配的前提下,求n个白点和n个黑点的最大匹配对数. 2、具体要求 要求:时间效率在O(NlgN) 3、实现方法 基于贪心算法 以x坐标的升序对黑点排序(可用QUIC
cPP
- Fibonacci数列 为数组分配一动态内存并将首地址赋给指针变量p //求整数，长整数，双精度数的二次方根 //百钱问题-Fibonacci numbers as an array of dynamic memory allocation of a pointer variable and assign the address of the first p// find integer, long integer, double the number of secondary ro
LaGrange
- La-Grange matris with making polinom the find root
lll
- 方程（组）、搜索根的方法、二分法、抛物线法、牛顿(Newton)切线法等在MTLAB中的应用-Equation (s), search the root of the method, bisection method, parabolic, Newton (Newton) tangent law of the MTLAB
RMSE
- To find the root mean square error of the calculated solution for a Stochastic Differential Equation (SDE) from Euler , Millstein, and Runge Kutta Method