Newmark

说明：  C-means in 2 types. C=2

这是一个小型计算器，功能强大，用户输入想要计算的数据，即可自行计算出结果。(This is a program about calculator,and it is very userful.)

基于最小二乘位置估计定位方法（三维的）可产生图((Three-dimensional) positioning method based on least squares position estimation in Figure)

短时傅立叶变换及其反变换---绝对可运行！(Short-time Fourier transform and its inverse transform- absolutely can run!)

c++算法源代码，主要是POJ上面的算法，根据标号可以找到。(c++ algorithm source code, POJ above algorithm, based on the label can be found.)

本程序集对地球物理场做多种处理 如：2阶及4阶导数，位场转换，不规则密度体重力场计算，竖直圆柱体重磁场计算，用泰勒多项式及最小平方2乘的剩余异常计算，（主要适用于地磁场以及重力场的转换）(FUNCTION : THIS ROUTINE IS USED TO CALCULATE GRAVITY FOR VARIABLE DENSITY OF 2D BIVARIATE TRAPEZOID BODY Function : This program calculate derivation of order 2 and order 4 uesd in Geophysical Field（magmagnetic，gravity field） FUNCTION : THIS ROUTINE IS USED TO CALCULATE GRAVITY FOR VARIABLE DENSITY OF 2D BIVARIATE TRAPEZOID BODY Purpose: Continuation of potential fields (upward and downward continuation ) Function: This program will calculate residual anomaly,)

用matlab编写newmark-B法解结构振动微分方程的程序(Prepared using matlab newmark-B method for solving differential equations of structural vibration program)

流体力学SIMPLE算法（C语言编程实现）需自己设定边界条件(SIMPLE algorithm)

电磁波走时层析成像图像重建正演反演程序设计(Electromagnetic wave travel tomography image reconstruction inversion inversion program design)

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