Finding zeros of a polynomial by the Q-D algorithm.
Peter HenriciBruce O. WatkinsPublished in: Commun. ACM (1965)
Keyphrases
- experimental evaluation
- learning algorithm
- high accuracy
- computational cost
- computational complexity
- search space
- detection algorithm
- worst case
- improved algorithm
- cost function
- times faster
- optimization algorithm
- probabilistic model
- theoretical analysis
- expectation maximization
- single pass
- clustering method
- simulated annealing
- neural network
- objective function
- dynamic programming
- linear programming
- computationally efficient
- input image
- feature selection
- ant colony optimization
- tree structure
- path planning
- np hard
- recognition algorithm
- selection algorithm
- significant improvement
- k means