首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  免费   0篇
  国内免费   4篇
数学   1篇
物理学   4篇
  2023年   1篇
  2009年   1篇
  2008年   3篇
排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
Using the Glauber model, we discuss the number of binary nucleon-nucleon collisions in heavy-ion collisions. Based on the latter, after considering the effect of energy loss of the nucleons in multiple collisions, we derive the pseudorapidity distribution of the multiplicity as a function of the impact parameter in nucleus-nucleus collisions. Using this, we analyze the experimental measurements carried out by the BRAHMS Collaboration in Au+Au collisions at √sNN=200GeV. The results are in good agreement with the experimental observations.  相似文献   
2.
Using the Glauber model, we present the formulas for calculating the numbers of participants, spectators and binary nucleon-nucleon collisions. Based on this work, we get the pseudorapidity distributions of charged particles as the function of the impact parameter in nucleus-nucleus collisions. The theoretical results agree well with the experimental observations made by the BRAHMS Collaboration in Au+Au collisions at √^SNN=200 GeV in different centrality bins over the whole pseudorapidity range.  相似文献   
3.
Using the Glauber model,we discuss the number of binary nucleon-nucleon collisions in heavy-ion collisions.Based on the latter,after considering the effect of energy loss of the nucleons in multiple colli- sions,we derive the pseudorapidity distribution of the multiplicity as a function of the impact parameter in nucleus-nucleus collisions.Using this,we analyze the experimental measurements carried out by the BRAHMS Collaboration in Au Au collisions at Pseudorapidity distribution of multiplicity in Au Au collisions at (S_(NN))~(1/2)=200 GeV)=200 GeV.The results are in good agreement with the experi- mental observations.  相似文献   
4.
5.
本文提出了求解二阶锥绝对值方程组(SOCAVE)的非单调光滑牛顿算法.在适当的条件下分析了算法的全局收敛性和局部二次收敛性.数值结果表明用非单调光滑牛顿算法求解SOCAVE是可行且高效的.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号