线性方程迭代法，下载的顶一下哦

DG method for transport equations

***

这几天学VC界面编程，在VC在线上狂看教程，觉得有所长进，于是把以前的Java代码用VC改写了一下。问题还是那个老掉牙的问题，八皇后问题，老归老，但我很喜欢-VC these days learn programming interface, the VC frenzy see online tutorial, some feel that complacency. So, before the Java code with VC rewritten a bit. Problems or those long-standing problems, 8 Queen"s problems and old to the old, but I like

研究生期间上《数值计算方法》课的作业，所有代码都是C语言实现并调试通过，现在上传为大家服务。这是带权算法-This is the assignment of numerical analysis course during my graduated education,all the codes are realized by C language,and have been debugged successfully,here I d like to share it with all of you.This one realized the algorithm of weighting

不同版本的ＶＯＦ程序　《运动界面追踪数值模拟方法》-Different VOF programs, thet are abtained from the book by Liu Ru Xun.

科学与工程数值计算算法（Visual Basic版）一书的源代码。对科学研究者自己开发领域内计算程序极具参考价值。-science and engineering numerical algorithm (Visual Basic version) a book source. Scientific researchers to develop its own procedures for calculating the area of great reference value.

一个较完备的HugeNumber类，实现了加减乘除及乘方，阶乘的功能，精确度可以随意调整。-A more comprehensive category HugeNumber achieved and involution Math

石油勘探专业算法，地震资料波阻抗反演前期准备，及三维或者二维初始模型的建立(层位约束插值)-professional algorithm oil exploration, seismic wave impedance inversion preparation, and the initial two-dimensional or three-dimensional model of (layer constrained interpolation)

军团问题， 某国家在一条战线上（一条直线）上部署了n 支军队。如果两支或两支以上军队相邻，它们将形成一个军团。如果一支军队不和任何一支军队相邻，那么它也是一个独立的团。给定一组军队在战线上左右两端的位置及编号，求出所有的军团 -Corps issues, a country in a front (a straight line) on n-support forces deployed. If two or more than two neighboring armies, they will form a regiment. If an army is not adjacent to any one army, then it is also an independent regiment. Given a group of troops on the front left and right ends of the location and number, find all of the Army

PCA，也就是PrincipalComponents Analysis，主成份分析，是个很优秀的算法，其原理是寻找最小均方意义下，最能代表原始数据的投影方法然后自己的说法就是：主要用于特征的降维。另外，这个算法也有一个经典的应用：人脸识别。这里稍微扯一下，无非是把处理好的人脸图片的每一行凑一起作为特征向量，然后用PAC算法降维搞定之。