algorithms(CPP)

F-K域偏移法和相移法偏移程序（C语言）(FK domain migration method and the phase- shift method migration program (C language))

利用表达式求解和栈的只是，设计一个简易的数学题库， 可供小学生作业，并能给出分数。 要求：建立试题库文件，随机产生 n 个题目；题目涉及加减乘除，带括弧的混合运算；随时可以退出；保留历史分数，能回顾历史，给出与历史分数比较后的评价。(Use solving expressions and stack just design a simple math exam, students for the job, and can give a score. Requirements: Create test file, randomly generating n topics topics involving addition, subtraction with parentheses mixing operation ready to quit keep historical scores, can look back at history, and history is given uation scores after comparison.)

一个通用的CFD求解器，代码结构清楚，简洁，适用于开发自己的CFD程序。(A general of CFD solver, the code structure is clear, concise, applicable to the development of the CFD program.)

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

任意数学表达式计算的源码及测试软件 (Calculation of arbitrary mathematical expression of the source code and test software)

欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数(you you you you you you you you you you you you you you you you my )

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

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)

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

解线性方程组的迭代法 雅可比迭代、高斯—赛德尔迭代、超松弛迭代法 (Solving linear equations iterative method Jacobi iteration, Gauss- Seidel iteration SOR method)