shengbomoni

ansys二次开发损伤本构关系的详细代码，已经调试成功(ansys damage constitutive secondary development of detailed code, debugging has been successful)

6自由度自由漂浮空间机械臂运动学建模，广义雅克比矩阵(6 degrees of freedom of the free-floating space manipulator kinematics modeling, generalized Jacobian matrix)

这是ansys里面apdl语言，用于计算圆柱体开裂(This is the ansys inside apdl language, used for calculating the cylinder craze)

c++运算符程序编写运用，包括+，-，*，/，>>,<<(c++ operator programming use, including+,-,*, /, > > , < < )

分享一个外国人编写的FDTD程序,可以用来计算微带线和微带贴片天线,程序中采用的是均匀网格划分,但也可以在容易地在它基础上改写成非均匀网格.其边界条件与Sheen的程序不同,这里采用二阶技术.(Prepared to share a foreigner FDTD procedures, can be used to calculate the microstrip lines and microstrip patch antenna, the procedure used is uniform mesh, but can also easily rewrite it into the basis of non-uniform grid. its boundary conditions with different processes and Sheen, where second-order technology.)

这是一个求解NACA0012翼型在不同马赫数与攻角下的流场的Fortran源代码。计算格式采用了原始AUSM、AUSMDV以及AUSM+格式。为了提高计算精度，使用了不同限制器的MUSCL插值。(This is a Fortran source code for solving the flow field around the NACA0012 airfoil at different Mach numbers and angles of attack. The scheme of AUSM, AUSMDV and AUSM+ are employed for this code. In order to improve the calculation accuracy, the MUSCL interpolation with various type limiter are used.)

用于研究粒子在晶体材料内输运性质，计算扩散系数的动力学蒙特卡洛程序( Kinetic Monte Carlo program is used to study particle transport properties in crystalline materials, the calculation of the diffusion coefficient Kinetic Monte Carlo program is used to study particle transport properties in crystalline materials, the calculation of the diffusion coefficient)

学习fortran的必备，simple算法，拥有完整注释，便于学习交流，是快速学习数值传热学的利器(Learning fortran essential, simple algorithm, with complete notes, facilitate learning exchanges)

共炮点地震波正演，其中、包括了直达波，反射波，折射波(Common shot point synthesis of reflected wave records)

序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一，传统的SQP算法每一步迭代都要求解QP子问题。 　　(Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration for every iteration.)