An implementation of a divide and conquer algorithm for the unitary eigen problem.
Greg S. AmmarLothar ReichelDanny C. SorensenPublished in: ACM Trans. Math. Softw. (1992)
Keyphrases
- computational complexity
- improved algorithm
- preprocessing
- k means
- experimental evaluation
- learning algorithm
- recognition algorithm
- times faster
- computationally efficient
- single pass
- parallel implementation
- search space
- data sets
- computational cost
- worst case
- cost function
- theoretical analysis
- optimization algorithm
- tree structure
- dynamic programming
- hardware implementation
- matching algorithm
- hardware architecture
- selection algorithm
- optimal solution
- path planning
- particle swarm optimization
- np hard