搜索资源列表
Newton
- 本程序是用牛顿迭代法求解方程f(x)=x^3-x^2-1的一个实根的C语言实现-This procedure is used Newton iteration method for solving equations f (x) = x ^ 3-x ^ 2-1 a real root of the C language
ssd
- 竹子地下茎根的计算机仿真 Bamboo rhizome root computer simulation-Bamboo rhizome root computer simulation
sqrc.m
- 平方根升余弦脉冲实例。两个SQRC滤波器的级联组合就成为一个零ISI的滤波器。此程序用于获得平方根升余弦脉冲。-Square root raised cosine pulse instance. Cascade combination of the two SQRC filters to filter a zero ISI. This procedure used to obtain the square root raised cosine pulse.
akar-persamaan
- This a simple program for find root of quadratic equation-This is a simple program for find root of quadratic equation
DFS
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
BFS
- In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds
MUSIC_qrfenjie
- 基于QR分解的求根MUSIC的被动定位方法-ROOT MUSIC LOCALIZATION BASED ON QR
nonlinear-equation
- 非线性方程求解 简单的求解非线性方程根的程序-Simple linear equation the procedure for solving nonlinear equation root
multroot
- multiroot funciton with matlab -ltRoot: the root-finding package TestSuit: the test suit of polynomials
matrix-tezhengzhijisuan
- 通过求矩阵特征多项式的根来求其特征值 幂法求矩阵的主特征值及主特征向量 瑞利商加速幂法求对称矩阵的主特征值及主特征向量 收缩法求矩阵全部特征值 收缩法求矩阵全部特征值 位移逆幂法求矩阵离某个常数最近的特征值及其对应的特征向量 QR基本算法求矩阵全部特征值 -Characteristic polynomial by the root of a matrix to find the eigenvalues of a matrix power m
tuxiangyasuo
- 利用Matalab软件分别编写子函数实现数字图像压缩及解压缩处理,并统计分析压缩处理算法所能够实现的压缩比及解压图像和原始图像间的均方根误差。-Functions were written by Matalab software for digital image compression and decompression processing, and statistical analysis of compression algorithms to achieve the compressi
trees
- 二叉树也是递归定义的,其结点有左右子树之分,逻辑上二叉树有五种基本形态: (1)空二叉树——(a); (2)只有一个根结点的二叉树——(b); (3)右子树为空的二叉树——(c); (4)左子树为空的二叉树——(d); (5)完全二叉树——(e)注意:尽管二叉树与树有许多相似之处,但二叉树不是树的特殊情形。 -Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five ba
jisuanqi
- 模拟计算器,基本实现了加减乘除开方等功能-Analog calculator, the basic realization of the addition, subtraction and square root functions
wh
- 基于VC6.0 MFC开发的一元二次方程的解答。 可以解答任意一元二次方程的根,并汇出抛物线图,对于MFC初学者有很大作用。-Developed based on VC6.0 MFC answers a quadratic equation. Can answer any of the root of a quadratic equation, and export the parabolic map, plays a significant role for MFC beginners.
huisufa
- 回溯法是一个既带有系统性又带有跳跃性的搜索算法,它在问题的解空间树中按深度优先策略,从根节点出发搜索解空间树。回溯法求问题的所有解时,要回溯到根,且根节点的所有子树都已被搜索遍才结束。回溯法求问题的一个解时,只要搜索到问题的一个解就可以结束。使用回溯法解决n皇后问题时,用完全二叉树表示解空间,用n元组x[1:n]表示,其中x[i]表示皇后i放在棋盘的第i行的第x[i]列,根据规则任何2个皇后不放在同一行或同一列或同一斜线上,则可以得到等式关系,由此可以进行解决问题。-Backtracking
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
ACAC2000
- square root of a real number
binary-tree
- 二叉树也是递归定义的,其结点有左右子树之分,逻辑上二叉树有五种基本形态: (1)空二叉树——(a); (2)只有一个根结点的二叉树——(b); (3)右子树为空的二叉树——(c); (4)左子树为空的二叉树——(d); (5)完全二叉树——(e)注意:尽管二叉树与树有许多相似之处,但二叉树不是树的特殊情形-Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic
jisuanqi
- 计算器,计算一般运算,加减乘除,开方,三角运算等-Calculator, for general operations, addition, subtraction, square root, trigonometric equations, etc.
Numerical-Analysis
- 数值分析: lagrange插值与三次样条插值 simpson复化积分和两点高斯复化积分 四阶龙格—库塔解微分方程 牛顿下山法求解方程的根 列主元消去法求解线性方程组的根 -Numerical Analysis: lagrange interpolation and cubic spline interpolation simpson recovery of complex points and two points of the Gaussian integral Ru