Example code for solving a sparse linear system Ax=d

[boyfarrell]

Hello,

I am interesting in solving the linear system A.x = d using cudatools (the specific example is actually sparse and tri-diagonal matrix). Is there any tutorials or example code which I can follow which will show how to set-up the matices and perform the solution?

Best wishes,

Dan

[kyle]

Are you interested in solving dense matrices? If so look into CULA Dense. Otherwise, we'll need a little more information to provide some help.

[boyfarrell]

Hello Kyle,

Thanks for the reply. No I am explicitly interested in solving sparse systems, which are tridiagonal. For example take the Poisson equation,
.

The matrix and vector on the left are A and x, respectively. The vector on the right is d and all the terms are known. Therefore the system has the form A.x=d, I wish to solve this system of equations to find the (only) unknown, vector x. This is quite a standard linear system.

Best wishes,

Dan.

[kyle]

Ah, I misunderstood your question. We have an example in the SDK demonstrating how to solve a traditional system using CULA Sparse. The bulk of the example is in a single call to:

culaSparseCudaDcooCg(...)

Which uses the Cuda platform, takes double precision (D) coordinate matrix (Coo) as input, and uses the conjugate gradient solver (Cg) to solve the system. There are also parameters to further specify options such as tolerance and maximum number of iterations.

[boyfarrell]

Hello Kyle,

Fantastic! I will give it a go.

Is there any example code I could follow for solving sparse system? For example, I imagine there is plenty of boilerplate that will need to be setup etc.

Best wishes,

[kyle]