ISO_VOR

说明：  一阶，二阶，三阶，四阶，显式与隐式龙格库塔方程求解常微分方程的matlab代码(Matlab code for solving ordinary differential equations of first, second, third, fourth, explicit and implicit Runge Kutta equations)

学习用UMAT程序，用于abaqus隐式计算的Johnson-cook模型，有所修改(Learn UMAT program for abaqus Johnson-cook implicit calculation model, some modifications)

一个小的瞬变电磁测深数据处理程序，主要用于计算视电阻率和深度.(a small transient electromagnetic sounding data processing procedures, mainly used in the calculation of the apparent resistivity and depth )

umat公式详细介绍，我也不知道够20字了mei(the introduction of umat in abaqus)

说明：  此代码包括牛顿法和梯度下降法的实现过程，最优化以及算法中常见的问题解决方式(This code includes the process of Newton method and gradient descent method)

通过最小二乘辨识系统模型，并进行必要的分析，是上系统辨识课的实验内容，有程序和报告(By least squares identification system model and the necessary analysis on System Identification lesson experimental content, procedures and reporting)

二元二次多项式曲面拟合法的Matlab实现，含有M文件及数据文件示例(Binary quadratic polynomial surface fitting Matlab, contain the M-file and the data file example)

说明：  abaqus周期性边界条件代码，可以参考学习(ABAQUS periodic boundary condition code can refer to learning)

用matlab对偶极子电场线描绘，能够和等势线一起画出。改变电荷量就能得到不同的电场线分布。(Electric field line of a diple)

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