Bounds and algorithms for the -Bessel function of imaginary order.
Andrew R. BookerAndreas StrömbergssonHolger ThenPublished in: LMS J. Comput. Math. (2013)
Keyphrases
- times faster
- learning algorithm
- evolutionary algorithm
- significant improvement
- orders of magnitude
- worst case
- scale space
- upper and lower bounds
- lower and upper bounds
- optimization problems
- upper bound
- computational cost
- computational complexity
- machine learning
- computationally efficient
- theoretical analysis
- machine learning algorithms
- computational efficiency
- recently developed
- error bounds
- genetic algorithm