I have a system of fairly large set of linear equations (approximately 30K equations). I am using
scipy.sparse.spsolve to solve these equations. Initially, I tried with 10K equations, but my program got killed due to memory issue. In general, I would like to know the memory and time requirements of the
spsolve algorithm and exactly how the algorithm solves the system of equations. Is it based on factorization? Anyone can help me?
NB* - system of equations does not have a predefined structure like symmetricity etc, only thing is it is very sparse.