Algorithms to solve the (quantum) Sutherland model
Algorithms to solve the (quantum) Sutherland model
复制标题
求解（量子）Sutherland 模型的算法
DOI：
10.1063/1.1389472
复制
发表时间：
2001
影响因子：
1.3
通讯作者：
E. Langmann
中科院分区：
文献类型：
--
作者：
E. Langmann
我们给出了两种不同算法的独立演示和比较，以明确求解不可区分粒子在圆周上移动并与 1/sin2 型二体势相互作用的量子多体模型。第一个算法因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/sin2-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.