登录
首页 » Others » upwind

upwind

于 2013-10-26 发布 文件大小:1KB
0 228
下载积分: 1 下载次数: 3

代码说明:

  Method upwind for equation of advection 1d in Matlab

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

发表评论

0 个回复

  • xbresson_2009_NLTV
    compressive sensing theory
    2013-08-16 22:11:28下载
    积分:1
  • Turbo-MATLAB
    这个turbo码的matlab仿真程序~~希望对大家会有用~~谢谢~~我只想要和大家分享一下(The turbo code matlab simulation program we hope will be useful ~ ~ ~ ~ ~ I just want to thank you and share with you)
    2020-06-30 02:20:01下载
    积分:1
  • Vessel_Design_Matlab_files_with_Optimtool-2014-01
    Pressure vessel design implementation . .
    2014-01-10 01:03:41下载
    积分:1
  • matlab_newmann_TP1
    principal_neumann (nom_maillage) a routine for implementing the EF P1 Lagrange for the Laplace equation following, with conditions Neumann on the mesh nom_maillage.msh
    2013-12-24 05:38:30下载
    积分:1
  • C_CMethod
    混沌时间序列分析中的c-c方法,用于求相空间重构时的时间窗和延时,已修正部分错误(Chaotic time series analysis cc method for seeking and delay time window when the phase space reconstruction, part of the error has been corrected)
    2014-01-19 13:43:30下载
    积分:1
  • lagrane
    说明:  该函数用于用于拉格朗日插值的展开及其误差估计(matlab function for lagrane)
    2019-12-13 08:48:57下载
    积分:1
  • fan
    球赛门票的售票处规定每位购票者限购一张门票,且每张门票售价 50元。购票者中有 m位手持50元钱币,另有n人手持100元。假设售票处开始售票时无零钱。问这m+n人有 几种排队方式可使售票处不致出现找不出钱的局面。(The box office ticket sales are limited to the provisions of each ticket purchase a ticket, and the price of 50 yuan per ticket. Ticket-holders have m-bit hand-held 50 coins, and another n armed with 100 yuan. Suppose no small change when the ticket office began selling tickets. M+ n asking a few people queuing up outside ticket office can not find the money to avoid a situation.)
    2009-12-18 01:28:10下载
    积分:1
  • SSC_1.0
    Sparse Subspace clustering, an algorithm which is useful for subspace segmentation and motion tracking--
    2014-02-03 13:26:53下载
    积分:1
  • graphtestwxc
    能量有效的无线传感器网络部署将无线传感器网络的节点部署问题抽象为圆覆盖问题(Energy efficient wireless sensor network deployments will deploy wireless sensor networks for the circle covering problem is abstracted)
    2011-05-03 12:42:35下载
    积分:1
  • sort
    Conceptually, a merge sort works as follows Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted). Repeatedly merge sublists to produce new sorted sublists until there is only 1 sublist remaining. This will be the sorted list.
    2013-12-01 01:52:17下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载