模拟波动方程的有限元程序 FEM

在VS2005环境下，使用CUDA编程实现SAR成像中CSA算法的实现，得到了很好的加速比。(In the VS2005 environment, using the CUDA programming SAR imaging algorithm implementation in the CSA, has been very good speedup.)

DFP法求优化问题的C++源代码，经测试，该程序运行正常，得到了预期的结果。(DFP method for the optimization of C++ source code, tested, the program works correctly to get the desired results.)

响应面方法的一个例子，二阶响应面，使用正交矩阵法求解(rsm algorithms )

用于求解线性方程组的追赶法！！！程序经过优化处理，运行速度快，且注释完全易于阅读，欢迎大家下载！！(Solving linear equations for the law to catch up! ! ! Optimized procedures to deal with, fast, and completely easy-to-read notes, welcome you to download! !)

说明：  实现基2时域频域抽取fft算法，可输出运算后所得复序列的模值序列，并可记录显示计算所用时间(Achieve base 2 fft algorithm frequency domain extraction can be obtained after computing the output sequence of modulus of complex sequences can be used in the calculation time, records show)

用C＋＋实现的高斯混合模型的算法类，方差矩阵是对角矩阵(C++ Gaussian mixture model algorithm category, variance matrix is diagonal matrix)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)

利用ARIMA处理分析时间序列，计算数列相关性和数字特征并通过计算所得值进行一定范围的预测(ARIMA processing analysis time sequence, to calculate a number of columns and digital characterized by the calculated value for a certain range of the prediction)

Dot Matrix 5 x 7 sample progmam , hope you enjoy

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))