static_jiecheng

说明：  VC实现，天文导航算法及实现 包括数据的获取、加工、处理、保存为文件(VC, astronomy, navigation algorithm and implementation including data acquisition, processing, handling, preservation of documents)

Fortran 95程序设计【彭国伦】第7章原代码，非常有学习价值！(Fortran 95 programming [Lun Peng-- Chapter 7 of the original code, the very value of learning!)

采用数值分析课程中的插值逼近以及曲面拟合方法来估算复杂的函数表达式。(Interpolation approximations and surface fitting methods are used in the numerical analysis course to estimate complex function expressions.)

说明：  给定四个数（1--13），判经过四则运算后能否得到结果24，若能，输出表达式。 (Given the number four (1- 13), after sub after four computing results can be 24, if the output expression.)

巨正则系综蒙特卡罗算法的源程序；可以用来进行吸附等分子模拟；最大的好处在于可以插入或删除原子(Grand canonical ensemble Monte Carlo algorithm source can be used for adsorption, molecular simulation biggest advantage is that you can insert or delete atom)

说明：  计算潜在蒸发，方法为彭曼法，需要气温、日照、风速等资料，具体详见程序界面(Pe calculation)

三次样条插值c++头文件，一些头文件，非常好(Cubic spline interpolation c++ header files, some header files)

很好用的单导线平差，具有单线的计算能力 可以已知两点或者方位角开始计算(Very good adjustment with a single wire, with one-way computing power can be known to start two or azimuth)

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