计算七类窗函数并给出归一化对数幅频曲线,同时也是利用窗函数法设计FIR滤波器的程序MDEFIR1所调用的子程序MWINDO(Seven kinds of window functions are calculated and normalized logarithmic amplitude-frequency curves are given. At the same time, it is also the subroutine MWINDO called by the program MDEFIR1 of designing FIR filter by using window function method.)
用最小二乘法计算分形图案的维数,试试看怎么样,请多包涵！！(Use the least square method to calculate the dimensions of fractal patterns, try how, please include more!)
用VC编写的01背包问题,功能强大,是在老师的指导下完成的,大家可以用来参考(The 01 knapsack problem written with VC, powerful function, is completed under the guidance of the teacher, we can use for reference)
杜里特尔分解法 c改进平方根法 c拉格朗日插值法 cpp牛顿迭代 cpp梯形法积分 cpp追赶法 c 杜里特尔分解法 c改进平方根法 c拉格(Duretel decomposition method c improved square root method c Lagrange interpolation method cpp Newton iteration cpp trapezoid method integral cpp catch-up method c Duretel decomposition method c improved square root method c Lagrangian method)
关于粒子群算法的c语言程序,可以用于函数优化,极其方便(The C language program of particle swarm optimization algorithm can be used for function optimization, which is extremely convenient.)
一个介绍最优化方法课件,很详细,从最简单的一维搜索到共轭梯度,最速下降法等等,都有说明(An introduction to the optimization method courseware, very detailed, from the simplest one-dimensional search to conjugate gradient, the steepest descent method, etc.)
超长整形数据计算程序,达到128位,同时计算速度进行了优化(The calculation program of super-long shaping data reaches 128 bits, and the calculation speed is optimized at the same time.)
同时辨识模型阶次和参数算法,用模型计算出仿真数据,再用模型阶次的辨识方法,辨识模型的阶次和参数()
Hadoop 的运行方式是由配置文件决定的（运行 Hadoop 时会读取配置文件），此外，伪分布式虽然只需要配置 fs.defaultFS 和 dfs.replication 就可以运行（官方教程如此）。(The mode of running Hadoop is determined by the configuration file (the configuration file is read when running Hadoop). In addition, the pseudo distributed can run only by configuring fs.defaultFS and dfs.replication (the official tutorial is the case).)
追敢法,主要是n阶线形方程组Ax b的列主元高斯消去法的一个特殊情况,为上三角矩阵,通用程序如附件所示()
本站资源：696518 个
本站会员：104292 个
总计下载：494234 次
今日上传：0 个
Copyright© 2019-2024 |
Powered by Imdn
|
浙ICP备16007336号
|
|
联系客服（QQ：3324461878）
本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！
