A rapid and highly accurate approximation for the error function of complex argument
Abstract
We present efficient approximation of the error function obtained by Fourier expansion of the exponential function [- (t - 2 σ)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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.