An algorithm for computing a Padé approximant with minimal degree denominator.
Olga L. IbryaevaVictor M. AdukovPublished in: J. Comput. Appl. Math. (2013)
Keyphrases
- experimental evaluation
- detection algorithm
- high accuracy
- times faster
- single pass
- expectation maximization
- optimal solution
- computational complexity
- optimization algorithm
- experimental study
- particle swarm optimization
- computational efficiency
- dynamic programming
- np hard
- cost function
- significant improvement
- search space
- preprocessing
- convex hull
- objective function
- improved algorithm
- path planning
- recognition algorithm
- image processing
- worst case
- computational cost
- data structure
- similarity measure
- theoretical analysis
- computationally efficient
- energy function
- simulated annealing
- memory requirements
- reinforcement learning
- space complexity
- learning algorithm