A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix.
Samuel I. DaitchDaniel A. SpielmanPublished in: Combinatorial Scientific Computing (2009)
Keyphrases
- linear systems
- learning algorithm
- coefficient matrix
- worst case
- neural network
- quadratic programming
- dynamic programming
- computationally intensive
- optimization algorithm
- support vector machine svm
- sparse linear systems
- symmetric matrices
- manufacturing systems
- convergence rate
- dynamical systems
- sufficient conditions
- simulated annealing
- search space
- optimal solution
- objective function
- genetic algorithm