>> B = [1 5 6 8; 2 10 12 1;3 15 18 9;1 2 1 2]; >> rank(B) ans = 3
From the code above I know that my matrix is singular, but is there a function for checking if there will be one solution or infinitely many solutions?
detnonlinearranksingular
>> B = [1 5 6 8; 2 10 12 1;3 15 18 9;1 2 1 2]; >> rank(B) ans = 3
Best Answer