lagrange interpolation

猴子吃桃的问题： 此程序是用递归做出来的，方法很简单-monkeys eat a peach : This procedure is done using the recursive method is very simple

IM开发该算法进行人脸检测蟒蛇，只有25行，这样是非常简单而有效。希望你喜欢它

数学计算lisp程序，CAD平台均可使用。-Mathematical calculations lisp procedures, CAD platform can be used.

使用结点分析法求解直流电阻电路，并将结果保存在txt格式的文档中-The use of node analysis method to solve the DC resistance circuit, and the results saved in txt format document

一种好的改进遗传算法function [opy,optimy]=GA(pt,gennum,psize)% 输入参数：% pt       m*n的加工时间矩阵（n是工件数目，m是机器数目）由已知给的T矩阵，可得n=100,m=10% gennum   迭代的次数（代数）% psize    种群的规模大小%输出参数：% opy       最优的Makespan值pc=0.9;%交叉因子pm=0.1;%变异因子[m,n]=size(pt);current_gen=1;%current_gen means the current generationnewgen=zeros(psize,n+1); %mewgen is the new generation of the populationnewgen(1:psize,1:n)=rand(psize,n);%主种群初始化，0-1之间的随机数 %Generalize the initial groupfather=zeros(2,n); %father is used to store the two genes for crossover and mutation avgen=zeros(1,gennum); %avgen is the matrix of the average of all the generationsoptimx=zeros(1,n);optimy=ones(1,gennum);%Generalize the initial groupfor i=1:psize    [Ya,pop(i,1:n)]=sort(newgen(i,1:n));%种群排序，实数编码转换为自然数编码 随机生成的0-1之间的小数进行排序然后取每个从小到大数对应的位置    newg

fft algorith and the c++ code

完整的数值模拟软件，可以实现高次插值的Sin现象，三次分段埃米尔插值，Gauss赛德尔迭代法等多种算法-A complete numerical simulation software, can realize high interpolation Sin phenomenon, three sub-Emir Interpolation, Gauss Seidel iteration algorithm, etc.

这是一个单片机实用子程序集，有丰富的实用定点数计算，浮点数计算，及控制类子程序！适合单片机开发者参考工具。 该代码执行效率高，通过编译。-This is a single-chip utility subroutine sets, has a wealth of practical fixed-point computing, floating-point calculation, and control of type subroutine! Suitable for single-chip reference tool for developers. Efficient implementation of the code through the compiler.

记不清楚了，应该是贪吃蛇的游戏，大家看看，或许有用！谢谢了！-Can not remember exactly what, and should be the Snake game, let us look at might be useful! Thank you!

Gryphon is a Java-based computational fluid dynamics code written to solve the quasi 1-D Euler equations.