Abstract

A new implementation of Humlicek's algorithm for approximating the Voigt profile function is proposed and compared with several other implementations with respect to computational speed. On scalar computers this new implementation is considerably faster than other implementations by more than a factor 3.3 on average. However, on the vector computer the acceleration between the new implementation and a fully vectorized implementation of Schreier is only between 1.2 and 1.8, depending on the region of the x, y-space under consideration.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.