登录
首页 » Fortran » UGKS-1D

UGKS-1D

于 2020-11-13 发布 文件大小:8KB
0 210
下载积分: 1 下载次数: 9

代码说明:

  适合于稀薄流动计算的气体动力学格式源码,该源码为xukun老是JCP论文中的算例一致(UGKS1D- shock structure calculation using Unified Gas-Kinetic Scheme)

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

发表评论

0 个回复

  • kring123
    克里金(Kriging)插值法又称空间自协方差最佳插值法,它是以南非矿业工程师D.G.Krige的名字命名的一种最优内插法。克里金法广泛地应用于地下水模拟、土壤制图等领域,是一种很有用的地质统计格网化方法。它首先考虑的是空间属性在空间位置上的变异分布.(Kringing smooth)
    2020-09-16 21:57:55下载
    积分:1
  • HLL2
    计算流体力学,HLL格式的一个算例,可以直接计算,适合初学者,易懂,每步有说明。(The calculation of an example of fluid dynamics, HLL format, can be calculated directly, suitable for beginners, easy to understand each step is described.)
    2021-04-21 01:38:49下载
    积分:1
  • grey
    灰色关联度分析是基于灰色系统的灰色过程, 进行因素间时间序列的比较来确定哪些是影响大的主导因素, 是一种动态过程的研究。(Grey Relational Analysis is based on gray gray process, the comparison of the time series between the factors to determine what affect the the big dominant factor, is a dynamic process.)
    2012-08-25 00:27:37下载
    积分:1
  • Matrix
    很好用的有关矩阵的各种操作,包括求逆,特征值,特征向量,svd分解等(good part of the matrix of various operations including inverse, eigenvalues, eigenvectors, svd decomposition, etc.)
    2020-10-31 16:39:55下载
    积分:1
  • delta-master
    非圆形离散元程序,通过采用非圆形颗粒实现康转动性能(Non-circular discrete element program, through the use of non-spherical particles achieve Kang rotation capability)
    2016-05-18 11:10:53下载
    积分:1
  • line_guiyi
    数据归一化处理,对数据进行一个标准化处理,将各个不同单位的变量,转换成无量纲的量(Data normalization, a standardization of data processing, will be different units of variables, into dimensionless quantities)
    2019-04-17 17:36:24下载
    积分:1
  • fdtd_2D_TE_PML
    fdtd的2d算法,pml边界条件,二维TE波(fdtd the 2d algorithm, pml boundary conditions, 2D TE wave)
    2007-02-02 16:43:27下载
    积分:1
  • gmm-4.2.tar
    Generic templates of algorithms for sparse matrixs
    2013-07-12 10:49:08下载
    积分:1
  • Soct
    假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解:(1,4,3,2),(1,4,5),(8,2),(3,5,2)。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])
    2012-06-14 16:25:10下载
    积分:1
  • jaya
    jaya algorithm source code
    2017-03-01 16:24:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载