A simple algorithm, based on recursive quadratic optimization, is suggested for the numerical inversion of integral transforms. The algorithm was found particularly useful for ''small scale'' problems, with the number of independent parameters ranging between 100 and 200. The programming, parameterization, and performance of the algorithm are discussed, as well its application to the analysis of time-resolved luminescence data.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below