A rapid and highly accurate approximation for the error function of complex argument
classification
🧮 math.NA
cs.NA
keywords
errorfunctionapproximationaccuratehighlyrapidalgorithmanalysis
read the original abstract
We present efficient approximation of the error function obtained by Fourier expansion of the exponential function $\exp [{- {(t - 2 \sigma)^2}/4}]$. The error analysis reveals that it is highly accurate and can generate numbers that match up to the last decimal digits with reference values. Due to simple representation the proposed error function approximation can be utilized in a rapid algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.