登录
首页 » matlab » TDtest

TDtest

于 2020-09-21 发布 文件大小:1KB
0 302
下载积分: 1 下载次数: 88

代码说明:

  针对于对一般矩阵的求逆,或对复杂系统的求逆(Aimed at the general matrix inverse or inverse complex systems)

文件列表:

TDtest.m,942,2010-06-23

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

发表评论

0 个回复

  • Shepard-fitting-
    地理数据拟合,用于GNSS高程拟合,内附示例(Geographic data fitting, used in GNSS elevation fitting, enclose the sample )
    2021-01-27 19:08:41下载
    积分:1
  • ssor-pcg
    超松弛预处理共轭梯度法,用于求解有限元计算中常见的大型对称稀疏矩阵(Overrelaxation preconditioned conjugate gradient method for solving the finite element calculation of large symmetric sparse matrix)
    2021-04-26 10:18:45下载
    积分:1
  • 764
    多物理场耦合软件采用有限元方法模拟表面等离子体激元,适合入门学习者(Multi-physics coupling software using the finite element method to simulate the surface plasmon, suitable for entry-learners)
    2012-09-14 00:14:22下载
    积分:1
  • 需求响应程序
    万有引力单目标优化算法,用于单目标线性规划问题(Universal gravitation single objective optimization algorithm is used for single target linear programming problem.)
    2020-12-13 16:39:14下载
    积分:1
  • FFT842
    基二、基四、基八 FFT变化源代码,有详细注解(Second base, the base four or eight FFT-based changes in the source code, detailed comments)
    2021-02-20 14:09:43下载
    积分:1
  • Dipole-source-grid-method
    改进了跨声速偶极子网格法(TDLM),且在颤振计算中能自动求颤振点速度,从而较大地提高了计算速度,并有利于方法在较大马赫数及较大减缩频率时的应用。(Dipole source grid method)
    2021-01-13 18:58:47下载
    积分:1
  • python神经网络求解农产品需求预测
    使用BP神经网络预测农产品的需求,论文在知网上应该就一篇。(Using neural network to predict the demand of agricultural products)
    2017-12-24 01:50:39下载
    积分:1
  • GOCEPARSER
    利用下载的goce原始数据,计算得出含有时间/经纬度/重力梯度格式的程序(Use downloaded goce raw data, calculated with the time/latitude/gravity gradient program formats)
    2013-08-25 16:44:04下载
    积分:1
  • Gaussin-Curve-Fitting-with-C
    采用最小二乘方法的高斯曲线拟合算法, 用C 语言编写. 包含子程序.(Gaussian Curving Fitting with C language)
    2021-04-14 18:18:55下载
    积分:1
  • KFFT
    计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)
    2013-12-18 22:32:50下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载