Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Algorithms and Codes for the Macdonald Function: Recent Progress and Comparisons

Published

Author(s)

B R. Fabijonas, Daniel W. Lozier, J M. Rappoport

Abstract

The modified Bessel function Kχ, also known as the Macdonald function, finds application in the Kontorovich-Lebedev integral transform when χ 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 independently of the other two through Wronskian checks, and therefore is used as a standard against which the others are compared.
Citation
NIST Interagency/Internal Report (NISTIR) - 6596
Report Number
6596
Volume
161

Keywords

Bessel functions, computation of special functions, Macdonald function

Citation

Fabijonas, B. , Lozier, D. and Rappoport, J. (2003), Algorithms and Codes for the Macdonald Function: Recent Progress and Comparisons, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD (Accessed October 16, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created January 31, 2003, Updated October 12, 2021
Was this page helpful?