KIVA 3V的入门介绍

美国牛人编写的以平面框架结构为基础的桥梁设计与校核软件，fortran90格式，已经调通，完全可以运行。(U.S. cattle were written in a flat frame-based bridge design and calibration software, fortran90 format, has been transferred through, can run.)

Finit element magnet method (FEMM) software

改进的GM（1，1）程序，可实现时间序列的灰色等维新息预测，采用弃旧纳新的原则。(The improved GM (1, 1) program, can realize the time series prediction using grey information renewal, discarding the old and new principles.)

矩量法仿真电磁辐射和散射的源代码（c++） (Moment Method Simulation of electromagnetic radiation and scattering of the source code (c++))

说明：  数值分析 显示算法 非线弹性 滞回曲线(Numerical analysis showed that the algorithm the linear elastic hysteresis curve)

编写一个使用KMP算法的字符串匹配程序。 使用方法：字符串匹配.exe -f xxx.txt -s xxx -f 指定要查找的文件 -s 指定要查找的字符串(Writing a string matching algorithm using KMP program. How to use: string matching exe-f xxx.txt-s xxx-f to specify the file you want to find-s to specify the search string)

系统仿真导论第一个实验程序，龙格库塔实验程序(Introduction The first experimental system simulation program, Runge-Kutta experimental procedures)

3．1 线性方程组类设计 3．2 全选主元高斯消去法 3．3 全选主元高斯-约当消去法 3．4 复系数方程组的全选主元高斯消去法 3．5 复系数方程组的全选主元高斯-约当消去法 3．6 求解三对角线方程组的追赶法 3．7 一般带型方程组的求解 3．8 求解对称方程组的分解法 3．9 求解对称正定方程组的平方根法 3．10 求解大型稀疏方程组的全选主元高斯-约当消去法 3．11 求解托伯利兹方程组的列文逊方法 3．12 高斯-赛德尔迭代法 3．13 求解对称正定方程组的共轭梯度法 3．14 求解线性最小二乘问题的豪斯荷尔德变换法 3．15 求解线性最小二乘问题的广义逆法 3．16 病态方程组的求解 (3.1 system of linear equations class designs 3.2 to choose the principal element gaussian elimination 3.3 to elect principal element Gauss- when approximately the elimination 3.4 duplicate coefficient equation sets all choose the principal element gaussian elimination 3.5 duplicate coefficient equation sets to elect principal element Gauss- when approximately the elimination 3.6 solve three diagonal line equation sets to pursue the law 3.7 common belt equation set s solution 3.8 solution symmetrical equation set s resolution 3.9 solution symmetrical Zhengding equation set s square root method 3.10 solution large-scale sparse equation set to elect principal element Gauss- when approximately the elimination 3.11 solutions hold the Belize equation set s row article to abdicate House Holland who method 3.12 Gauss- the Seydell repetitive process 3.13 solution symmetrical Zhengding equation set s conjugate gradient method 3.14 solution linearity is smallest two rides the questionThe German m)

经典矩阵运算问题求解(classic problem solving matrix operations)

gmres 方法。视图求解线性方程组A*x=b的解x。nXn的稀疏矩阵A必须是方程且应是大型稀疏矩阵。列向量b的长度必须为n。(gmres method. View solving linear equations A* x = b the solution x. nXn sparse matrix A must be equation and should be large sparse matrix. The length of the column vector b must be to n.)