登录
首页 » VHDL » test

test

于 2016-04-04 发布 文件大小:1KB
0 127
下载积分: 1 下载次数: 9

代码说明:

  利用ANSYS有限元仿真软件对复合材料进行异常检测仿真实验,程序为一损伤样板模型(ANSYS finite element simulation software for composites simulation anomaly detection, the program is a damage model model)

文件列表:

test.txt,4064,2016-04-04

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

发表评论

0 个回复

  • nihe
    说明:  在matlab环境下能进行各种曲线拟合的算法,非常好。(In the matlab environment to conduct various kinds of curve fitting algorithms, very good.)
    2008-09-21 18:10:58下载
    积分:1
  • 2Ddepth-migration
    地震偏移成像:二维叠后深度偏移(相移法)(Seismic imaging: two-dimensional stack depth migration (phase shift method))
    2021-04-06 21:29:02下载
    积分:1
  • Numerical_Recipes_in_C
    《数值分析方法库 》本书选材内容丰富,包括了当代科学计算过程中涉及的大量内容:求特殊函数值、随机数、排序、最优化、快速傅里叶变换、谱分析、小波变换、统计描述和数据建模、偏微分议程数值解、若乾编码算法和任意精度计算等。本书科学性和实用性统一,不仅对每种算法进行了数学分析和比较,而且根据作者经验对算法给出了评论和建议,并在此基础上提供了用C++语言编写的实用程序。(《Numerical Recipes in C: The Art of Scientific Computing》, The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.)
    2010-05-17 12:44:53下载
    积分:1
  • J.F.Claebout
    说明:  地球物理大师Claebout的几个有用的程序,包括偏移程序。用fortran语言写的(Several geophysical Claebout Masters useful procedure, including the migration process. Fortran language used to write the)
    2008-10-16 23:05:39下载
    积分:1
  • PQ decomposition method
    说明:  进行PQ分解,计算电力系统潮流的有效方法,应用广泛(PQ decomposition is an effective method for calculating power flow in power system.)
    2019-04-23 21:34:16下载
    积分: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
  • Matrix Computations 4th edition.pdf
    说明:  矩阵计算英文版第4版,经典,经典,很不错!!!!!请下载!!!!!!(Matrix Computing English Version 4, classic, classic, very good!!!! Please download!!!!!!)
    2020-06-23 22:20:02下载
    积分:1
  • 拟合圆
    根据X和Y两组数据,将两组数据在X-Y平面上最小二乘法拟合出圆(According to X and Y two sets of data, the two sets of data in the X-Y plane, the least square method of fitting the circle)
    2017-08-16 11:02:07下载
    积分:1
  • e1
    说明:  16点基4—FFT算法编程。输入16点的序列,采用基4-fft方法计算其快速傅里叶变换。(16 points-based 4-FFT algorithm for programming. Enter the 16-point sequence, with the base 4-fft method for calculating the fast Fourier transform.)
    2010-11-19 18:21:25下载
    积分:1
  • 302.L7.15Nov02
    关于弹性能的一个ppt和弹性能计算有关很有用(Microstructure-Properties Elastic Effects, Interfaces)
    2012-02-09 01:23:50下载
    积分:1
  • 696524资源总数
  • 103920会员总数
  • 65今日下载