Closed kiranshila closed 5 years ago
This is a quick implementation of the non-lookahead QMR method. It is a work in progress and right now seems to be pretty memory hungry.
I added some simple test code and it currently does pass all tests.
I am looking for some help to bring down the memory load and to make sure it is consistent with the other IterativeSolvers.jl methods
This is a quick implementation of the non-lookahead QMR method. It is a work in progress and right now seems to be pretty memory hungry.
I added some simple test code and it currently does pass all tests.
I am looking for some help to bring down the memory load and to make sure it is consistent with the other IterativeSolvers.jl methods