seidel

时频分析的matlab GUI，AOK TFR 2，里面含有代码和相应的功能介绍的使用方法。分析结果分辨率很高( U65F6 u989 u5206 u7901 u7801 u548C u76R8 u5E94 u529F u029F u803F0 u4ECB u7ECD u7684 u4F7F U7528 u65399 u7)

模拟隧道开挖后受力及变形，初始地应力清零及接触面分析处理。( U6A21 u62DF u96A7 u9053 u5F00 u6316 u53D7 u53B0 u53E u53E u53F8 u53E U6790 u5904 u7406 u3002)

一些简单的UDF文件，实现流场中梯度和某一点压力的检测提取(Some UDF profiles)

同伦算法解非线性方程组，构造不动点问题,并从不同的初始点出发运行程序。(To solve nonlinear equations with homotopy algorithm，constructing a fixed foint progrem.and from the different starting point to run the program. )

正交实验中的极差分析代码，确定因素的优水平和最优水平组合，给出指标趋势图。(Orthogonal experiment range analysis code to determine the factors that the optimal level of excellent level and combination of indicators of trends is given.)

欧拉法解常微分方程的MATLAB程序M文件。与大家分享(Euler method for solving the M-file of Ordinary Differential Equations MATLAB program. To share with you)

FFT（Fast Fourier Transformation）是离散傅氏变换（DFT）的快速算法 [1] 。即为快速傅氏变换。它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FFT (Fast Fourier Transform) is a fast algorithm of discrete Fourier Transform (DFT). That is fast Fourier transform. According to the odd, even, imaginary and real characteristics of discrete Fourier transform, the algorithm of discrete Fourier transform is improved.)

偏微分方程的数值解法，简单的离散 变分以及求解过程(Numerical solution of partial differential equations, the simple and the solution process of discrete variational)

三维的有限时域差分源程序，边界条件为pml(Three-dimensional FDTD source, boundary conditions for the PML)

Algo2-2.c C program for implementing Algorithm 2.2 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NUMERICAL METHODS for Mathematics, Science and Engineering, 2nd Ed, 1992 Prentice Hall, Englewood Cliffs, New Jersey, 07632, U.S.A. Prentice Hall, Inc. USA, Canada, Mexico ISBN 0-13-624990-6 Prentice Hall, International Editions: ISBN 0-13-625047-5 This free software is compliments of the author. E-mail address: in "mathews@fullerton.edu" Algorithm 2.2 (Bisection Method). Section 2.2, Bracketing Methods for Locating a Root, Page 61