Algorithms to solve the (quantum) Sutherland model
2001 (English)In: Journal of Mathematical Physics, ISSN 0022-2488, E-ISSN 1089-7658, Vol. 42, no 9, 4148-4157 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2001. Vol. 42, no 9, 4148-4157 p.
IdentifiersURN: urn:nbn:se:kth:diva-20894ISI: 000170590300009OAI: oai:DiVA.org:kth-20894DiVA: diva2:339591
QC 201005252010-08-102010-08-10Bibliographically approved