CAPE

有限元n维实体材料单元，仅供科研用途，拒绝商业使用(N-dimensional finite element solid material element, for scientific purposes, refusing commercial use)

ANSYS车桥耦合瞬态分析代码,实现车辆移动荷载加载(ANSYS-vehicle bridge coupled)

关于FFT和bode图的相关分析和再saber中的实现程序。。关于FFT和bode图的相关分析和再saber中的实现程序。。关于FFT和bode图的相关分析和再saber中的实现程序。。(On the FFT and Bode diagram of the relevant analysis and re saber in the implementation process.)

基于matlab的约束非线性规划算法库，适于学习！(Matlab-based algorithm for the constrained nonlinear programming library, suitable for learning!)

说明：  通过matlab实现抽样检测功能，具体通过蒙特塔罗算法依照概率分布计算指定变量的分布规律，是初学者的好案例(The sampling detection function is realized by matlab, and the distribution rule of specified variables is calculated by Montreal algorithm according to probability distribution.)

压缩包中包含五个CFD基础程序，其中MacCormack1DSolveRiemann.for是一维欧拉方程求解（黎曼问题），UpwindTVD_1D.for是一维可压粘性N-S方程求解，MAC-Chorin2D.for是利用MAC算法和Chorin压力迭代解法求解 二维不可压缩黏性平板间Poisuille流动问题，Lax-Webdroff2D.for是利用Lax-Webdroff差分格式求解二维平面激波反射问题，fvm_upwind_MAC_couette.for是以一阶迎风型离散格式和Chorin压力迭代求解couette二维流动问题。(CFD compression package contains five basic program, which is an Euler equation solving MacCormack1DSolveRiemann.for (Riemann problem), UpwindTVD_1D.for is one-dimensional compressible viscous NS equation solving, MAC-Chorin2D.for is the use of algorithms and MAC Chorin pressure iterative solution for solving the two-dimensional incompressible flow problems between viscous flat Poisuille, Lax-Webdroff2D.for using Lax-Webdroff difference scheme for solving the two-dimensional plane shock wave reflection problem, fvm_upwind_MAC_couette.for based on first order upwind scheme and Discrete Chorin pressure couette iterative solution of two-dimensional flows.)

该程序用于形成节点阻抗矩阵，按程序要求格式输入线路数据linedata，Zbuild（linedata）形成节点阻抗矩阵(The procedures used for the formation of the node impedance matrix format input line data linedata procedural requirements of Zbuild (linedata) node impedance matrix)

计算fluent相变的udf模型，包括气相到液相，液相到气相的双向传递。(Calculate the udf model of fluent phase transition)

to judge points in a polygon

bellman-ford算法，典型最短路算法，用于计算一个节点到其他所有节点的最短路径(bellman-ford algorithm, a typical shortest path algorithm for computing a node to all other nodes of the shortest path)