Ax = b for a lot of different b‘s

1 次查看（过去 30 天）
David Kusnirak
David Kusnirak 2013-4-18
Hello,
I have a system of equation Ax = b, where A is very large (n = 3e5 - 8e5) and sparse coefficient matrix, b is source term and x is the solution. Of course it's not a problem to solve such a problem in MATLAB, however I have to solve Ax = b for a lot of different b‘s without any change in the coefficient matrix A. The inversion of the matrix A take so long, that it is faster to solve the problem for each new b vector separately using an iterative solver. Unfortunately it is still way too slow, so I'm looking for a way how to speed it up.
Does anybody know, how to improve the performance?
Thank you for help!

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2013-4-18
编辑：Matt J 2013-4-18
Neither direct inversion of A, nor iterative methods are required. Just create a matrix B whose columns are the different b. Then do
X=A\B
Each column X(:,i) will be the solution for the corresponding b.
  4 个评论
显示 2更早的评论
Matt J
Matt J 2013-4-19
编辑：Matt J 2013-4-19
well it really helps! I have lost some control, e.g. precision, parralelization or preconditioning
Not sure why you feel you've lost precision or why you think pre-conditioning matters when you're using a non-iterative method. It's true you have no control over the parallelization, but parallelization is done for you internally by MLDIVIDE.
David Kusnirak
David Kusnirak 2013-4-19
编辑：David Kusnirak 2013-4-19
It works just fine as I said, thanks for help. The precision is far behind my tolerance treshold I used to use with the iterative solver, and of course preconditioning is not necessary now. I just felt better to have more response about what's going on, as the mldivide is somehow just a 'blackbox' for me.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Mathematics 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by