- HSB2RGBandRGB2HSB 颜色表示方法的相互转换
- chap5 刘金琨老师 《先进PID与Matlab仿真》（第二版） 给予遗传算法整定的PID
- GENVARgai 学习键盘程序
- 23-algorithm-of-Modeling 数学建模中经常用到的23个经典算法
- LCD1602 PIC32单片机显示驱动程序
- slau213a The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT. A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way
文件名称:CALCU.ZIP
介绍说明－－下载内容来自于网络，使用问题请自行百度
数值分析中的常用方法,包括解方程,列主元高斯消去法解方程组,最小二乘拟合,插值,数值积分等,通过调试,全部可用.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
CALCU.C
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.