Algorithm comparisons for Stark-profile calculations

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.