...
首页> 外文期刊>Physical review, E >Globally optimal volume-trap arrangements for the narrow-capture problem inside a unit sphere
【24h】

Globally optimal volume-trap arrangements for the narrow-capture problem inside a unit sphere

机译:单位球体内部窄捕获问题的全局最佳音量陷阱布置

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

摘要

The determination of statistical characteristics for particles undergoing Brownian motion in constrained domains has multiple applications in various areas of research. This work presents an attempt to systematically compute globally optimal configurations of traps inside a three-dimensional domain that minimize the average of the mean first passage time (MFPT) for the narrow capture problem, the average time it takes a particle to be captured by any trap. For a given domain, the mean first passage time satisfies a linear Poisson problem with Dirichlet-Neumann boundary conditions. While no closed-form general solution of such problems is known, approximate asymptotic MFPT expressions for small traps in a unit sphere have been found. These solutions explicitly depend on trap parameters, including locations, through a pairwise potential function. After probing the applicability limits of asymptotic formulas through comparisons with numerical and available exact solutions of the narrow capture problem, full three-dimensional global optimization was performed to find optimal trap positions in the unit sphere for 2 ≤ N ≤ 100 identical traps. The interaction energy values and geometrical features of the putative optimal trap arrangements are presented.
机译:在受约束域中勃朗运动的粒子统计特征的测定具有多种研究领域的应用。这项工作提出了一种在三维域内系统地计算全局最佳配置,该三维域内的陷阱最小化平均捕获问题的平均第一通道时间(MFPT)的平均值,所以通过任何粒度捕获的平均时间陷阱。对于给定域,平均第一通道时间满足Dirichlet-Neumann边界条件的线性泊松问题。虽然未知出现这种问题的闭合形式的一般解决方案,但已经发现了单位球体中的小陷阱的近似渐近MFPT表达式。这些解决方案通过成对潜在功能明确依赖于陷阱参数,包括位置。通过对窄捕获问题的数值和可用精确解决方案的比较探测渐近公式的适用性限制,进行全三维全局优化,在单位球体中进行全局陷阱位置2≤N≤00个相同的陷阱。提出了推定的最佳陷阱布置的交互能量值和几何特征。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号