A rapid and highly accurate approximation for the error function of complex argument
S. M. Abrarov, B. M. Quine

TL;DR
This paper introduces a fast and precise approximation method for the error function of complex arguments using Fourier expansion, enabling high-accuracy computations suitable for rapid algorithms.
Contribution
It presents a novel Fourier-based approximation of the complex error function that achieves high accuracy and computational efficiency.
Findings
Matches reference values up to the last decimal digit
Highly accurate approximation demonstrated
Suitable for rapid computational algorithms
Abstract
We present efficient approximation of the error function obtained by Fourier expansion of the exponential function . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Digital Filter Design and Implementation · Computational Physics and Python Applications
