The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots.
H. MöllerPublished in: Probl. Inf. Transm. (2015)
Keyphrases
- theoretical analysis
- computationally efficient
- computational cost
- single pass
- k means
- detection algorithm
- worst case
- expectation maximization
- computational complexity
- preprocessing
- cost function
- experimental evaluation
- dynamic programming
- matching algorithm
- closed form
- np hard
- learning algorithm
- times faster
- randomized approximation
- highly efficient
- efficient computation
- clustering method
- linear programming
- significant improvement
- high efficiency
- optimal solution
- objective function
- approximation ratio
- error tolerance
- similarity measure