登录
首页 » Fortran » mainunstructure

mainunstructure

于 2021-03-11 发布 文件大小:4KB
0 250
下载积分: 1 下载次数: 33

代码说明:

  非结构网格有限体积法求解二维欧拉方程程序,区别于结构网格(The unstructured grid finite volume method to solve two-dimensional Euler equation )

文件列表:

main-unstructure.f90,16432,2015-02-27

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

发表评论

0 个回复

  • shuzhifenxi
    说明:  包含十个常用的数值分析算法、包括高斯消去法、GIVENS变换等。(Contains ten commonly used numerical analysis algorithms, including Gaussian elimination, GIVENS transformation, and so on.)
    2019-05-22 15:10:35下载
    积分:1
  • chazhi
    本例实现了插值函数,将不同次数的插值进行了显示,防止了龙格现象,研究生一般以此题为作业。(The cases to achieve interpolation function, the number of different interpolation were shown to prevent the Runge phenomenon, in order to graduate generally entitled operations.)
    2013-11-14 15:28:33下载
    积分:1
  • shannon
    此程序为香农编码的程序实现的过程及相关参数和结果。(shannon)
    2010-06-02 16:47:42下载
    积分:1
  • BigNumber
    大数类,重载了各类操作符,可以直接使用(fate categories, a variety of heavy-duty operator can be used directly)
    2005-02-27 10:55:05下载
    积分:1
  • sma_um
    说明:  Umat Abaqus for plasticity
    2020-06-20 02:40:01下载
    积分:1
  • 模糊指平滑
    说明:  模糊指数平滑算法源程序,进行预测 计算.(fuzzy exponential smoothing algorithm source for projection.)
    2005-09-04 23:32:05下载
    积分:1
  • Bessel-function
    贝塞尔函数与汉克尔函数的Matlab实现(Bessel function and Hankel function of the Matlab implementation)
    2011-05-23 22:29:43下载
    积分:1
  • matlabFunctions
    说明:  在matlab实现基于Schmidt的QR分解,共轭梯度法等(QR decomposition based on Schmidt in MATLAB)
    2020-01-13 11:19:51下载
    积分:1
  • MATLAB+软件在线性代中的应用
    说明:  MATLAB在线性代数中的一些基本操作,比如矩阵相加等等。(Basic operation of linear algebra)
    2020-03-19 12:53:49下载
    积分:1
  • An-efficient-augmented-
    基于经典的增广拉格朗日乘子法, 对求解一类带有特定结构(主要是针对凸规划)的非光滑等式约束优化问题, 我们提出、分析并测试了一个新算法. 在极小化增广拉格朗日函数的每一步迭代中, 该算法有效结合了带有非单调线性搜索的交替方向技术, 我们建立了算法的收敛性, 并用它来求解在带有全变差正则化的图像恢复问题.(Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively combines an alternating direction technique with a nonmonotone line search to minimize the augmented Lagrangian function at each iteration. We establish convergence for this algorithm, and apply it to solving problems in image reconstruction with total variation regularization.)
    2017-01-05 15:54:19下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载