登录
首页 » Fortran » ABAQUS-UMAT-paper

ABAQUS-UMAT-paper

于 2018-04-27 发布 文件大小:1140KB
0 190
下载积分: 1 下载次数: 34

代码说明:

  UMAT复合材料渐进损伤实现的具体文献,适合初学者阅读(UMAT for composites-paper)

文件列表:

ABAQUS-UMAT-paper.pdf, 1295395 , 2016-01-07

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

发表评论

0 个回复

  • StokesHotine
    地球科学:重力场积分(Fortran90) Stokes/Hotine/V_M垂线偏差积分:数值积分、二维平面FFT、二维球面FFT、一维FFT(Earth Sciences: Gravity Field Points (Fortran90) Stokes/Hotine/V_M deflection of the vertical integration: numerical integration, the two-dimensional plane FFT-dimensional sphere FFT, one-dimensional FFT)
    2012-10-13 13:14:35下载
    积分:1
  • Gravity-anomaly
    计算重力异常,只需要输入最大重力场模型的最大阶数以及重力场模型文件名在程序里设置经纬度范围和间隔即可得到重力异常(Gravity anomaly)
    2013-06-13 14:46:49下载
    积分:1
  • B_ADI
    ADI method for solving PDE equations
    2019-01-02 15:37:35下载
    积分:1
  • CS_KM
    现有的贪婪迭代类压缩感知重构算法均基于最小二乘对信号进行波形估计,未考虑到可能将量测噪声引入信号估计的情况.针对以上不足,提出了一种基于线性Kalman滤波的压缩感知弱匹配去噪重构算法(Existing greedy iterative reconstruction algorithms class compressed sensing the signal waveform based on least squares estimation does not take into account the possible introduction of the measurement noise signal estimation situation. For the above shortcomings, we propose a linear Kalman filter based on compressed sensing reconstruction algorithm denoising weak match)
    2015-01-25 18:39:04下载
    积分:1
  • UMAT_Hashin3D_T-N
    基于ABAQUS的hashin和Tong-Norrius准则的umat子程序(Umat subroutine based on the Hashin and Tong-Norrius guidelines of ABAQUS)
    2020-10-26 23:00:00下载
    积分:1
  • rkf45
    fortran90程序,运用Runge-Kutta法数值求解常微分方程的程序,非常适用,包括源代码、一个算例和输出程序(fortran90 procedures, the use of Runge-Kutta method for numerical solution of ordinary differential equations of the process, is very applicable, including source code, a numerical example and output procedures)
    2009-09-17 02:05:54下载
    积分:1
  • svdpackc.tar
    求矩阵奇异分解svd算法,共计4种实现方式,(for SVD matrix decomposition algorithm, for a total of four kinds of achievement,)
    2005-07-06 10:56:02下载
    积分:1
  • KFFT
    计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)
    2013-12-18 22:32:50下载
    积分:1
  • arithmetic
    arithemetic code on visual c++
    2009-12-20 18:53:54下载
    积分:1
  • matrix
    C++中矩阵运算的实现 nr3.h为其他的书籍代码,测试环境为VS2008(Achieve C++ in matrix operations nr3 code for other books)
    2014-10-16 10:25:43下载
    积分:1
  • 696524资源总数
  • 103945会员总数
  • 46今日下载