GEAR

利用emd算法解决经验模式分解的一些存在的端点效应问题。 有效的解决了问题。(Using emd algorithm to solve some of the empirical mode decomposition end effects exist. Effective solution to the problem.)

四阶龙格库塔法 数值计算 C++源码 可直接运行(Fourth-order Runge-Kutta numerical method C++ source code can be run directly)

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

利用abaqus软件建模，然后将inp文件导入flac软件中。(ABAQUS software is used to model, and then the InP file is imported into the FLAC software.)

This file contains a summary of what you will find in each of the files that make up your GPKolmogorov application.

基于Wegstein方法的求解方程的C++程序。(Wegstein-based method for solving equations C++ program.)

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)

划分网格一个开源的库，有限元的算法，很好用(Meshing an open source library = for finite element)

计算机常用数值算法与程序(C++版) (Commonly used numerical algorithm of computer and program )

流体力学SIMPLE算法（C语言编程实现）需自己设定边界条件(SIMPLE algorithm)