相关论文: The Fourier expansion approximation for high-accur…
A rapidly convergent series, based on Taylor expansion of the imaginary part of the complex error function, is presented for highly accurate approximation of the Voigt/complex error function with small imaginary argument (Y less than 0.1).…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
In this work, we develop a method for rational approximation of the Fourier transform (FT) based on the real and imaginary parts of the complex error function \[ w(z) = e^{-z^2}(1 - {\rm{erf}}(-iz)) = K(x,y) + iL(x,y), \qquad z = x + iy, \]…
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…
In this paper we present two efficient approximations for the complex error function $w \left( {z} \right)$ with small imaginary argument $\operatorname{Im}{\left[ { z } \right]} < < 1$ over the range $0 \le \operatorname{Re}{\left[ { z }…
In this work we present a simple approximation for the Voigt/comp-lex error function based on fitting with set of the exponential functions of form ${\alpha _n}{\left| t \right|^n}{e^{ - {\beta _n}\left| t \right|}}$, where ${\alpha _n}$…
Using the theorem of residues Chiarella and Reichel derived a series that can be represented in terms of the complex error function (CEF). Here we show a simple derivation of this CEF series by Fourier expansion of the exponential function…
The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…
We present a rational approximation for the Dawson's integral of real argument and show how it can be implemented for accurate and rapid computation of the Voigt function at small $y < < 1$. The algorithm based on this approach enables…
This paper presents a new approach in application of the Fourier transform to the complex error function resulting in an efficient rational approximation. Specifically, the computational test shows that with only $17$ summation terms the…
We present an efficient multi-accuracy algorithm for the computations of a set of special functions of a complex argument, z=x+iy. These functions include the complex probability function w(z), and closely related functions such as the…
A new sampling methodology based on incomplete cosine expansion series is presented as an alternative to the traditional sinc function approach. Numerical integration shows that this methodology is efficient and practical. Applying the…
In this work we show a rational approximation of the Dawson's integral that can be implemented for high-accuracy computation of the complex error function in a rapid algorithm. Specifically, this approach provides accuracy exceeding $\sim…
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…
In this work we show how to perform a rapid computation of the Voigt/complex error over a single domain by vectorized interpolation. This approach enables us to cover the entire set of the parameters $x,y \in \mathbb{R}$ required for the…
Automatic algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. This paper describes an automatic, adaptive algorithm for approximating the solution to a…
Accurate yet efficient computation of the Voigt and complex error function is a challenge since decades in astrophysics and other areas of physics. Rational approximations have attracted considerable attention and are used in many codes,…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…
We develop the convergence theory for a well-known method for the interpolation of functions on the real axis with rational functions. Precise new error estimates for the interpolant are de- rived using existing theory for trigonometric…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…