Login / Signup

A computational algorithm for solving nearly penta-diagonal linear systems.

S. N. Neossi NguetchueShirley Abelman
Published in: Appl. Math. Comput. (2008)
Keyphrases
  • linear systems
  • np hard
  • learning algorithm
  • k means
  • real time
  • objective function
  • optimization algorithm
  • machine learning
  • sufficient conditions
  • clustering method
  • mathematical model
  • sparse linear systems