mciduoxiangshinihe

用C++编的一些最优化作业中的程序,有Newton法,DFP法,共轭梯度法,单纯形法,内点法,外点法,内外点法,都能使用,我已经全部调试过了(C compile some of the most optimized operating procedures, Newton, DFP, conjugate gradient method, the simplex method, interior point method, the points outside the law, outside point method can use, I have all over Debugging)

基于TMS320LF2407的FFT算法的实现及应用(TMS320LF2407 of the FFT algorithm based on Implementation and Application of)

打靶法求解两点边值问题 实例测试通过，可直接运行，并带有详细代码注释 采用全局收敛的牛顿-拉普森迭代算法求解编制问题 绝对物超所值！(Two-point boundary value problem shooting method)

导线网平差程序，参数约束，通过设定不同的PX达到经典自由网，普通自由网，拟稳平差效果，算例(Wire net adjustment procedures, parameters, constraints, and examples)

高斯-赛德尔迭代法是解线性方程组的常规算法，本文是C语言的高斯-赛德尔计算代码(Gauss-Seidel C program)

说明：  矩阵的转置，相乘及界面的面换稀疏矩阵的三元组相加(Sum of the transpose of the matrix, multiplying, and interfacial surface replacing the sparse matrix triples)

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)

编写求取下述矩阵四叉树四进制M码和十进制码程序，并将运算结果返回。 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 4, 4, 5, 5, 1, 1, 1, 1, 4, 4, 5, 5, 6, 6, 7, 8,13,13,14,14, 6, 6, 9,10,13,13,14,14, 11,11,12,12,15,16,19,19, 11,11,12,12,17,18,19,19 (Prepared to strike the following matrix quadtree quaternary M code decimal code and procedures, and the operation result returned. 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 4, 4, 5, 5, 1, 1, 1, 1, 4, 4, 5, 5, 6, 6, 7, 8,13,13,14,14, 6, 6, 9,10,13,13,14,14, 11, 11, 12,12,15,16,19,19, 11,11,12,12,17,18,19,19)

本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)

计算地波传输衰减的程序,可以设置高度，大气条件等(Ground wave transmission attenuation calculation program, you can set the height, atmospheric conditions, etc.)