登录
首页 » WINDOWS » UMAT_Hashin3D

UMAT_Hashin3D

于 2021-04-18 发布 文件大小:3KB
0 336
下载积分: 1 下载次数: 68

代码说明:

  基于ABAQUS的三维hashin准则算法(A three-dimensional hashin standard algorithm based on ABAQUS)

文件列表:

UMAT_Hashin3D.for, 17619, 2017-04-28

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • cpml
    三维PML-FDTD的C语言代码,完全匹配层的C语言实现(3D PML-FDTD in the C language code, perfectly matched layer in C language)
    2010-06-11 14:28:04下载
    积分:1
  • square_f
    方柱绕流Lattice boltzman method(rectangular pillar LBM )
    2011-09-30 00:47:53下载
    积分:1
  • Unit1
    Algorithm gauss seidel load flow
    2013-03-10 00:51:10下载
    积分:1
  • lbp
    Local Binary Pattern
    2011-09-28 18:17:48下载
    积分:1
  • 程序
    说明:  模拟电场中的等势线,利用计算机数学软件MATLAB模拟仿真真空中自由电荷,电偶极子,带电细棒,尖端导体等附近静电场电场线及等势线分布图型(Equipotential line in simulated electric field)
    2018-12-25 10:55:02下载
    积分:1
  • Program
    矩阵转换问题 行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间,则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )
    2010-12-28 11:42:08下载
    积分:1
  • user-subroutines-l4-usdfld
    该程序通过编写fortran,得到abaqus之程序usdfld,并实例分析。(The program is by writing fortran, get abaqus procedures usdfld, and case analysis.)
    2014-07-02 16:33:16下载
    积分:1
  • vf-udf
    膜渗透 FUENT UDF 气液两相流 (Gas-liquid two-phase flow membrane permeation FUENT UDF)
    2020-12-01 16:09:26下载
    积分:1
  • 单纯形法Matlab程序-2016-11-17
    一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数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.)
    2018-03-27 17:22:03下载
    积分:1
  • shuffle
    利用拉格朗日松弛法求解机组组合问题,考虑领域搜索的随机性(Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field)
    2013-01-24 17:31:35下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载