On a fast and nearly division-free algorithm for the characteristic polynomial.
Fredrik JohanssonPublished in: CoRR (2020)
Keyphrases
- experimental evaluation
- selection algorithm
- computational cost
- learning algorithm
- single pass
- computational complexity
- times faster
- ant colony optimization
- detection algorithm
- dynamic programming
- particle swarm optimization
- worst case
- multiscale
- improved algorithm
- optimization algorithm
- high accuracy
- k means
- preprocessing
- search algorithm
- objective function
- scheduling problem
- computationally efficient
- segmentation algorithm
- probabilistic model
- significant improvement
- clustering method
- experimental study
- convergence rate
- optimal solution
- polynomially bounded