zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Evaluating of Dawson’s integral by solving its differential equation using orthogonal rational Chebyshev functions. (English) Zbl 1157.65331
Summary: Dawson’s integral is u(y)exp(-y 2 ) 0 y exp(z 2 )dz. We show that by solving the differential equation du/dy+2yu=1 using the orthogonal rational Chebyshev functions of the second kind, SB 2n (y;L), which generates a pentadiagonal Petrov-Galerkin matrix, one can obtain an accuracy of roughly (3/8)N digits where N is the number of terms in the spectral series. The SB series is not as efficient as previously known approximations for low to moderate accuracy. However, because the N-term approximation can be found in only O(N) operations, the new algorithm is the best arbitrary-precision strategy for computing Dawson’s integral.
65D20Computation of special functions, construction of tables
33B20Incomplete beta and gamma functions
33F05Numerical approximation and evaluation of special functions