搜索资源列表
Bisection
- he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively
chap17
- 对任意一个实数，可以利用它来求平方根，怎么这么麻烦啊？-For any real number, you can use it to order the square root, how can such a trouble ah?
path
- 找出（二叉树中）从根结点到任一给定的结点的路径（非递归实现）-To find (in Binary Tree) from the root node to any given node of the path (non-recursive implementation)
szfx2
- 数值分析之计算方法与实验2：方程求根 by java-Numerical analysis method of calculation and experiment 2: Root equation by java
HUFFMAN
- 建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.
SFE
- 建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.
Newton
- 这是一个用java高级编程语言编写的程序，能够实现用牛顿迭代法求解某个函数在某个指定区间内的根，方便易用。-Java This is a high-level programming languages used in the preparation of procedures, be able to achieve with Newton iteration to solve a function in a specified range of root and user-friendly.
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
colorvfield
- This matlab scr ipt is for vector field plot. It might be helpful for 2D and 3D field plot. Try it.
isqrt
- 32位无符号整数开方得到16位无符号整数的算法及实现代码-32-bit unsigned integer prescr iption 16 bit unsigned integer code of the algorithm and the realization of A algorithm an emplimentation codes of computing the 16-bits square root result from a 32-bits unsigned integer
code5_2
- 用弦截法来求非线性方程的根，方便快捷！非常好用-String cut-off method used for the root of nonlinear equations, convenient and quick!
LMFnlsq
- 计算复变方程的根，根可以为复根，MATLAB-Complex variable equation calculated root, root root for the rehabilitation,
exp5
- Newton弦截法求根 初值设为x为 0.1,0.2,0.9,9.0.可在程序中更改 -Root chord Newton method initial cut-off set x to 0.1,0.2,0.9,9.0. May change in the procedure
S020600318
- « 问题描述： 按前序列出二叉树各结点为根的子树的结点数。 « 实验任务： 对于给定的二叉树，计算二叉树各结点为根的子树的结点数，并按前序列出。 -« Descr iption of the problem: According to the former sequence of binary tree nodes for each sub-tree root nodes. « Experimental task: For a giv
fixed_point
- Fixed-Point iteration-Function fixed_point(p0, N) approximates the solution of an equation f(x) = 0, rewritten in the form x = g(x), which is a sub-function the user has to enter. the call to the function fixed_point(p0, N) returns the root of the eq
binary_tree_characters
- 程序确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Procedures to determine the characteristics of binary tree. Such as: the level of each node, the node from the root to the branch length (path length), the number of generations a
MPSKTransmission
- 有关MPSK调制，传输模型。成型脉冲分为矩形，升余弦脉冲，平方根升余弦脉冲。M的值为2，4和8.所加噪声是高斯白噪声。-Of the MPSK modulation, transmission model. Pulse shape is divided into rectangular, raised cosine pulse, the square root raised cosine pulse. The value of M for 2,4 and 8. The increase in n
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,/
newton
- newton method 用迭代法计算root.数值计算的常用方法之一。-newton method： use iteration to calculate the root of a fuction. It is a common used method.
Dijkstra
- Set的实现是通过２叉排序树来实现，就是将所有的元素用一个树来存储，根元素大于左子树的元素，小于右子树的元素，所有的操作都是基于这个树，通过判断元素的大小来选择对左子树操作还是右子树操作，这样操作数量和树的层数成正比-Set by the realization of two binary sort tree to achieve, that is, all the elements to store a tree, the root element is greater than the le