The Chandrasekhar function revisited

Published: 01-01-2015| Version 1 | DOI: 10.17632/7x3grtx6db.1
Aleksander Jablonski


Abstract The need for an accurate (better than 10 significant digits) and fast algorithm for calculating the Chandrasekhar function, H ( μ , ω ) , has stimulated the present analysis of different solutions of the relevant integral equation. It has been found that a very accurate analytical solution can be derived that is conveniently used in the range of small arguments, μ and ω . In a limited range of arguments, the H function can be expressed in terms of a rapidly converging series of Bernoulli cons... Title of program: CHANDRAS_MIX Catalogue Id: AEWW_v1_0 Nature of problem Algorithms derived from an integral representation of the H function generally exhibit a slow convergence which may considerably delay calculations involving integration of functions containing the H function. Furthermore, a set of reference values of the H function of a very high accuracy is useful in analysis of performance of different algorithms, and thus a relevant computational procedure is needed for that purpose. Versions of this program held in the CPC repository in Mendeley Data AEWW_v1_0; CHANDRAS_MIX; 10.1016/j.cpc.2015.05.012 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)