The fastest way to check if a sparse matrix is singular or not?

Question

Benson Gou 2019-4-12

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/456029-the-fastest-way-to-check-if-a-sparse-matrix-is-singular-or-not

编辑： Matt J 2019-4-13

Dear All,

For a large sparse matrix A, how can I check in a fastest way if matrix A is singluar or not? The matrix has a dimension of 6000 x 6000. I know lu is fast, but I need to repeat this calculations many times for different matrix A.

Thanks a lot in advance.

Beson

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

Answer 1

Matt J 2019-4-12

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/456029-the-fastest-way-to-check-if-a-sparse-matrix-is-singular-or-not#answer_370379

在 MATLAB Online 中打开

condest(A)

2 个评论
显示无隐藏无

Benson Gou 2019-4-13

@Matt. Thanks for your reply. But I think there must be a threshold to judge if martrix A is singular or not. How to decide the threshold? Thanks.

Matt J 2019-4-13

编辑：Matt J 2019-4-13

The condition number calculated by condest measures how much error magnification you get when you try to invert the matrix when solving a linear equation

https://en.wikipedia.org/wiki/Condition_number#Matrices

The "threshold" that you are pursuing would be determined from the amount of error magnification that your specific application can tolerate (note that it is not possible to have zero error magnification). If the error magnification is greater than what you can tolerate, you would consider the matrix "singular".

请先登录，再进行评论。