禁忌算法 C++

说明：  四级四阶龙格库塔格式，求解微分方程的好算法。(Four fourth-order Runge-Kutta format, a good algorithm for solving differential equations.)

最新版的oofem 可以自己加入一些材料模型 版本更新速度也算快(latest version of oofem )

用VBA在Excel里实现分级计算，实现通过年终奖和月收入计算个人所得税的功能。数据为2012年最新的标准，对于会计电算化人员有非常强的实用性。(VBA in Excel to achieve grade calculated to achieve the functionality of the calculation of personal income tax through the end of the year Award and the monthly income. The data for 2012 the latest standards, computerized accounting personnel have a very strong practicability.)

严格的衍射积分计算，实现光栅结构透过反射场2维分布的严格解计算，利用散射积分对耦合模方程进行严格计算解 衍射，光栅，场，二维，积分，散射矩阵，耦合模理论(Strict calculation of the diffraction integral, the grating structure is realized through the rigorous solution of the 2 dimensional distribution of the reflection field. Diffraction, grating, field, two-dimensional, integral, scattering matrix, coupled mode theory)

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

基于改进的广义S变换，能更好的对数据进行时频分析。(Modified S-transform and its application in data analysis)

利用表达式求解和栈的只是，设计一个简易的数学题库， 可供小学生作业，并能给出分数。 要求：建立试题库文件，随机产生 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.)

在visual studio的平台上开发CUDA程序实现并行加速计算矩阵的乘积，同时比较与串行计算的差异(Differences in the development of procedures to achieve parallel CUDA accelerated computing matrices in visual studio platform, but compared with the serial computing)

c++的有限元源码,带说明书和测试数据,是难得的有限元开发资料.(This is the code of finite element method, with manual document and data samples, it is valusble for FEM development)

若矩阵A中的某一元素A[i，j]是第i行中的最小值，而又是第j列中的最大值，则称A[i，j]为矩阵A中的一个鞍点。请写出一个可确定此鞍点位置的算法（如果这个鞍点存在）。(If the matrix A, an element A [i, j] is the minimum value in the i-th row, but is the maximum value of the j-th column, then A [i, j] for the matrix A is a saddle point. Please write a algorithm to determine the position of saddle point (saddle point exists).)