Does the A\b use Thomas algorithm for solving, when A is tridiagonal?

3 次查看（过去 30 天）
Mateusz Przytarski
Mateusz Przytarski 2017-12-18
回答： Jan 2017-12-18
And if so, does it do even if A isn't diagonally dominant? The reason I ask is that I made a function which solves Ax=b using GEPP when A is tridiagonal, and want to find good examples of matrices when it doesn't work properly.
  1 个评论
David Goodmanson
David Goodmanson 2017-12-18
Hi Mateusz, take a look at 'doc mldivide' and scroll down to the flow charts. My interpretation is the obvious one, yes for sparse, no for full although they don't give details of the solvers.

请先登录，再进行评论。

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

回答（1 个）

Jan
Jan 2017-12-18
As David has mentioned already, all we can know about mldivide is mentioned in doc mldivide. The license condition forbid a reverse engineering or decompiling of the built-in functions, so how could we know more than the published docs?
If you really need to know what's going on inside, you can ask the programmer: Use the "Contact Us" link on this page.

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by