Gradient Symplectic Algorithms for Solving the Schroedinger Equation with Time-Dependent Potentials

Physics – Nuclear Physics – Nuclear Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 3 figures, 1 table, submitted to J. Chem. Phys

Scientific paper

10.1063/1.1485725

We show that the method of factorizing the evolution operator to fourth order with purely positive coefficients, in conjunction with Suzuki's method of implementing time-ordering of operators, produces a new class of powerful algorithms for solving the Schroedinger equation with time-dependent potentials. When applied to the Walker-Preston model of a diatomic molecule in a strong laser field, these algorithms can have fourth order error coefficients that are three orders of magnitude smaller than the Forest-Ruth algorithm using the same number of Fast Fourier Transforms. When compared to the second order split-operator method, some of these algorithms can achieve comparable convergent accuracy at step sizes 50 times as large. Morever, we show that these algorithms belong to a one-parameter family of algorithms, and that the parameter can be further optimized for specific applications.

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

Gradient Symplectic Algorithms for Solving the Schroedinger Equation with Time-Dependent Potentials 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 Gradient Symplectic Algorithms for Solving the Schroedinger Equation with Time-Dependent Potentials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gradient Symplectic Algorithms for Solving the Schroedinger Equation with Time-Dependent Potentials will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-76016

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