When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
Michael SagraloffPublished in: CoRR (2011)
Keyphrases
- computational cost
- improved algorithm
- detection algorithm
- significant improvement
- learning algorithm
- experimental evaluation
- similarity measure
- theoretical analysis
- probabilistic model
- dynamic programming
- computational complexity
- preprocessing
- optimal solution
- high accuracy
- path planning
- classification algorithm
- objective function
- clustering method
- simulated annealing
- expectation maximization
- ant colony optimization
- neural network
- segmentation algorithm
- worst case
- least squares
- data sets
- np hard
- multi objective
- search space