celluar-automata2012

编制了theta映射法的ansys蠕变子程序(a creep subroutine of ansys that considered the theta-projection method)

可实现OFDM电力载波通信的前导序列检测，能进行连续多个前导检测(Can achieve OFDM power carrier communication leading sequence detection, can carry out a number of continuous preamble detection)

说明：  支持向量机中的支持向量回归函数对数据进行预测(Support Vector Regression Function in Support Vector Machine to Predict Data)

this source code is use to calculate resister capacitor and inductor

c++算法源代码，主要是POJ上面的算法，根据标号可以找到。(c++ algorithm source code, POJ above algorithm, based on the label can be found.)

Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)

四阶龙格库塔法 数值计算 C++源码 可直接运行(Fourth-order Runge-Kutta numerical method C++ source code can be run directly)

牛顿插值算法，利用数组存储均差表，一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )

FFT DIF 分裂基的C语言代码，比较好的说明了整个流程(FFT DIF split the base of the C language code, better explains the entire process)

LDL分解法，用于求解大型的线性方程组。此程序中最多能解100维的，速度还不错(LDL decomposition method for solving large-scale linear equations. This procedure can be up to 100 peacekeepers solutions, speed is not bad.)