Abstract

In this paper a new fitting algorithm which works with Voigt functions is discussed. The fitting algorithm used is an extension of the rapidly convergent gradient method of Fletcher and Powell, who claim faster convergence than the Newton-Raph-son method which has been used by Chang and Shaw for fitting Lorentz line widths. The Fletcher and Powell algorithm involves the effects of second derivatives although second derivatives are not explicitly calculated. In our algorithm, first and second derivatives are computed not numerically, but analytically via a modification to Drayson's Voigt function subroutine. This algorithm provides rapid convergence even when there are few data points. Profiles have been fitted with as few as five data points. Our typical line fits involve 40 points. The run time of the algorithm has been compared with the shrinking cube algorithm of Hillman and found to be at least 10 times faster under identical starting conditions. Sample single line and single line plus background are shown illustrating the speed and efficiency of the new algorithm, as well as the importance of good zero-order estimates to start the iterations.

New approximation to the Voigt function with applications to spectral-line profile analysis

John F. Kielkopf
J. Opt. Soc. Am. 63(8) 987-995 (1973)

Fourier based partial least squares algorithm: new insight into influence of spectral shift in “frequency domain”

H. Y. Bian, Y. L. Zhang, W. R. Gao, and J. Gao
Opt. Express 27(3) 2926-2936 (2019)

Spectral analysis for the generalized least squares phase-shifting algorithms with harmonic robustness

Sotero Ordones, Manuel Servin, Moises Padilla, Antonio Muñoz, Jorge L. Flores, and Ivan Choque
Opt. Lett. 44(9) 2358-2361 (2019)

Automated decomposition algorithm for Raman spectra based on a Voigt line profile model

Yunliang Chen and Liankui Dai
Appl. Opt. 55(15) 4085-4094 (2016)

Nonlinear least squares analysis of atmospheric absorption spectra

E. Niple
Appl. Opt. 19(20) 3481-3490 (1980)