Recursive algorithm for arrays of generalized Bessel functions: Numerical access to Dirac-Volkov solutions

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 5 figures

Scientific paper

10.1103/PhysRevE.79.026707

In the relativistic and the nonrelativistic theoretical treatment of moderate and high-power laser-matter interaction, the generalized Bessel function occurs naturally when a Schr\"odinger-Volkov and Dirac-Volkov solution is expanded into plane waves. For the evaluation of cross sections of quantum electrodynamic processes in a linearly polarized laser field, it is often necessary to evaluate large arrays of generalized Bessel functions, of arbitrary index but with fixed arguments. We show that the generalized Bessel function can be evaluated, in a numerically stable way, by utilizing a recurrence relation and a normalization condition only, without having to compute any initial value. We demonstrate the utility of the method by illustrating the quantum-classical correspondence of the Dirac-Volkov solutions via numerical calculations.

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

Recursive algorithm for arrays of generalized Bessel functions: Numerical access to Dirac-Volkov solutions 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 Recursive algorithm for arrays of generalized Bessel functions: Numerical access to Dirac-Volkov solutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursive algorithm for arrays of generalized Bessel functions: Numerical access to Dirac-Volkov solutions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-251818

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