Desktop

计算多项流的好程序，简单好用，计算量小。可以较好的模拟二维的两项变化情况(Calculating a number of streams of the program, easy to use, small amount of calculation. Can better simulate the two-dimensional variation)

涡格法进行无人机的设计，升力系数，阻力系数，力矩系数等等，美过圣母大学的设计辅助软件(VLM)

用abaqus单元开发子程序uel生成弹簧单元。(User subroutine VUEL defining a three-dimensional spring element with degrees of freedom ordered in a nonstandard way)

计算大气密度的程序 用于航空宇航研究的基础程序(With the code you can getting the atmosphere denisity along the height)

用追赶法来求解三对角线性方程组，解决数值分析问题，与大家共同学习。并且提供黄金分割法、高斯赛德尔迭代法求解数值分析问题(The catch-up method is used to solve tridiagonal linear equations, to solve numerical analysis problems, and to learn from you. The Golden Section Method and Gauss Seidel Iteration Method are also provided to solve numerical analysis problems.)

//给定整数n，产生所有[2n]上的匹配（matching） //将其视为一个所有块大小均为2的集合分拆 //以a_i表示其第i个元素所在的集合号 //输出格式为 a1 a2 a3 ... //满足 //a_{i+1} <= max { a1,a2,...a_i } + 1 (//a given integer n, have all [2n] on the matching (matching)// will be considered as an all pieces are two sets of a split// a_i said in its i elements of a collection of lies// output format for a1 a2 a3 ...// meet// a_ i (a))

说明：  使用分布傅立叶法计算非线性薛定谔方程。可以得到光纤非线性传输特性。(Fourier method using the distribution of nonlinear Schr枚dinger equation. Can be non-linear optical transmission characteristics.)

齿轮传动参数测定和公法线公差计算，变位直齿圆柱齿轮参数测定(Determination and the normal line of the gear transmission parameter tolerances calculation)

音频信号通过LM386放大，计算两个矩阵之间的欧氏距离，电力系统暂态稳定程序，可以进行暂态稳定计算。( LM386 audio signal amplification, Calculation of the Euclidean distance between the two matrices, Power System Transient Stability Program, can be transient stability.)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)