I wish to make a simple program that solves tridiagonal matrix . now TDM can be solved using Thomas' algorithm, which is very serial in nature. I have come across cyclic reduction , even-odd reduction method in one of nvidia's papers. Can some one please explain me this algorithm, and help me with the pseudo code?
Here is a paper describing the CUDa implementation of tridiagonal matrix solver:
http://www.jcohen.name/papers/Zhang_Fast_2009.pdf
Thanks for reply.
Yes i have read this paper, but still am unable to figure out how to implement the algorithm, perhaps due to my mechanical background. Can you please explein a little how can i apply recursion to get the algo?
NVidia's cusparse library
https://developer.nvidia.com/cusparse
appears to provide a tridiagonal solver
Indeed, the cusparse library from nvidia already have a tridiagonal solver, so you dont't have to implement it from scratch, just use the one provided in cusparse.
Can you provide me some tutorial on using cuSparse, i have been reading its documentation but am still confused about the implementation, how to get the output, etc...
Finally i have written a sample code using cusparse, thanks Markus and Bogdan for guiding me about cuda libraries i was ignorant about.
I hope my this code shall be sufficient for anyone who hits this question for the same problem i had.
http://musha-shugyo.googlecode.com/files/code.cu
this is my code in cuda-c...
if any doubts, please reply below
(WARNING:i am not a good coder)
- Badges
- Science topic