Fourth-Order Algorithms for Solving the Imaginary Time Gross-Pitaevskii Equation in a Rotating Anisotropic Trap

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages with 3 figures, revised figures with the use of the Lambert W-function for doing the self-consistent iterations. Publ

Scientific paper

10.1103/PhysRevE.72.036705

By implementing the exact density matrix for the rotating anisotropic harmonic trap, we derive a class of very fast and accurate fourth order algorithms for evolving the Gross-Pitaevskii equation in imaginary time. Such fourth order algorithms are possible only with the use of {\it forward}, positive time step factorization schemes. These fourth order algorithms converge at time-step sizes an order-of-magnitude larger than conventional second order algorithms. Our use of time-dependent factorization schemes provides a systematic way of devising algorithms for solving this type of nonlinear equations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Fourth-Order Algorithms for Solving the Imaginary Time Gross-Pitaevskii Equation in a Rotating Anisotropic Trap 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 Fourth-Order Algorithms for Solving the Imaginary Time Gross-Pitaevskii Equation in a Rotating Anisotropic Trap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fourth-Order Algorithms for Solving the Imaginary Time Gross-Pitaevskii Equation in a Rotating Anisotropic Trap will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-350022

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.