niudunfa

一维等离子体的plrc—fdtd算法程序(one-dimensional plasma plrc- fdtd Algorithm)

fdtd的2d算法，pml边界条件，二维TE波(fdtd the 2d algorithm, pml boundary conditions, 2D TE wave)

说明：  你输入一个长方体的长和宽以及高，就可以输出他的面积(input height，width，length，output volume)

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)

基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)

利用表达式求解和栈的只是，设计一个简易的数学题库， 可供小学生作业，并能给出分数。 要求：建立试题库文件，随机产生 n 个题目；题目涉及加减乘除，带括弧的混合运算；随时可以退出；保留历史分数，能回顾历史，给出与历史分数比较后的评价。(Use solving expressions and stack just design a simple math exam, students for the job, and can give a score. Requirements: Create test file, randomly generating n topics topics involving addition, subtraction with parentheses mixing operation ready to quit keep historical scores, can look back at history, and history is given uation scores after comparison.)

c语言程序编写在经验模态分解，包含三次样条(c language programming in the empirical mode decomposition, contains the cubic spline)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

只是一个课堂上做的九九乘法表，可能很多人做过(Just a class to do multiplication table, many people may have done)

MFC做的计算器程序，可以实现加减乘除。平方，立方等功能(MFC to do calculator program can be achieved subtraction multiplication and division. Square, cubic and other functions)