...
首页> 外文期刊>The European physical journal, C. Particles and fields >Statistical hadronization and hadronic micro-canonical ensemble II
【24h】

Statistical hadronization and hadronic micro-canonical ensemble II

机译:统计强子化和强子微经典合奏

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We present a Monte Carlo calculation of the micro-canonical ensemble of the ideal hadron-resonance gas including all known states up to a mass of about 1.8 GeV and full quantum statistics. The micro-canonical average multiplicities of the various hadron species are found to converge to the canonical ones for moderately low values of the total energy, around 8 GeV, thus bearing out previous analyses of hadronic multiplicities in the canonical ensemble. The main numerical computing method is an importance sampling Monte Carlo algorithm using the product of Poisson distributions to generate multi-hadronic channels. It is shown that the use of this multi-Poisson distribution allows for an efficient and fast computation of averages, which can be further improved in the limit of very large clusters. We have also studied the fitness of a previously proposed computing method, based on the Metropolis Monte Carlo algorithm, for event generation in the statistical hadronization model. We find that the use of the multi-Poisson distribution as proposal matrix dramatically improves the computation performance. However, due to the correlation of subsequent samples, this method proves to be generally less robust and effective than the importance sampling method.
机译:我们提出了理想强子共振气体的微经典集合体的蒙特卡洛计算,包括质量高达1.8 GeV的所有已知状态以及完整的量子统计。对于总能量的中等较低值(约8 GeV),发现各种强子物种的微规范平均多重性收敛于规范者,从而排除了先前对规范集合中强子多重性的分析。主要的数值计算方法是使用Poisson分布的乘积来生成多强子通道的重要性采样蒙特卡洛算法。结果表明,使用这种多重泊松分布可以高效,快速地计算平均值,并且可以在非常大的群集范围内进一步提高平均值。我们还研究了基于Metropolis蒙特卡洛算法的先前提出的计算方法在统计强子化模型中用于事件生成的适用性。我们发现使用多泊松分布作为提案矩阵可以极大地提高计算性能。但是,由于后续样本的相关性,该方法通常被证明比重要性抽样方法更不可靠和有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号