Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
Anton LeykinJan VerscheldePublished in: CoRR (2005)
Keyphrases
- optimal solution
- optimization algorithm
- detection algorithm
- optimization method
- improved algorithm
- experimental evaluation
- objective function
- high accuracy
- parallel implementation
- computational cost
- matching algorithm
- worst case
- linear programming
- search strategy
- times faster
- learning algorithm
- iterative algorithms
- polynomially bounded
- probabilistic model
- dynamic programming
- k means
- evolutionary algorithm
- computational complexity
- simulated annealing
- closed form
- solution space
- search algorithm
- linear systems
- similarity measure
- parallel version
- neural network