搜索资源列表
root_finding
- Numerical optimization, root finding
gauss
- 高斯消去法求逆阵和 改进的平方根法求逆阵-Gaussian elimination Square Root
ComplexSample
- 通过例子实现复数乘法、除法、模、根、实幂指数、复幂指数、自然对数、正弦、余弦、正切的运算。-Multiplication,division,modulus，root，real exponent，complex exponential，natural logarithm，sine，and cosine of a complex number in a example.
zn02
- 用稳定边界法整定公式来求P,PI,PID的个参数，其中G是已知被校正系统的开环传递函数,kp为比例系数， Ti为积分时间常数，Td为微分时间常数，输入参量Gc为校正器传递函数，p为系统开环极点的个数（不计重根个数，即多重根只计一个根）-With the Stable Boundary tuning formula seeking P, PI, PID' s parameters, of which G is known to be corrected and the system of o
k
- 双亲表示法实现二叉树，用链表实现，和堆栈，能更好的找到根节点-Parents to achieve binary notation, with the linked list implementation, and the stack, can find a better root
code
- 基于boundar边界提取轮廓，采用曲率算法确定可能为指尖或者指根点的区域，采用该程序确定指尖指根区域。-Contour extraction based on boundar border, using the curvature method to determine the root may refer to point fingers or regions that use the procedure to determine the root area fingertips.
shuzhishiyan
- 两个数值实验的matlab编程实现。题目分别1是利用循环语句，计算数列根号5 ，根号下根号5 ，根号下根号下根号5…的极限，要求误差小于 10负8次方。 2利用级数pi=1-1/3+1/5-1/7+...可计算出无理数pi的近似值-Two numerical experiments matlab programming. Title 1 is the use of loop were calculated series roots and 5, roots and root number und
pinfanggeng
- 数值分析中平方根法，主要通过矩阵运算实现-The square root of the numerical analysis method, achieved mainly through the matrix operation
ji-suan-fang-fa-shiyan
- 计算方法实验：包括高斯迭代和牛顿下山法；1、用Gauss - Seidel 迭代法求解方程组 10x1-x2-2x3=7.2 -x1+10x2-2x3=8.3 -x1-x2=5x3 输入：系数矩阵A，最大迭代次数N，初始向量，误差限e 输出：解向量 2、用牛顿下山法解方程 x*x*x-x*x-1=0（初值为0.6） 输入：初值，误差限，迭代最大次数，下山最大次数 输出：近似根各步下山因子。-Experimental method: includ
BiTree
- 根据二叉树表的表示建立二叉树，实现二叉树的遍历，并给出从根结点到给定结点的路径信息。练习二叉树的链式存储及其遍历方法-According to the table that the establishment of a binary tree binary tree, binary tree traversal implementation, and give from the root node to a given node' s path information. Practice
sqr_root
- This program will calcualte square root of 2 numbers.
root_finding_sample
- root finding sample for mathematic equation
HUFMM
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的径长度（若根结点为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 optimal bina
BasicMotionVectorEstimation
- 运动估计块匹配算法 以下是工程中m文件的简单注释： main.m 可通过主函数调用各种基本的块匹配算法 FullSearch.m 全搜索法（又称为Exhaustive Search） ThreeStepSearch.m 三步搜索法（Three Step Search） NewTSS.m 新三步搜索法（New Three Step Search Algorithm） SESTSS.m 简便高效的三步搜索法（Simple And Efficient TSS）
fenxi
- 用牛顿分析分析方程根的位置，并且用分形算法分析逻辑斯蒂模型。-Analysis of equations with the Newton root position, and the fractal algorithm for logistic model.
UPdownfilter
- 仿真滚降系数为0.22的平方根升余弦滤波器.m-Simulation of roll-off factor of 0.22 square root raised cosine filter. M
code
- 截弦法求三次根 求三次方根的方法有很多 这里面列出来一种-use another math method to solve the 3-root problem， there re lots of methods to solve this kind of problem and this is one of them
huffmam_decoding
- the decoding of Huffman codes is shown. For the decoding the coding tree has to be constructed using the information which has to be transmitted as well. Following that the input is read bitwise and for each 0 a left turn is taken and for each one
class_presentation_Btree
- 是一种多路搜索树（并不是二叉的）： 1.定义任意非叶子结点最多只有M个儿子；且M>2； 2.根结点的儿子数为[2, M]； 3.除根结点以外的非叶子结点的儿子数为[M/2, M]； -Is a multi-way search tree (not binary in): 1. The definition of any non-leaf node at most M son and M> 2 2. The son of the root n
Huffmancode1
- 按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann