Simulating Bessel random variables
In this paper, we discuss efficient exact random variate generation for the Bessel distribution. The expected time of the algorithm is uniformly bounded over all choices of the parameters, and the algorithm avoids any computation of Bessel functions or Bessel ratios.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 57 (2002)
Issue (Month): 3 (April)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lin Yuan & John Kalbfleisch, 2000. "On the Bessel Distribution and Related Problems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 52(3), pages 438-447, September.