A-solver-for-1-D-RIEMANN-problem

这是一个数组练习，程序的作用是查询一个一维数组（数值型数组）中每一个元素出现的次数，且元素出现的顺序不能改变(This is an array of exercises, the program' s role is to query a one-dimensional array (numeric array) in the number of occurrences of each element, and the element can not be changed in order of appearance)

迭代最小二乘法,反演中应用极广泛，非常经典(Iterative least-squares method，An extremely wide range of inversion, very classic)

程序是庄茁大神经典的Johnson-Cook模型隐式算法 另外包括一个 ABAQUS-Standard用户材料子程序实例的文档说明(The program is a classic Johnson-Cook model implicit algorithm and it includes documentation of an ABAQUS-Standard user material subroutine example)

说明：  最优化课程中的最速下降法matlab程序，利用了wolfe搜索和armijo线搜索(Matlab program of steepest descent method in optimization course, using Wolfe search and Armijo line search)

该程序利用最小二乘法进行拟合多元非线性方程。是我做毕设的时候写的。希望对大家有用。(This code can fit multivariable nonlinear equation by using least squares.)

基因的FFT变换，可以快速得出外显子的位置(Transform FFT of the gene can be quickly drawn to the location of exon)

随机有限元理论教材，是学习随机有限元及可靠度理论的不错东东 (Stochastic finite element theory of teaching materials, are studying stochastic finite element and reliability theory is true Dongdong)

wolfe程序模块的C++算法，可以重复使用,对于解决一维搜索是很好的..(C++ algorithm wolfe program modules can be reused for solving one-dimensional search is good ..)

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

FFT快速傅里叶变换，用于数字信号处理，大大提高了运行速度，节省内存开销。C语言实现(FFT fast Fourier transform for digital signal processing, greatly improving the speed and save memory overhead. C language)