An asymptotically superior algorithm for computing the characteristic polynomial of a tridiagonal matrix.
Hari KrishnaPublished in: Proc. IEEE (1988)
Keyphrases
- preprocessing
- learning algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- polynomially bounded
- matching algorithm
- linear programming
- computational cost
- cost function
- linear systems
- k means
- input data
- computationally efficient
- objective function
- optimal solution
- expectation maximization
- high accuracy
- probabilistic model
- computational complexity
- worst case
- data structure
- lower bound
- sample size
- bayesian networks
- times faster
- negative matrix factorization
- np hard
- qr decomposition
- genetic algorithm