Physics – Mathematical Physics
Scientific paper
2001-04-27
J.Math.Phys.42 (2001) 4148-4157
Physics
Mathematical Physics
15 pages, LaTex
Scientific paper
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.
Langmann Edwin
No associations
LandOfFree
Algorithms to solve the Sutherland model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithms to solve the Sutherland model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms to solve the Sutherland model will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-437012