From: Dominique O. <dom...@gm...> - 2011-06-14 03:12:50
|
On Mon, Jun 13, 2011 at 10:41 PM, Oz Nahum Tiram <na...@gm...> wrote: > Thanks Dominique! > You where right, my matrix in this code was created so: > A=sp.pysparseMatrix.PysparseMatrix(size=numn) > > while in another code I created A so: > A = sp.spmatrix.ll_mat(m*n, m*n) > > I didn't notice this difference ... > > Your solution does work. Is it smarter to use one way or another ? > > One more thing, I thought of rewriting my code with the sparse modules from > scipy. > Which brought up the questions - > both codes are BSD, why is your code not there? > Are there differences in speed ? > Hi Oz, I just pushed improved wrappers for the iterative solvers to the 'suitesparse' branch of Pysparse (which is meant to become trunk in the near future). The wrappers are now more streamlined. For some reason, Bicgstab and Gmres were left out when we wrote those wrappers. I just added them. If you look in itsolvers_utils.py, you will see an example towards the bottom of the file. The wrappers accept both ll_mat and PysparseMatrix input. This is the better way to call the iterative solvers. There shouldn't be much of a difference in speed. What do you mean by "why is your code not there"? -- Dominique |