2018
DOI: 10.1016/j.amc.2017.10.032
|View full text |Cite
|
Sign up to set email alerts
|

A rational approximation of the Dawson’s integral for efficient computation of the complex error function

Abstract: 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 ∼ 10 −14 in the domain of practical importance 0 ≤ y < 0.1 ∩ |x + iy| ≤ 8. A Matlab code for computation of the complex error function with entire coverage of the complex plane is presented.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
30
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(31 citation statements)
references
References 47 publications
1
30
0
Order By: Relevance
“…We applied the highly accurate MATLAB function fadsamp.m shown in our recent paper [34] as a subroutine for this purpose (see a brief description of this method in Appendix B). Alternatively, a MATLAB function file that is highly accurate and suitable for computation of the interpolating grid-points can be found in [35] (these two codes can also be downloaded from the Matlab Central websites [36] and [37], respectively). Highly accurate C/C++ implementation by Johnson [29] with MEX plugins for MATLAB [38] can also be used for a subroutine that can be invoked from the MATLAB environment to compute these 1587 interpolating grid-points.…”
Section: Algorithmic Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…We applied the highly accurate MATLAB function fadsamp.m shown in our recent paper [34] as a subroutine for this purpose (see a brief description of this method in Appendix B). Alternatively, a MATLAB function file that is highly accurate and suitable for computation of the interpolating grid-points can be found in [35] (these two codes can also be downloaded from the Matlab Central websites [36] and [37], respectively). Highly accurate C/C++ implementation by Johnson [29] with MEX plugins for MATLAB [38] can also be used for a subroutine that can be invoked from the MATLAB environment to compute these 1587 interpolating grid-points.…”
Section: Algorithmic Implementationmentioning
confidence: 99%
“…This implementation is known to be the fastest C/C++ program. It represents a modified Algorithm 680 [32,33] with inclusion of the Salzer's approximations [35] (see also [39]). As the computation complexity prevails at smaller values of the parameter y, we imply that it is close to zero, say y = 10 −5 .…”
Section: Figures 1a and 1bmentioning
confidence: 99%
“…Similar to our previous work [7] we applied only three approximations bounded inside domains as shown in Fig. 1; in fact, due to symmetric properties of the complex error function…”
Section: Approximations and Boundariesmentioning
confidence: 99%
“…Approximation (7) contains poles that can be readily found by solving the following quadratic equation…”
Section: Location Of Polesmentioning
confidence: 99%
See 1 more Smart Citation