An Algorithm for Solving Sparse Sets of Linear Equations with an Almost Tri-Diagonal Structure on SIMD Computers.
Torstein OpsahlDennis ParkinsonPublished in: ICPP (1986)
Keyphrases
- linear equations
- gauss seidel method
- cost function
- learning algorithm
- parallel implementation
- objective function
- detection algorithm
- dynamic programming
- computational complexity
- search space
- tree structure
- graph structure
- sparse matrix
- optimal solution
- np hard
- linear programming
- expectation maximization
- convergence rate
- parallel processing
- k means
- probabilistic model
- particle swarm optimization
- optimization algorithm
- lower bound