Abstract
The efficiency of several algorithms to calculate Stark broadened line shapes in the quasi-static ion approximation is compared. The algorithms can be grouped into three general approaches: simultaneous equation solvers, matrix decompositions, and model-reduction. It is emphasized that the tested algorithms do not rely on approximations beyond the quasi-static ion assumption. The comparisons show that model-reduction schemes are the most efficient and are more than 2 orders of magnitude faster than the conventional method for large-scale calculations. Consequently, complex line shape calculations become practical without the compromises often required in the past.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
