You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Has anyone implemented a preconditioned conjugate gradient solver using the incomplete Cholesky factorization? I am assuming that giving the function wrappers ic0, ico2 and sv_solve this can be implemented with CUSPARSE.jl.
The text was updated successfully, but these errors were encountered:
As far as I know, no. That would be a great example or even library method, if you would like to take it on. Another option would be to extend something from IterativeSolvers.jl (or a similar package).
Is there a way to convert a CudaArray to a CudaSparseVector without transferring the array back to the host, calling sparse() and then constructing a new CudaSparseVector?
Has anyone implemented a preconditioned conjugate gradient solver using the incomplete Cholesky factorization? I am assuming that giving the function wrappers ic0, ico2 and sv_solve this can be implemented with CUSPARSE.jl.
The text was updated successfully, but these errors were encountered: