资源列表
luoxuanjuzhen
- 此包含实验报告，流程图和算法分析，能够循环的排列出数字矩阵-this report contains experiments, the flow charts and analysis of algorithms, in order to cycle out of Digital Matrix
shuangfai
- 计算数值方法的几个源程序,牛顿法,三角法,追赶法等-numerical calculation method of several source files, Newton's method, trigonometry, catching up with the law
guass2
- 用列主元高斯法解用户输入的线性方程组。包含3个文件。-out with PCA Gaussian user input method for the linear equations. Contains three documents.
main-doolittle
- 用选主元的doolittle分解法解用户输入的线性方程组。共4文件。-election with the main yuan doolittle decomposition method for user input linear equations. A total of four documents.
no-doolittle
- 用doolittle分解法（非选主元）解用户输入的线性方程组。若无法解，将提示用选主元的doolittle分解法(见另一上传文件)解方程-with doolittle decomposition (non-elected PCA) user input solutions of linear equations. If there is no solution, the election will be prompted to use the PCA doolittle decompositio
lagrangeNewton
- 用VC实现了拉哥郎日插值和牛顿插值的数值算法 并进行了比较-with VC Barayagwiza a few days interpolation and Newton interpolation algorithm and compared
C-mathcode
- c源码包-c-source package!
2FFT
- DIT-FFT算法子程序 FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT - FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which ke
2FFandIFFT
- 时间抽选基2FFT及IFFT算法C语言实现-time selected radix 2 FFT and IFFT algorithm C Language
DIT-FFTsuanfazichengxu
- DIT-FFT算法子程序 FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT - FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which ke
HJFGF
- 黄金分割法的源代码 用于优化设计 Turbo 2.0 下编译-0.618 method of optimizing the source code for Turbo Design Compiler 2.0
WYSTD2
- 无约束优化算法的源代码 用于优化设计问题 Turbo 2.0下编译-unconstrained optimization algorithm source code for optimal design of Turbo 2.0 compiler