An algorithm to find the smallest possible values in a matrix to satisfy the M-matrix condition.
Taicheng YangPublished in: IEEE Trans. Autom. Control. (1997)
Keyphrases
- theoretical analysis
- preprocessing
- cost function
- dynamic programming
- worst case
- square root
- matching algorithm
- k means
- learning algorithm
- optimal solution
- computational complexity
- significant improvement
- experimental evaluation
- high accuracy
- expectation maximization
- np hard
- optimization algorithm
- clustering method
- coefficient matrix
- times faster
- rows and columns
- distance matrix
- convergence rate
- pseudo inverse
- sparse matrix
- null space
- projection matrix
- singular values
- convex hull
- singular value decomposition
- detection algorithm
- computational cost
- objective function
- clustering algorithm