搜索资源列表
tp_sinosoidal_triangular_carrier_regular_asymmetr
- matlab simulation sinus sinosoidal_triangular_carrier_regular_asymmetrica Graphical Interface Num Root Inports Num Root Outports-matlab simulation sinus sinosoidal_triangular_carrier_regular_asymmetrica Graphical Interface Num Roo
diedaifa
- // 编程序 用迭代法求a的立方根,求立方根的迭代公式为 ::Xi+1=（2*Xi）/3+a/(3*Xi*Xi) 假定X的初值为a,迭代到|Xi+1-Xi|<10的-5次方为止. 显示a=3,27的值,并通过调用pow(a,1.0/3)函数加以验证.。-//Compile a program with Iteration Method and the cube root, find the cube root of the iteration formula is:: Xi+1 = (2*
LDL
- 计算方法中的LDL分解。平方根分解。用VB编程。分解实对称矩阵-Calculation of LDL decomposition. Square Root. With VB programming. Decomposition of real symmetric matrices
assign5
- 利用heap实现三叉树的组建，插入，排序。 分析推导 算法的时间复杂度。 - create a max heap class that is based on a complete ternary tree. As with a complete binary tree max heap, the largest value is at the root and the root is at location 1 in the vector holding the heap. L
Tree_Missoum
- In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Ou
MatlabFiles
- This folder or any similar folder such as this created to hold your speech files, should be copied into the root folder C:\ , created on the local hard drive. Then the path will read thus C:\SpeechData\Tope... etc. An alternative is to modify the fil
StructureandMotionPipline
- The images are organized into a tree with agglomerative clustering, using a measure of overlap as the distance. The reconstruction then follows this tree from the leaves to the root. As a result, the problems is broken into smaller instances, which a
PiCalculator
- 这个算法是平方收敛的（每次迭代有效位数增加一倍）， 这样要求到Q位有效数字，就至少要log2Q+1次迭代 显然，这种计算是要高精度表示的， 我所用的算法就是普通的高精度加减乘除 加减是O(n)的，时间花费很少。 乘除是O(n2)的，主要的时间花费都在这上面。 而由这个算法中可以看到，bn的计算需要开根号。 这里有两种开根号的办法： ①用初中教我们的方法，每次开两位根号，用除法减掉， 这样所需时间为n2·n/2=O(n3),不可忍受！ ②用牛顿迭
qpskzjm
- matlab实现矩形脉冲和根升余弦脉冲的QPSK调制功率谱密度及不同信噪比信道下的星座图，直接运行main函数即可-Plot the power density spectrum of the transmitted signal (e.g., with the matlab function psd) with different pulse shapes. How is it affected if a root raised cosine pulse is chosen instead o
taylor
- 用泰勒定理求根，根的范围在区间[0,1]之间 数值计算方法-Taylor' s Theorem with the Roots, the scope of the root in the interval [0,1] between the numerical method
x
- 一元二次求根,能根据出入求出一元二次方程的根-Quadratic root finding according to the access to the root of a quadratic equation obtained
ChiLunJiSuan
- 这是一个关于齿轮的齿顶圆和齿根圆半径的计算程序，先将图片预处理和二值化，然后进行边缘检测求出圆心，最后用平均法求出半径。-This is an addendum on the gear tooth root radius circle and the calculation procedure, the first image preprocessing and binarization, edge detection and then find the center of a circle,
LECalculator
- 3．1 线性方程组类设计 3．2 全选主元高斯消去法 3．3 全选主元高斯-约当消去法 3．4 复系数方程组的全选主元高斯消去法 3．5 复系数方程组的全选主元高斯-约当消去法 3．6 求解三对角线方程组的追赶法 3．7 一般带型方程组的求解 3．8 求解对称方程组的分解法 3．9 求解对称正定方程组的平方根法 3．10 求解大型稀疏方程组的全选主元高斯-约当消去法 3．11 求解托伯利兹方程组的列文逊方法 3．12 高斯-赛德尔
1
- 数值分析，迭代格式的比较的实验。 包含程序运行及流程图 线性方程组的直接算法 线性方程组的迭代法-Numerical analysis, iterative comparison of the experimental format. Let equation f (x) = x- 3x-1 = 0 has three real roots x = 1.8793, x =- 0.34727, x =- 1.53209 is calculated using the following
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
bessel
- bessel函数求根，求解bessel函数的前20个根-root of bessel
Work
- VC老师安排的家庭作业，判断一元二次方程是否有实根，若有输出根的值，基于Dialog编制。-VC teacher homework arrangements to determine whether a quadratic equation has real roots, if the output value of the root, based on Dialog establishment.
gaijin
- 这个程序是用改进平方根法对线性方程组进行求解，要求系数矩阵必须是对称正定矩阵-This procedure is used to improve the square root method to solve linear equations, requiring the coefficient matrix must be symmetric positive definite matrix
NDM
- Newton下山法的计算程序，通过它可以求解复杂函数的根-Newton downhill method the computer program, through which can solve the root of complex functions
NMSPR
- Newton法求特定方程的最小正根的计算程序-Newton Method particular the least positive root of equation calculation program