I have to solve system of linear algebraic equations AX=B
, where A is two-dimensional matrix and all elements of main diagonal are equal to zero.
How to solve this problem? Iterational methods are not applied in this case.
One way is LU Decomposition method with reordering rows of A
to get entries in main diagonal are not zero using permutation matrix
. How to quickly reorder rows of matrix or find permutation matrix?
Note that matrix is very big and I have to write programm to solve SLAE in C# language, so I do not need any matlab or mathematica functions. Thanks!