资源列表
beijui
- 包括随机梯度算法，相对梯度算法，esprit算法对有干扰的信号频率进行估计,基于掌纹识别的在线身份验证 识别算法本科毕设。- Including stochastic gradient algorithm, the relative gradient algorithm, esprit algorithm signal frequency interference can be assessed Verify recognition algorithm based on palmprint re
AMG1.1.tar
- 基于代数多重网格的算法实现程序包，里面包含许多m文件，方便理解与应用。-its a matlab program about AMG,there are many m file inside.very helpful!
Solving-greatest-common-divisor
- 输入两个正整数m和n，求其最大公约数和最小公倍数。-Solving greatest common divisor and Least common multiple
decompose-the-Positive
- 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-decompose the Positive
derivation
- 使用用C语言实现函数在某点的求导运算，欢迎下载-Using C language implementation function derivation operation at some point, welcome to download the study
fangbang
- 使用拉亚普诺夫指数的公式，包括数据分析、绘图等等,有PMUSIC 校正前和校正后的比较。- Raya Punuo Fu index using the formula, Data analysis, plotting, etc., A relatively before correction and after correction PMUSIC.
bengmang
- 包括轨道机动仿真、初轨计算,使用拉亚普诺夫指数的公式，混沌的判断指标Lyapunov指数计算。- Including orbital maneuvering simulation, initial orbit calculation, Raya Punuo Fu index using the formula, Chaos indicator for Lyapunov index calculation.
lab2
- 计算方法实验 langrange插值法的c实现-Calculation experiment langrange interpolation c implementation
main.cpp
- (1) 编写用Newton迭代和弦截法解非线性方程的通用程序-1) write a general procedure for solving nonlinear equations by using the Newton iterative chord intercept method
main.cpp
- (1) 编写用复化梯形积分公式和复化Simpson积分求积分的通用程序-(1) a general procedure for the preparation of the integral formula of the complex trapezoidal integral and the integral of the complex Simpson
PB13011092-02.cpp
- 计算Lagrange插值函数LN (x),并用如下式子近似计算最大模误差:max{∥f (yj ) − LN (yj )∥, j = 0, 1, 2, · · · , 500} 其中,yj = − 5 + 10/500 ∗ j,j = 0,1,2,··· ,500。-Calculation of Lagrange interpolation function ln (x), and use the following formula approximate calc
main.cpp
- 计算级数,取x为0.0, 0.5, 1.0, √2, 10.0, 100.0, 300.0。 思考:要求误差在10− 6内,如何确定要计算的k的上界?-Calculate the series,Thinking: error in the 10 and 6 requirements, how to determine the upper bound to the calculation of the K?