Mobility_Jena

贪婪算法，可以用于资源分配等许多数学问题和工程问题中(Greedy algorithm)

对任意基本函数组合进行最小二乘曲线拟合的源程序。(basic function of arbitrary combinations least squares curve fitting of the source.)

说明：  复数函数与积分变换 Fourier变换 Laplace逆变换(Complex number function and integral transformation Fourier transformation Laplace inverse transformation)

计算离散傅里叶变换的一种快速算法，简称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.)

【ansys基本建模算例】带法兰油缸的有限元分析，计算相关应力即变形([Examples] basic modeling ansys finite element analysis with flanged cylinder, calculating the stress that is associated deformation)

c/C++跟fortran语言之间的一些转换(c/C fortran language with the conversion between)

converts binary sequence to decimal sequence

说明：  9跨每跨35米桥梁响应的车桥耦合程序，使用Fortran编写(9 of 35 meters span bridge across every bridge coupled response procedures, the use of Fortran written)

用于在数值分析中，对于离散点进行拉格朗日差值拟合(Lagrangian difference fitting)

工业汽轮机设计计算程序，具有很好的参考价值，可以参考学习一下(Industrial steam turbine design calculation procedures, a good reference value, you can refer to learn about)