MillerRabin()

说明：  cuda矩阵乘法 通过GPU并行运算实现乘法的加速(cuda GPU parallel matrix multiplication operation by the accelerated realization of multiplication)

说明：  CZT和FFT的C语言实现代码，能有效滤除谐波，噪声。获得信号的频率，是一种良好的频率测量算法。(CZT and FFT of the C language code, can effectively filter out harmonics and noise. Access to the signal frequency, is a good algorithm for frequency measurement.)

矩阵转换问题 行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间，则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )

利用emd算法解决经验模式分解的一些存在的端点效应问题。 有效的解决了问题。(Using emd algorithm to solve some of the empirical mode decomposition end effects exist. Effective solution to the problem.)

排样算法，用于矩阵排样优化，仅供参考，有错误请原谅，( ⊙ o ⊙ )啊！(Nesting algorithms for matrix layout optimization purposes, there is an error, please forgive me, (⊙ o ⊙) ah!)

这是一段杆塔建模的命令流，可用于ansys有限元分析(This is a tower of order flow modeling, finite element analysis can be used to ansys)

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)

用于求解超定方程组最小二乘解，稳定性高，速度快(To get the least square solution of superlattice dislocation.)

说明：  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)

基于混沌理论进行数据预测的程序，欢欢迎需要的朋友参考下载，并提出修改意见 (, Please feel welcome the reference to a friend download data to predict the process based on chaos theory, and suggest modifications)