A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system.
Joan-Josep ClimentCarmen PereaLeandro TortosaAntonio ZamoraPublished in: Appl. Math. Comput. (2004)
Keyphrases
- linear systems
- learning algorithm
- dynamic programming
- linear complexity
- improved algorithm
- preprocessing
- optimization algorithm
- k means
- computational cost
- high accuracy
- np hard
- experimental evaluation
- computational complexity
- cost function
- expectation maximization
- times faster
- reinforcement learning
- optimal solution
- piecewise linear
- closed form
- parallel algorithm
- matching algorithm
- ant colony optimization
- clustering method
- detection algorithm
- search space
- theoretical analysis
- computationally efficient
- worst case
- least squares
- knn
- probabilistic model