Workshop7

该软件主要应用是采用高斯正反算进行换带计算的。(The software application is used mainly Gaussian with positive and negative exchange balance calculation.)

高斯消元法、高斯列主元消元法解线性方程组。程序由本人独立完全独立完成。版权所有！(Gaussian elimination method out PCA Gaussian elimination method for solving linear equations. I am independent program consists entirely independently. All rights reserved!)

适用于大型稀疏矩阵 矩阵转置 c语言 来自于有限元方法编程(From the finite element method suitable for large-scale sparse matrix matrix transpose c language programming)

糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢(Mr. foolish to write him five friends, he wrote five letters, but when his friend received a letter, told him: )

fft code in visual c++

共轭梯度法求解凸二次规划，代码由C语言开发，老外编写的程序，很值得一读。(Conjugate gradient method for solving convex quadratic programming, code generated by C language development, foreigners prepared program, it is worth reading.)

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

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

自己写了一个二维Euler方程的间断有限元程序 上次发了一个三角形单元的程序 因为不是曲边单元 所以在圆柱后面容易形成涡 现在把程序改为曲边四边形单元了 没有涡出现 单元是8节点四边形单元 节点编号顺序是 1 5 2 6 3 7 4 8 也就是四个角点依次 是1 2 3 4 然后是边的中点编号 5 6 7 8. 时间推进采用 Runge-Kutta 方法 数值通量采用全局Lax-Friedrichs通量 仍然不能捕捉激波 因为没有做重构或者加人工粘性 等这个做出来了 再发一次。 程序没有进行优化 比如说内存的消耗没有优化 比如直边单元的边界积分仍然采 用了曲边的积分方法 增加了计算量 比如面积分、线积分都是采用的是Gauss- Legendre-Lobatto积分 积分精度会比一般的Gauss-Legendre积分精度低一阶 等 等问题。 二维的 纯属交流性质 就没有考虑这些问题 ^_^ 如果物面全部是直边 那么只要改变一个参数N 就可以获得不同的计算精度 且具 有谱精度 因为单元的节点是Gauss-Legendre-Lobatto积分点。 其实就是谱元法 （物面是曲边的情况我不清楚是不是也可以通过提高基函数的阶数 也就是增加N 来提高计算精度）(Wrote a two-dimensional Euler equations with discontinuous finite element program Last made ​ ​ a triangular element of the program, not curved edge unit is so easy to form a vortex in the cylinder behind the Program to curved edge quadrilateral element vortices appear Unit is the order of 8-node quadrilateral element node number is 15,263,748 which is the four corners of the points in turn Is 1234 and then the side of the midpoint of the number 5678. Time promote the use of Runge-Kutta method Numerical flux of the overall situation of Lax-Friedrichs, flux Still can not capture the shock wave did not do the reconstruction or artificial viscosity do it Zaifayici. The program is not optimized for example, memory consumption is not optimized such as straight-edge boundary integral of the unit is still mining Integral method to increase the amount of computation such as surface integral with a curved edge, the line integral using the Gauss- The Legendr)

c++算法源代码，主要是POJ上面的算法，根据标号可以找到。(c++ algorithm source code, POJ above algorithm, based on the label can be found.)