登录
首页 » Fortran » MatricInvers

MatricInvers

于 2012-11-12 发布 文件大小:1KB
0 75
下载积分: 1 下载次数: 23

代码说明:

  求给定矩阵的逆矩阵和行列式值。已经经过测试,与matlab做了对比,计算结果可靠(Seeking a given matrix inverse matrix and determinant value. Has been tested with Matlab contrast, reliable calculation results)

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

发表评论

0 个回复

  • neff_m72
    改程序是计算出金属表面等离子体直波导的有效折射率随波长和传输长度随波的两色散曲线,另外给定Drude-Lorentzia模型参数给定后,还可以求解介电常数以及画出相应实部和虚部的曲线(This programer is used to calculate Ag relative dielectric constant accroding to the Drude-Lorentzia and sovle the transcendental equation for even illumination. At the same time,it can draw the diagram of relationship between the dispersion curve and the Transmission with the length. )
    2012-10-18 20:33:53下载
    积分:1
  • program3
    早期的圆柱绕流程序,用fortran语言编写,用来了解早期绕流流动的发展(flow around the cylinder)
    2011-06-22 16:06:03下载
    积分:1
  • SQP方法
    序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一,传统的SQP算法每一步迭代都要求解QP子问题。   (Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration for every iteration.)
    2020-10-06 16:07:38下载
    积分:1
  • fft
    计算fft,输出频谱,相位,模值,Calculation of FFT, the output frequency, phase, amplitude,
    2021-03-05 15:29:32下载
    积分:1
  • n_queen_QS4
    利用QS4算法解决N皇后问题,解决300万的皇后所需时间在5s左右,特别快(Use QS4 algorithm to solve the N-queens problem, solve 3000000 Queen the time required for about 5s, particularly fast)
    2020-11-29 21:29:27下载
    积分:1
  • FENZHI
    分支界限费用矩阵的说明文档,非常实用,建议下载哦(Branch line cost matrix documentation, very practical, it is recommended to download Oh)
    2013-09-13 14:24:50下载
    积分: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
  • ieee33
    应用牛顿法的直角坐标系下的33节点潮流计算(33 node flow calculation)
    2011-08-03 15:21:50下载
    积分:1
  • fatigue
    abaqus二次开发UMAT在损伤方面的应用(ABAQUS two development of UMAT in the application of damage)
    2018-01-24 13:20:07下载
    积分:1
  • split_step_fourier_method
    说明:  使用分布傅立叶法计算非线性薛定谔方程。可以得到光纤非线性传输特性。(Fourier method using the distribution of nonlinear Schr枚dinger equation. Can be non-linear optical transmission characteristics.)
    2008-10-14 09:34:16下载
    积分:1
  • 696518资源总数
  • 104226会员总数
  • 29今日下载