A note on a fast breakdown-free algorithm for computing the determinants and the permanents of k-tridiagonal matrices.
Tomohiro SogabeFatih YilmazPublished in: Appl. Math. Comput. (2014)
Keyphrases
- computational complexity
- learning algorithm
- np hard
- detection algorithm
- computational cost
- worst case
- improved algorithm
- times faster
- preprocessing
- significant improvement
- computationally efficient
- experimental evaluation
- linear programming
- image segmentation
- tree structure
- high accuracy
- dynamic programming
- cost function
- objective function
- mobile robot
- input data
- theoretical analysis
- optimization algorithm
- search space
- data structure
- convex hull
- recognition algorithm
- linear systems