Anton Akhmerov wrote:
Finally speeding up the solution of the sparse problem also seems possible on GPU's, but it's a matter of ongoing research, quick googling yielded this for example: https://www.oerc.ox.ac.uk/sites/default/files/uploads/sparse_direct_gpu.pdf
Another approach (that is not ongoing research) is to use the classic recursive Green’s function algorithm (in the case of Kwant one would want to use the multi-terminal version as described in Part I of Michael Wimmer’s thesis [1]). We never worked on that because the MUMPS solver has been good enough for us so far, but if someone is motivated, we would be happy to lend a hand. Kwant actually includes Michael’s graph-slicing code. I should have a simple RGF solver for Kwant lying around somewhere. It should be not much work to port it to MAGMA. Christoph [1] http://epub.uni-regensburg.de/12142/