Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

I required some help in a linear algebra problem. I've been told to build a sparse matrix solver which solves AX=B where dim(A) = n *n , dim(X) = n*nrhs and hence dim(B) = n*nrhs. This I have to implement on a GPU (I know this is offbeat but needed the math help :) I have an implementation which solved Ax=b wherein dim(A) = n*n and x is a vector i.e. dim(x) = n*1. This is solved using a preconditioned Conjugate Gradient algorithm. (If really interested could read this - http://alice.loria.fr/publications/papers/2008/CNC/Buatois_et_al_CNC.pdf ). I would like to know how I can map the AX=B problem to Ax=b problem (if possible)?

Thanks,

Vandhan Ramesh

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# AX=B versus Ax=b

Loading...

Similar Threads for AX=B versus Ax=b | Date |
---|---|

I Understand homomorphisms from Z^a --> Z^b | Wednesday at 9:31 AM |

A If [A,B]=0, are they both functions of some other operator? | Jul 20, 2017 |

B ##AB = I \implies BA = I##, for square matricies ##A,B## | Jun 9, 2017 |

I Show that you can find d and b s.t pd-bq=1 , p and q are coprime- GCF | Dec 17, 2016 |

Adjoint versus classical adjoint/any relation? | May 30, 2011 |

**Physics Forums - The Fusion of Science and Community**