Good day everybody! I've got a question. A have a system with sparse matrix NxN, then I do some transformations and got sparse matrix 2Nx2N. Then solve system with LU like dense (i got enough GPU memory). If i use somedirect/iiterative solver is it be slower or faster? Where i can find some results of the comparison?
In my current work i transform dense matrix of system in some kind of sparse matrix (relative sparseness 0,5). Then use LU decomp for solving. I've got great performance on Nvidia Titan!
Dense and Sparse LU decomposition
Re: Dense and Sparse LU decomposition
The speed of sparse solvers is highly dependent on the matrix itself, e.g., its sparsity pattern, convergence rate with CG or GMRES, applicable preconditioners, etc. Try out the sparse solvers in
magma/sparseiter/testing/
mark
magma/sparseiter/testing/
mark
Re: Dense and Sparse LU decomposition
Hi mark!
In what format should be a file for the function magma_d_vread? I try to read vector  i got error. In functions like dgetrf i read this file ok/
In what format should be a file for the function magma_d_vread? I try to read vector  i got error. In functions like dgetrf i read this file ok/

 Posts: 90
 Joined: Tue Sep 02, 2014 5:44 pm
Re: Dense and Sparse LU decomposition
Dear Linuxboy,
thank you for sharing your observations. I am aware of this problem, and already fixed it  the bugfix will be included in the next release.
If you need this function really urgent, please let me know, I will send you the updated file.
Thanks, Hartwig
thank you for sharing your observations. I am aware of this problem, and already fixed it  the bugfix will be included in the next release.
If you need this function really urgent, please let me know, I will send you the updated file.
Thanks, Hartwig