GAtools

贝叶斯matlab程序算法，给出了大量练习数据和实验方法以及结果分析。(Bayesian algorithm matlab procedures are given a great deal of practice data and experimental methods and results analysis.)

Fortran program which can be used to solve linear system

基于多相结构的信道化接收机，一些自适应信号处理的算法，是小学期课程设计的题目。( Channelized receiver based on multi-phase structure, Some adaptive signal processing algorithms, Is the topic of the elementary school stage curriculum design.)

用传输矩阵法计算光栅场，寻找bloch 模(use of the transfer matrix method grating market, find bloch Die)

该程序实现的功能是给定两个整数n和m，0<n< m< 200，你的程序要计算第n个素数到第m个素数之间所有的素数的和，包括第n个素数和第m个素数。(The function of the program implementation is given two integers n and m, 0 < n < m < 200, your program to calculate the NTH prime number between the first m prime and all the prime Numbers, including the NTH prime number and the first m a prime.)

《数值分析方法库 》本书选材内容丰富，包括了当代科学计算过程中涉及的大量内容：求特殊函数值、随机数、排序、最优化、快速傅里叶变换、谱分析、小波变换、统计描述和数据建模、偏微分议程数值解、若乾编码算法和任意精度计算等。本书科学性和实用性统一，不仅对每种算法进行了数学分析和比较，而且根据作者经验对算法给出了评论和建议，并在此基础上提供了用C++语言编写的实用程序。(《Numerical Recipes in C: The Art of Scientific Computing》, The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.)

NACA 4位数 翼型数据的生成 Matlab程序(NACA 4 digit airfoil)

Visual Basic 做的多功能计算器(Multi-function calculator with VB)

说明：  运用固定点算法实现快速的独立成分分析，实现代码为matlab(use of the fixed-point algorithms to achieve rapid Independent Component Analysis, to achieve code-Matlab)

说明：  FFT（Fast Fourier Transformation）是离散傅氏变换（DFT）的快速算法 [1] 。即为快速傅氏变换。它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FFT (Fast Fourier Transform) is a fast algorithm of discrete Fourier Transform (DFT). That is fast Fourier transform. According to the odd, even, imaginary and real characteristics of discrete Fourier transform, the algorithm of discrete Fourier transform is improved.)