ansys二次开发

说明：  本程序是采用FDTD算法结合PML吸收边界，对对称三层平板光波导的模式场仿真(This program uses FDTD algorithm and PML absorbing boundary to simulate the mode field of symmetrical three-layer planar optical waveguide.)

Matlab codes for Robust PCA multivariate control chart(Robust PCA multivariate control chart mainly consists two steps: Step1 Calculates the robust mean and the robust covariance of original dataset using the minimum covariance determinant (MCD). In MCD technique, finding a subset containing half of the data such that its covariance matrix has the lowest determinant, then using this subset to calculate the robust mean and the robust covariance matrix (Hubert, Rousseeuw, & Branden, 2005) Step2 Standardize data using robust mean and robust standard deviation from Step1. Apply PCA analysis, calculate the principalcomponent score matrix Y=ZA, where Z is the robust standardized data matrix, and A is p*p matrix of eigenvectors (also called principalcomponents))

平常练习的一些程序，比较基础，包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)

通过建立截面为多边形的水平柱体模型，运用c语言程序进行编程，得出该地质体的重磁异常特点(By establishing a horizontal cylinder model with polygon cross section and programming with C language, the characteristics of gravity and magnetic anomalies of the geological body are obtained.)

二维贴体网格 fortran 源程序；偏微分方程生成网格，附详细的说明文档(body-fit mesh generation, two dimension)

Cavity Matlab SIMPLE algorithm

说明：  工程中微分方程数值积分经常需要使用的Newmark法(Differential equations numerical integration project often requires the use of the Newmark method)

abaqus中的三微裂纹扩展，一起学习下(the abaqus of three micro-crack propagation, with learning under)

ABAQUS扩展子程序开发，用于计算模拟(ABAQUS extended subroutine application)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)