Login / Signup

A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations.

Davod Khojasteh SalkuyehSaeed KarimiFaezeh Toutounian
Published in: Appl. Math. Comput. (2006)
Keyphrases
  • parallel algorithm
  • sparse matrix
  • coefficient matrix
  • binary search trees
  • high dimensional
  • sparse representation
  • parallel programming
  • orthogonal matrices
  • input image
  • mobile agents
  • low rank