Login / Signup

Computing entries of the inverse of a sparse matrix using the FIND algorithm.

Song LiShaikh S. AhmedGerhard KlimeckEric Darve
Published in: J. Comput. Phys. (2008)
Keyphrases
  • sparse matrix
  • k means
  • learning algorithm
  • optimal solution
  • dynamic programming
  • sparse linear
  • clustering method
  • knapsack problem