mldivide (backslash): advantage by using sparse matrix instead of a full matrix with respect to the quality of the results?
4 views (last 30 days)
Michael Loibl on 13 Jan 2022
I am solving a linear system of equations Ax = B with the backslash operator. I have two versions of A implemented: a sparse and a full matrix.
Sometimes I get the warning that my matrix is close too singular. However, I get it more seldom if I am using sparse matrices. Is there a reason for it? Does this mean that the results are more reliable using sparse matrices?
When I compute the condition number for both cases using the command condest(A), I obviously get the same result for the sparse and the full matrix. I have an example where condest(A) = 3.65e27 which is of course very high. However, I get only a warning that the matrix is close too singular in the case of the full matrix. Does this make sense? Can I conclude that the solution is better for the sparse matrix since I do not get a warning?
Christine Tobler on 13 Jan 2022
The condition estimate used in mldivide to decide if a warning should be given is much less accurate for the sparse case. This is simply because it could get very expensive to compute in the sparse case, so we use a cheap heuristic.
So for sparse matrices, the result from condest should be trusted much more than whether a warning is given in mldivide.
More Answers (1)
Bruno Luong on 13 Jan 2022
Edited: Bruno Luong on 13 Jan 2022
If your condition is 3.65e27 you wi=on't get any reliable solution regardless the method.
The full matrix use QR with permutation and detect the conditioning issue better than sparse. MATLAB try to prevent sparse structure so it might not detect as well conditioning issue.
No I disagree with Torsen, for ill conditining system you can get wrong result even if the residual norm |A*x-b| is small. I can also guess the residual is smaller if you use full-sover, but it doesn't mean the solution is good.