Ansys-bridge

fdtd的2d算法，pml边界条件，二维TE波(fdtd the 2d algorithm, pml boundary conditions, 2D TE wave)

用C++写的矩阵鞍点求法(C wrote saddle point Matrix Method)

C + +程序，根据用户的输入可以产生特定的Gauss -1型切比雪夫正交规则，(C++ program which can generate a specific Gauss-Chebyshev type 1 quadrature rule, based on user input)

四阶龙格库塔法解一阶二元微分方程 应用于数值计算(Fourth-order Runge-Kutta method for solving a class of binary differential equations for numerical calculation)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)

开发环境没有可选项，fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90 )

离散数据生成tin的优秀代码，注释多，易于学习和移植(Discrete data generated tin excellent code, comments, easy to learn and transplantation)

计算流体力学软件FLUENT计算空气龄的udf文件(FLUENT CFD software udf file to calculate the air age )

fluent中关于co2的真实气体模型的自定义程序(fluent in about co2 real gas model custom program)

本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)