通过模型决定系数完成支持向量机参数优化 SVR_fitting

改进了跨声速偶极子网格法（TDLM），且在颤振计算中能自动求颤振点速度，从而较大地提高了计算速度，并有利于方法在较大马赫数及较大减缩频率时的应用。(Dipole source grid method)

二层地质模型波场模拟,用有限差分进行波场的模拟,充分利用多波多分量地震记录，以及各向异性方面的独特信息，可有效地减少 纵波勘探的多解性，定量地描述裂缝储层，改善某些纵波资料成像不好地区的构造 成像。这样可获得比纵波分辨率高的多波剖面，从而有利于研究小幅度构造、断层、 裂缝裂隙等复杂地质现象，对油气勘探与开发具有现实意义和实用价值(Two-layer geological model wave field simulation, using finite difference wave field simulation to make full use of multi-wave multi-component seismic records, and the anisotropy of the unique information can be effective in reducing the P-wave exploration, multi-solution and quantitatively describe the crack reservoir to improve the poor image of some P-wave data area structure imaging. This availability of higher resolution than the longitudinal wave of multi-wave profile, thus contributing to the small amplitude structures, faults, cracks, fissures and other complex geological phenomena, for oil and gas exploration and development of practical significance and practical value)

将字符串合并的时候要注意中间的空格，否则可能在合并时出错。我调试了好久才发现(combine the string,essential to focus the length of string)

用C++来实现NEWTON迭代法解非线性方程算法数值分析，是数值分析里典型的一个算法。(In C++ to achieve NEWTON iterative numerical algorithm for solving nonlinear equations, numerical analysis is in a typical algorithm.)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

有限单元法基本原理和数值方法,书籍，供学习参考(The basic principle of finite element method and numerical methods)

改程序是计算出金属表面等离子体直波导的有效折射率随波长和传输长度随波的两色散曲线，另外给定Drude-Lorentzia模型参数给定后，还可以求解介电常数以及画出相应实部和虚部的曲线(This programer is used to calculate Ag relative dielectric constant accroding to the Drude-Lorentzia and sovle the transcendental equation for even illumination. At the same time,it can draw the diagram of relationship between the dispersion curve and the Transmission with the length. )

数值计算程序库，C语言版，Numerical Recipes in C，包含很多基本的数值计算子程序(Digital program library, C language version, Numerical Recipes in C)

以前用VB6编写的一个计算器，支持常用的数学函数，支持弧度、角度转换，支持简单的函数作图。(A calculator writen by VB6, supports common mathematical functions, support radian, angle conversion, support simple function mapping.)

RD成像算法，快速傅里叶变换函数，适合学习(RD imaging algorithm, fast Fourier transform function, suitable for learning)