🚀 go-pugleaf

In article <1993Jan26.100935.113272@eratu.rz.uni-konstanz.de>, vaxinf@V36.CHEMIE.UNI-KONSTANZ.DE () writes:
|> 
|> In article <1993Jan25.201447.2082@athena.mit.edu>, cai@athena.mit.edu (Liang-Wu Cai) writes:
|> |>Dear netter,
|> |>
|> |> I am in need (badly) of an accurate algorithm Bessel functions of various 
|> |>kinds with real argument and integer order. What I need actually is a 
|> |>algorithm which is able to provide the result with at least 7 significant 
|> |>digits for J_n (z) and Y_n (z) with n <=100 and z <= 100.
|> 
|> Look into Abromowitz/Stegun Handbook of Mathamatical Functions:
|> 
|> 1.) set j(100)=0
|> 2.) set j(99)=1
|> 3.) do recursion to j(0)
|> 4.) calculate the true j(0) in order to define a normalisation faktor
|> 5.) Multiply all value with that factor
|> 
|> You get all values J(0)...j(100) in that way.
|> 
|> Eberhard Heuser-Hofmann

This algorithm (Miller algorithm)
is based on a recurrence relation for besselfunctions.
You can find a detailed description in 

 Computation with recurrence relations
 / Jet Wimp
 Boston a.o. : Pitman, 1984
 XII, 310 p. : tab. ; 24 cm
 (Applicable mathematics series)
 ISBN 0-273-08508-5

Tilo