A generalization of the implicit LU algorithm to an arbitrary initial matrix.
Emilio SpedicatoM. ZhuPublished in: Numer. Algorithms (1999)
Keyphrases
- preprocessing
- probabilistic model
- detection algorithm
- optimization algorithm
- optimal solution
- worst case
- computational cost
- dynamic programming
- search space
- times faster
- high accuracy
- k means
- cost function
- np hard
- experimental evaluation
- matrix multiplication
- theoretical analysis
- improved algorithm
- initial set
- computationally efficient
- computational complexity
- neural network
- scheduling problem
- significant improvement
- matching algorithm
- convergence rate
- learning algorithm
- similarity matrix
- data sets