登录
首页 » matlab » codes

codes

于 2012-09-01 发布 文件大小:2KB
0 215
下载积分: 1 下载次数: 4

代码说明:

  在图论中的floyed算法程序,可以算两点之间的最小距离(The floyed algorithm in graph theory)

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

发表评论

0 个回复

  • SVI
    Gatheral SVI模型包含 raw SVI, Surface SVI 和含有跳过程的SVI(This is a document about the SVI model codes of J.Gatheral including raw SVI, Surface SVI and SVI with jump)
    2020-09-10 11:58:01下载
    积分:1
  • Approximations_Finite_Element_Methods
    In this section we introduce the idea of Galerkin approximations by considering a simple 1-d boundary value problem
    2018-01-01 08:47:19下载
    积分:1
  • naca4gen
    NACA 4位数 翼型数据的生成 Matlab程序(NACA 4 digit airfoil)
    2021-03-01 20:49:34下载
    积分:1
  • RGB a YCbCr
    There is an algorithm that converts RGB Color to YCbCr
    2018-05-18 09:14:27下载
    积分:1
  • graphene_dos
    石墨烯量子态密度计算,采用紧束缚近似以及薛定谔方程,计算态密度(Graphene quantum state density calculated using the tight-binding approximation and the Schrodinger equation to calculate the density of states)
    2013-02-27 16:30:00下载
    积分:1
  • cam
    凸轮的程序,很好,可以随更改,可以随便变化凸轮的结构。(Cam program, well, you can with the changes, you can easily change the structure of the cam.)
    2021-01-23 21:48:39下载
    积分:1
  • u1_zhiluzhuijiaqiuzukongjuzhen
    利用支路追加法求阻抗矩阵,解:输入数据如下: 请输入节点数:n=a 请输入支路数:nl=b 请输入由支路参数形成的矩阵: B=[i j z bc t it ......]其中ij为支路端点,z为支路阻抗,bc为对地电容,t为变压器变比,it表示i端点是否与变压器直接相连。 (Seek additional method using branch impedance matrix)
    2020-07-29 20:18:38下载
    积分:1
  • python神经网络求解农产品需求预测
    使用BP神经网络预测农产品的需求,论文在知网上应该就一篇。(Using neural network to predict the demand of agricultural products)
    2017-12-24 01:50:39下载
    积分:1
  • codes
    说明:  应用龙格库塔算法求解动力学微分方程,求解时域数据(Solving dynamic differential equation with Runge Kutta algorithm)
    2020-02-03 18:25:32下载
    积分:1
  • STRSCNE
    给出变量的上下边界、初值和代价函数,能够搜索代价函数最小值时的变量取值。属于带约束的优化算法,可以用来求算非线性方程组。(STRSCNE is a Matlab code for constrained nonlinear systems of equations F(x)=0 l<=x<=u where F: R^n--> R^n, l and u are vectors of dimension n. Non-existent lower and upper bounds, i.e. entries of l and u equal to minus o plus infinity, are allowed. The algorithm is a globally convergent procedure that combines Newton method and an elliptical trust-region approach. The elliptical trust-region is defined employing a scaling diagonal matrix D and the trust-region subproblem is approximately solved by the dogleg method. Only strictly feasible iterates are generated. Various input/output options are provided, and we refer to the code itself for further documentation. )
    2009-10-30 16:18:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载