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

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.

[David Goodmanson]

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.

Answer 1

[Jan]

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.