求解Sutherland模型的算法
Algorithms to solve the Sutherland model
摘要：
我们给出了一个自包含的介绍和比较两种不同的算法，明确解决量子多体模型的不可区分的粒子在一个圆圈上移动和相互作用的两体势的$1/\sin^2$型。第一个算法是由于Sutherland和众所周知的，第二个是一个新的算法，解决椭圆推广的Sutherland模型的限制情况。这两种算法在一些细节上是不同的。我们证明了它们是等价的，即，它们产生相同的解决方案并且同样简单。
英文摘要：
We give a self-contained presentation and comparison of two different algorithms to explicitly solve quantum many body models of indistinguishable particles moving on a circle and interacting with two-body potentials of $1/\sin^2$-type. The first algorithm is due to Sutherland and well-known; the second one is a limiting case of a novel algorithm to solve the elliptic generalization of the Sutherland model. These two algorithms are different in several details. We show that they are equivalent, i.e., they yield the same solution and are equally simple.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
