All of the matrices in NLP are large sparse matrices (larger than $1M$ in $850K$). I want to decompose such matrices by the fastest method. Which one is the best method for decomposition of a sparse rectangular matrix: LU or Cholesky?
I mean: what's the best method in theoretical?