Fast Computation of Voigt Functions via Fourier Transforms
Marcus H. Mendenhall
Abstract
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the fourth power of the computational effort. Because of its use of highly vectorizable operations for its core, it can be implemented very efficiently in scripting language environments which provide fast vector libraries. The availability of the derivatives makes it suitable as a function generator for non-linear fitting procedures.
Create a lesson
Related papers
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá
Statistical validation of calorimeter inpainting with generative diffusion priors
Himanshu Raj, Roli Esha
Unknown Unknowns: Model Misspecification in Machine Learning for Physics
Juan Cruz-Martinez, Carolina Cuesta-Lazaro, Alexander Held et al.
Exploring new directions in enhancing the ACTS parameter optimization suite
Chance LaVoie, Qi Bin Lei, Rocky Bala Garg et al.
Analytically Consistent Reconstruction of Finite Data Using Padé Sequences
Emerson Díaz, Balma Duch, Pere Masjuan