诱导联络的平行移动的近似计算
Approximating the parallel transport of an induced connection
AI总结:
本文提出一种精度最高达4阶且对子丛平凡化选择不敏感的数值方法,用于近似计算诱导联络的平行移动算子,源于skyrmion计算问题并可推广至计算几何。
摘要:
本文提出了高效的数值方法,用于近似计算向量丛子丛上诱导联络的平行移动算子。这些方法比直接应用Runge--Kutta算法更简单,精度最高可达4阶。它们具有一个理想的性质:对子丛的平凡化选择不敏感。这些方法是为了解决使用Atiyah--Manton--Sutcliffe和Atiyah--Drinfeld--Hitchin--Manin构造计算skyrmion的问题而开发的,但也适用于计算几何中更广泛的一类问题。
英文摘要:
Efficient numerical methods to approximate the parallel transport operators of the induced connection on a sub-bundle of a vector bundle are presented. These methods are simpler than naive applications of a Runge--Kutta algorithm, and have accuracy up to order 4. They have the desirable property of being insensitive to choices of trivialisation of the sub-bundle. The methods were developed in order to solve a problem of computing skyrmions using the Atiyah--Manton--Sutcliffe and Atiyah--Drinfeld--Hitchin--Manin constructions, but are applicable to a broader range of problems in computational geometry.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。