Hello everyone!(adsbygoogle = window.adsbygoogle || []).push({});

I need to find the vector x in the problem A.x = b

I have matrix A and vector b.

Inverting the matrix would do it, but in my case, the matrix is quite big. Luckily, it is extremelly sparse (lots of 0), so I guess there could be some way to take advantage of it.

The best approach I found is the Biconjugate Gradient method. Doing LU decomposition is too slow.

The exact answer is not needed. I only need to get x to a reasonable accurate result, so I think there could exist some methods using random numbers, annealing or something else faster than Biconjugate Gradient.

Someone has some ideas?

Best regards

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

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

# Sparse matrix inversion

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Sparse matrix inversion | Date |
---|---|

I Getting a matrix into row-echelon form, with zero-value pivots | Feb 17, 2018 |

I Orthogonal matrix construction | Feb 13, 2018 |

LDU decomposition - sparse matrix | Apr 15, 2012 |

Sparse Matrix transformation to locate columns containing zeros | Jun 6, 2011 |

Error between two sparse vectors | Oct 25, 2010 |

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