Algorithms and codes for the Macdonald function: recent progress and comparisons
The modified Bessel function K i ν ( x), also known as the Macdonald function, finds application in the Kontorovich–Lebedev integral transform when x and ν are real and positive. In this paper, a comparison of three codes for computing this function is made. These codes differ in algorithmic approac...
Uložené v:
| Vydané v: | Journal of computational and applied mathematics Ročník 161; číslo 1; s. 179 - 192 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.12.2003
|
| Predmet: | |
| ISSN: | 0377-0427, 1879-1778 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | The modified Bessel function
K
i
ν
(
x), also known as the
Macdonald function, finds application in the Kontorovich–Lebedev integral transform when
x and
ν are real and positive. In this paper, a comparison of three codes for computing this function is made. These codes differ in algorithmic approach, timing, and regions of validity. One of them can be tested independent of the other two through Wronskian checks, and therefore is used as a standard against which the others are compared. |
|---|---|
| Bibliografia: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0377-0427 1879-1778 |
| DOI: | 10.1016/S0377-0427(03)00596-X |