登录
首页 » matlab » 狄拉克半金属

狄拉克半金属

于 2020-12-22 发布
0 260
下载积分: 1 下载次数: 0

代码说明:

说明:  狄拉克半金属的相对介电常数实部,用于CST仿真(Dirac semimetal real part of relative permittivity)

文件列表:

Real_meV.m, 1779 , 2020-06-09
Imag_meV.txt, 52000 , 2020-06-11

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

发表评论

0 个回复

  • DOS下利用VESA调用更改显示刷新频率
    DOS下利用VESA调用更改显示刷新频率-DOS using VESA changes show called high frequency
    2022-08-14 21:34:28下载
    积分:1
  • umatcrystal_mod
    说明:  基于fortran语言开发的abaqus的晶体塑性用户子程序(User subroutine of crystal plasticity based on ABAQUS)
    2020-04-09 16:27:13下载
    积分:1
  • PowerBuilder function set, the usefulness of small, but do not know if this is n...
    powerbuilder的函数集合,这个用处不小,不知道这里是不是需要。-PowerBuilder function set, the usefulness of small, but do not know if this is not necessary.
    2022-08-10 02:09:54下载
    积分:1
  • Pragmatic Guide to Subversion
    项目开发用到的版本控制软件SVN,介绍一些实际操作,易懂(SVN, the version control software used in the project development, introduces some practical operations and is easy to understand)
    2020-06-22 06:20:01下载
    积分:1
  • 星点飘散Flash特效,跟着鼠标移动
    一个Flash视觉特效,星点飘散Flash特效,跟着鼠标移动,支持自我复制功能,随着鼠标的晃动,小星星会越来越多,鼠标跟随的一种。
    2023-05-02 23:35:04下载
    积分:1
  • 头行结构
    说明:  实现头行结构,使用lwm,lsc 来实现(Implement header structure, using lwm, LSC to achieve)
    2020-06-21 01:20:08下载
    积分:1
  • ET199 dog
    说明:  ET199 dongle tools ,write or read
    2020-06-02 13:33:05下载
    积分:1
  • Recursos-Adicionales2
    说明:  Segunda parte de inteligencia artificial
    2020-08-18 04:18:45下载
    积分:1
  • 遗传算法求解多旅行商问题
    说明:  旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
    2020-06-17 11:00:02下载
    积分:1
  • 05_fft
    说明:  基于matlab分析程序的FFT,其功能通过FFT实现振动信号的频谱分析(Based on MATLAB analysis program FFT, its function through FFT vibration signal spectrum analysis)
    2021-03-07 14:39:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载