登录
首页 » matlab » TE_PHC

TE_PHC

于 2008-11-03 发布 文件大小:11KB
0 203
下载积分: 1 下载次数: 0

代码说明:

说明:  二维光子晶体弯曲波导的fdtd程序,matlab语言 ,TE波, PML边界条件,平面波光源(Two-dimensional photonic crystal waveguide bend the FDTD program, matlab language, TE wave, PML boundary conditions, plane wave light source)

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

发表评论

0 个回复

  • stochreal
    随机子空间算法实现 matlab函数 分两步求取 来源于网络(Stochastic Subspace Realization Algorithm Tohru Katayama, "Subspace Methods for System Identification", Springer)
    2010-01-20 21:45:18下载
    积分:1
  • drop
    使用fluent udf编程,实现水滴在空气中的运动描述。(Use fluent udf programming, to achieve the movement of water droplet in the air.)
    2014-06-13 14:27:10下载
    积分:1
  • chrip
    信号测量矩阵,如何选取测量矩阵!!!!!!!!!!!(Signal measurement matrix)
    2015-12-06 22:16:30下载
    积分:1
  • f77sour
    Fortrann 77的集成 开发环境,可以在 IDE的环境下编辑、 编译、运行源程序(Fortrann 77 integrated development environment, IDE environment editing, compiling, running source)
    2005-03-08 13:46:00下载
    积分:1
  • 第19章 离散相模型 - 副本
    说明:  FLUENT中离散相粒子追踪设置及相关计算,设计用户自定义相关内容(Discrete phase particle tracking in FLUENT)
    2020-06-20 19:40:02下载
    积分:1
  • Bayesian-Methods-for-Hackers
    说明:  贝叶斯统计推断相关资料和贝叶斯方法,学习贝叶斯不错的资料(Bayesian statistical inference related data and bayesian methods, learning bayesian good data)
    2020-06-24 01:20:02下载
    积分:1
  • Fortran_Method_1
    用于矩阵的一种cholesky分解方法,第一次上传请多关照(cholesky method for matrix decomposition)
    2020-08-23 14:48:20下载
    积分:1
  • the-normal-line-of-the-gear
    齿轮传动参数测定和公法线公差计算,变位直齿圆柱齿轮参数测定(Determination and the normal line of the gear transmission parameter tolerances calculation)
    2012-07-08 08:50:08下载
    积分:1
  • pid
    变增益PID算法的c++实现,目前PID算法较多的是c代码写的,这里上传一个C++的(Variable gain PID algorithm c++ to achieve, the current is more PID algorithm code written in c, where a C++ From the)
    2009-04-10 15:00:51下载
    积分: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
  • 696516资源总数
  • 106611会员总数
  • 19今日下载