登录
首页 » C# » 边界随时间udf

边界随时间udf

于 2021-03-06 发布 文件大小:393KB
0 305
下载积分: 1 下载次数: 9

代码说明:

  Fluent 实现随时间或坐标变化边界条件的方法udf(udfFluent implements the method of changing boundary conditions with time or coordinates UDF)

文件列表:

边界随时间udf.pdf, 451583 , 2018-01-28

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

发表评论

0 个回复

  • 利用VORONOI算法在PYTHON中的多晶材料
    利用VORONOI算法在PYTHON中的多晶材料建模(Modeling of Polycrystalline Materials in PYTHON Using VORONOI Algorithms)
    2019-03-20 11:40:15下载
    积分:1
  • 李雅普诺夫稳定性分析
    说明:  李雅普诺夫稳定性分析,包含几种典型案例,供参考。(Lyapunov stability analysis, Contains several typical cases, For your reference)
    2020-04-11 09:07:48下载
    积分:1
  • ukf_for_track_6_div_system
    对于非线性模型的跟踪预估问题,摒弃额对非线性函数进行线性化的做法,采用无迹变换处理均值和方差的非线性传递问题。(For the tracking and prediction problem of the nonlinear model, the linearization of the non-linear function is abandoned, and the traceless transformation is used to deal with the non-linear transfer of mean and variance.)
    2019-04-16 16:37:10下载
    积分:1
  • SmartAntenna-master
    说明:  基于遗传算法的智能天线计算,计算指定方向的电小天线方向图(MATLAB project that uses genetic algorithm to calculate the best array factor to a given direction on a smart antenna.)
    2019-12-18 20:22:55下载
    积分:1
  • nonlinear
    光纤存在非线性效应,SPM、XPM、FWM,本算法为啁啾高斯光束在光线中传播的波形变化,采用了分步傅里叶法(simulation of fiber nonlinearity)
    2018-09-16 13:15:33下载
    积分:1
  • 铰接薄壳的后屈曲分析
    基于ANSYS分析平台的铰接薄壳的后屈曲分析--APDL(Post-buckling analysis of articulated thin shells based on ANSYS analysis platform--APDL)
    2020-06-16 20:00:01下载
    积分:1
  • SIMPLE算法-MATLAB
    SIMPLE算法编程语言,使用Matlab对SIMPLE算法进行了阐述。(SIMPLE programming language)
    2021-04-23 21:48:47下载
    积分:1
  • complete
    用于随机粗糙面建模的蒙特卡罗算法程序包含一维和二维算法(Monte Carlo algorithm for random rough surface modeling)
    2020-11-07 10:59:48下载
    积分:1
  • huigui
    基于回归分析的负荷预测,包括了最小二乘回归和偏最小二乘回归(Load forecasting based on regression analysis)
    2017-07-26 11:10:03下载
    积分:1
  • matlab_bgl.part01
    节点度是指和该节点相关联的边的条数,又称关联度。 特别地,对于有向图, 节点的入度 是指进入该节点的边的条数; 节点的出度是指从该节点出发的边的条数。(Node degree refers to the number of edges associated with the node, also known as the degree of association. In particular, for a directed graph, The ingress of a node is the number of edges entering the node; The out-degree of a node is the number of edges that start from that node.)
    2018-07-23 21:52:37下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载