Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Preconditioned Conjugate Gradient Solver #30

Open
bscohen1 opened this issue Dec 7, 2016 · 3 comments
Open

Preconditioned Conjugate Gradient Solver #30

bscohen1 opened this issue Dec 7, 2016 · 3 comments

Comments

@bscohen1
Copy link

bscohen1 commented Dec 7, 2016

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.

@kshyatt
Copy link
Contributor

kshyatt commented Dec 7, 2016

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).

@bscohen1
Copy link
Author

bscohen1 commented Dec 8, 2016

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?

@kshyatt
Copy link
Contributor

kshyatt commented Dec 8, 2016

http://docs.nvidia.com/cuda/cusparse/#cusparse-lt-t-gt-gthr and then construct the CudaSparseVector? I can try to add this in if I find time (or if you want to open another PR 😉 ... ).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants