A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix.
Hashem Saberi NajafiE. KhaleghiPublished in: Appl. Math. Comput. (2004)
Keyphrases
- high accuracy
- dynamic programming
- objective function
- cost function
- recognition algorithm
- significant improvement
- preprocessing
- detection algorithm
- synthetic and real images
- detection method
- improved algorithm
- clustering method
- experimental evaluation
- computational complexity
- k means
- computationally efficient
- optimization algorithm
- estimation algorithm
- computational cost
- support vector machine svm
- matching algorithm
- optimization method
- convergence rate
- input data
- similarity measure
- transformation matrix
- eigendecomposition
- segmentation method
- theoretical analysis
- tree structure
- covariance matrix
- segmentation algorithm
- selection algorithm
- learning algorithm
- decomposition method
- classification method
- distance matrix
- correlation matrix
- optimal solution
- sparse matrix
- projection matrix
- qr decomposition
- similarity matrix
- principal components
- classification algorithm
- energy function
- em algorithm
- probabilistic model
- matrix representation
- expectation maximization