BootStrap

非常好的matlab代码，欢迎下载分享学习！！！(this is a very good！！！！！！！！！)

该论文介绍了电磁场积分方程的无网格数值计算方法，传统的体积分数值计算都需要进行网格剖分，网格剖分的好坏直接影响着数值计算的速度和精度，很多精细结构很难用网格来模拟，无网格技术可以很好地解决此类问题！(This paper describes the meshless numerical method electromagnetic integral equations, numerical integration of traditional body calculations require meshing, meshing a direct impact on the speed and accuracy of numerical calculation, many very fine structure difficult to simulate with the grid, no grid can solve this problem!)

说明：  VC6.0 读写matlab7.0的mat文件.分享此段代码，运行成功。(read the mat file of the matlab7.0,under the vc6.0)

purebasic的入门书籍，虽然用purebasic的人很少，甚至分类都没他。不过这个语言还是不错的。(purebasic entry books, although very few people with purebasic, or even no his classification. However, the language is good.)

在二维空间里有两个点A=(X1，Y1)和B=(X2，Y2)，如果X1>X2并且Y1>Y2 ，我们认为A优于B，A是这个集合的最大极值点，在给定的二维空间里的N个点的集合S中，找出最大极值点。(In two-dimensional space, there are two points = A = (X1, Y1) and B (X2, Y2), if the X1 and Y1 > X2 > Y2, we think that A is superior to B, A is the biggest extreme value point of the set, in A given set of N points in the two-dimensional space S, find out the most extreme value point.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

c语言非线性最小二乘法的程序，解决非线性最小二乘法问题(The nonlinear least square method)

菲涅尔区聚焦多波束天线空间谱估计性能分析(Fresnel zone focusing spectrum estimation performance of multi-beam antenna spatial analysis)

设关系A是从集合X={1，2，….，n}到集合Y={1，2，…..，m}的二元关系，而关系B是从集合Y到集合Z={1，2，….，p}的二元关系，求A与B的合成关系C。(A relationship is established from the set X = (1,2, ...., N) to the collection Y = (1,2, ... .., m) of binary relations, the relationship B is from a collection of Y to the set Z = ( 1,2, ...., p) of the binary relation, find the relationship between A and B, synthesis of C.)

谭浩强（第三版） 程序代码及习题答案.rar(Hao (third edition) program code and answer the questions. Rar)