雅可比迭代算法

包含所有矩阵运算的头文件，可以应用在所有需要矩阵运算的VC程序中，-matrix calculation includes all the header files and can be applied to all the needs of the VC matrix calculation procedures,

用FIR设计数字滤波器的实验代码，附有详细的实验说明和源代码以及对实验现象的分析-FIR digital filter design using the experimental code, with detailed experimental descriptions and source code as well as the analysis of experimental phenomena

用来求解非线性系统中分岔,混沌,周期,准周期等动力学,可以求数值解,也可画图,只要知道系统模型,可以根据需要自由修改参数,软件带有使用说明,简单易懂-Used to solve nonlinear systems in the bifurcation, chaos, periodic, quasi-periodic dynamics, etc., you can seek numerical solutions, but also drawing, as long as know the system model, you can freely modify the parameters as needed, the software with instructions for use, simple and easy to understand

二叉树的算法，先序建立，中序遍历-binary tree algorithm, first sequence established, the preorder

利用线形组合法，生成随机数，附加随机数检验功能-Using linear combination method to generate random numbers, an additional random number test function

袁亚湘与孙文渝合写的《最优化理论与算法》，个人认为本书非常经典。-Good Book!

约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.

-$A8 -$B- -$C+ -$D+ -$E- -$F- -$G+ -$H+ -$I+ -$J- -$K- -$L+ -$M- -$N+ -$O+ -$P+ -$Q- -$R- -$S-

基于marc的模拟磨损的二次开发，marc虽然提供了几种磨损类型但是并不能满足实际需要，本程序由fortran写成，可以写出满足生产实际的磨损模型。

以优化SVM参数c和g为例，对FA（萤火虫算法）MATLAB源码进行了详细中文注解，是很好的学习材料。