A compound matrix algorithm for the computation of the Smith form of a polynomial matrix.
Marilena MitrouliGrigorios I. KalogeropoulosPublished in: Numer. Algorithms (1994)
Keyphrases
- dynamic programming
- square root
- experimental evaluation
- computational complexity
- significant improvement
- np hard
- linear programming
- matching algorithm
- preprocessing
- learning algorithm
- null space
- distance matrix
- sparse matrix
- genetic algorithm
- similarity matrix
- segmentation algorithm
- matrix multiplication
- simulated annealing
- probabilistic model
- computational cost
- cost function
- k means
- search space
- times faster
- singular value decomposition
- low rank
- eigendecomposition
- transformation matrix
- optimal solution
- objective function