diff --git a/content/AI&DATA/MathsForML/Coursera Maths for ML.md b/content/AI&DATA/MathsForML/Coursera Maths for ML.md index e36606a16..d7dcb5158 100644 --- a/content/AI&DATA/MathsForML/Coursera Maths for ML.md +++ b/content/AI&DATA/MathsForML/Coursera Maths for ML.md @@ -6,29 +6,8 @@ ## Singularity https://community.deeplearning.ai/t/singular-vs-non-singular-naming/274873 -Suppose the linear system we have isย  +https://math.stackexchange.com/a/3549608 -๐ด๐‘ฅ=๐‘ -whereย ๐ดโˆˆ๐‘๐‘›ร—๐‘›ย andย ๐‘ฅ,๐‘โˆˆ๐‘๐‘›. -You need to be a bit more precise to be correct to relate the number (or existence) of solutions to the singularity ofย ๐ด. -The following statements are correct: - -1. A linear system has a unique solution if and only if the matrix is non-singular. -2. A linear system has either no solution or infinite number of solutions if and only if the matrix is singular. -3. A linear system has a solution if and only ifย ๐‘ย is in the range ofย ๐ด. - -Now by definition, - -1. The matrix is non-singular if and only if the determinant is nonzero. - -However, like your professor mentioned, you do not need to evaluate the determinant to see whether a matrix is singular or not (though most such methods evaluates the determinant as by-product). - -For example, you can useย [Gaussian elimination](https://en.wikipedia.org/wiki/Gaussian_elimination)ย to tell whether a matrix is singular. This has the following advantages. - -1. The time complexity of Gaussian elimination isย ๐‘‚(๐‘›3)ย (whereas brute-force evaluation of determinant by the original definition takesย ๐‘‚(๐‘›!)). -2. Gaussian elimination evaluates the determinant as by-product (i.e., with no additional cost). - -Hope this helps you! \ No newline at end of file diff --git a/content/Untitled 2.canvas b/content/Untitled 2.canvas index e69de29bb..9e26dfeeb 100644 --- a/content/Untitled 2.canvas +++ b/content/Untitled 2.canvas @@ -0,0 +1 @@ +{} \ No newline at end of file