Loss and Recapture of Orthogonality in the Modified Gram-Schmidt Algorithm.
Åke BjörckChristopher C. PaigePublished in: SIAM J. Matrix Anal. Appl. (1992)
Keyphrases
- times faster
- dynamic programming
- experimental evaluation
- cost function
- recognition algorithm
- computational cost
- computational complexity
- improved algorithm
- detection algorithm
- learning algorithm
- high accuracy
- optimal solution
- objective function
- single pass
- experimental study
- k means
- estimation algorithm
- worst case
- theoretical analysis
- segmentation algorithm
- input data
- matching algorithm
- memory requirements
- aggregating algorithm
- gradient projection
- tree structure
- clustering method
- computationally efficient
- simulated annealing
- hidden markov models
- search algorithm
- multiscale
- similarity measure
- image sequences