remember

vc++实现编译原理中的LL(1)文法的编译过程,非常好用.(vc realization of the principle of compiler LL (1) grammar compiler course, very handy.)

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

数值分析中用C 语言验证验证Gauss列主元消去法。(Numerical analysis using the C language to verify verify the Gauss column principal component elimination.)

自己写了一个二维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)

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)

平常练习的一些程序，比较基础，包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)

用刷选法求出100之内的素数。并输出数有多少个。(100 prime number is calculated by the method of selection. And the output count how many.)

交错网格声波方程交错网格有限差分地震波场计算波场正演模拟。 (The CalCulation of the SeismiC Wave一 fieldwith Staggered-grid Finite difference Sheme )

说明：  算法设计第三版，算法设计第三版，算法设计第三版，算法设计第三版(Algorithm Design Third Edition)

测绘程序，计算测边网各点坐标的评查程序，值得借鉴(Mapping program to calculate the coordinates of each point measured the side-netting of assessment investigative procedures, worth learning)