Hi Jonathan,
thanks for your message and the pointer.
The incomplete factorizations have been around for a while, and with
recent hardware they tend to be less competitive (note that they use a
Tesla 2050 in their benchmarks, which is ~7 years old).
The fine-grained parallel version here:
http://epubs.siam.org/doi/abs/10.1137/140968896
is an attractive alternative (and available in the master-branch of
PETSc through ViennaCL), yet it also has drawbacks.
Best regards,
Karli
On 02/14/2018 12:02 AM, Jonathan Perry-Houts wrote:
Hi all,
I'm not sure if this is the right place to post this, but I wanted to
point out a new white paper I stumbled across about preconditioned
iterative solvers on GPU's:
http://docs.nvidia.com/cuda/incomplete-lu-cholesky/index.html
The speed-ups are not huge, but they're not negligible either. I thought
it might be of interest to some of you.
Cheers,
Jonathan
