• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A fast numerical algorithm for solving nearly penta-diagonal linear systems.

Ji-Teng JiaQiong-xiang KongTomohiro Sogabe
Published in: Int. J. Comput. Math. (2012)
Keyphrases
  • linear systems
  • optimization algorithm
  • k means
  • learning algorithm
  • dynamic programming
  • clustering method
  • optimal solution
  • convergence rate
  • sparse linear systems
  • search algorithm
  • np hard