A new framework for implicit restarting of the Krylov-Schur algorithm.
Zvonimir BujanovicZlatko DrmacPublished in: Numer. Linear Algebra Appl. (2015)
Keyphrases
- dynamic programming
- times faster
- optimal solution
- np hard
- matching algorithm
- detection algorithm
- k means
- significant improvement
- selection algorithm
- bayesian framework
- probabilistic model
- theoretical analysis
- computational cost
- tree structure
- expectation maximization
- particle swarm optimization
- high accuracy
- learning algorithm
- objective function
- similarity measure
- convex hull
- improved algorithm
- classification algorithm
- segmentation algorithm
- linear programming
- experimental evaluation
- cost function
- preprocessing