Fast and Accurate Bessel Function Computation
... the idea of expanding around zeros at face value. We don’t need to do any kind of computation of zeros at runtime, but can just pre-tabulate the zeros z1 , z2 , . . . zN , since there aren’t so many in range. Then at runtime, given an input x we start by reducing the input argument x to r = x − zk , ...
... the idea of expanding around zeros at face value. We don’t need to do any kind of computation of zeros at runtime, but can just pre-tabulate the zeros z1 , z2 , . . . zN , since there aren’t so many in range. Then at runtime, given an input x we start by reducing the input argument x to r = x − zk , ...
