Optional
options: ISVDOptionsReadonly
conditionReadonly
diagonalReadonly
diagonalReadonly
leftReadonly
norm2Readonly
rankReadonly
rightReadonly
thresholdSolve a problem of least square (Ax=b) by using the SVD. Useful when A is singular. When A is not singular, it would be better to use qr.solve(value). Example : We search to approximate x, with A matrix shape m*n, x vector size n, b vector size m (m > n). We will use : var svd = SingularValueDecomposition(A); var x = svd.solve(b);
Matrix 1D which is the vector b (in the equation Ax = b).
See
https://github.com/accord-net/framework/blob/development/Sources/Accord.Math/Decompositions/SingularValueDecomposition.cs