登录
首页 » Others » Fundamentals of matrix computations

Fundamentals of matrix computations

于 2017-10-08 发布 文件大小:4132KB
0 180
下载积分: 1 下载次数: 6

代码说明:

  Fundamentals of matrix computations 矩阵运算的基础(Fundamentals of matrix computations)

文件列表:

Fundamentals of matrix computations .pdf

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

发表评论

0 个回复

  • GPKolmogorov
    This file contains a summary of what you will find in each of the files that make up your GPKolmogorov application.
    2008-03-27 22:07:01下载
    积分:1
  • hope
    变步长网格,声波方程,有限差分数值模拟程序,二阶(Variable step mesh, acoustic equation, finite difference numerical simulation program, second order)
    2016-11-04 14:38:13下载
    积分:1
  • izuznk
    脉动风速功率谱估计,并与标准风谱进行对比(Power spectrum estimation of pulsating wind speed and comparison with standard wind spectrum)
    2018-11-12 16:57:07下载
    积分:1
  • LINGO11汉化无限变量版
    MATLAB的一个使用工具箱,LINGO11汉化无限变量版。(A toolbox of MATLAB, LINGO11 Chinese Infinite Variable Edition.)
    2020-06-22 04:40:02下载
    积分:1
  • dcl2
    电磁炉原理及维修请大家参考,如有问题,请与我联系(Induction Principle and maintenance please refer to, if there are questions, please contact me)
    2007-11-15 23:39:14下载
    积分:1
  • FDTD2D_UPML
    二阶精度的FDTD正演算法,可用于井间电磁波探测模拟(The accuracy of the second order FDTD are algorithm Can be used to detect simulation between Wells electromagnetic waves )
    2020-10-07 20:47:37下载
    积分:1
  • 矩量法
    适合运用fortran语言学习的人使用,对矩量法的公式进行了详细说明,有助于加深对矩量法的理解(Suitable for the use of FORTRAN language learning people use, the formula of the method of moments are described in detail, help to deepen the understanding of the method of moments)
    2021-02-02 21:49:59下载
    积分:1
  • GaussFitting
    高斯拟合程序,采用高斯函数拟合数据,获得拟合高斯函数的平均值和方差。(Gaussian fitting procedure, using Gaussian function fitting the data, fitting Gaussian function to obtain the mean and variance.)
    2011-10-17 19:44:18下载
    积分: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
  • JFFTfinalA
    使用JAVA模拟FFFT算法 快速傅里叶算法 (Use JAVA simulation FFFT algorithm Fast Fourier Transform Algorithm)
    2012-07-18 19:04:47下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载