- The program checks if the A[N]x[N] matrix given by the user is strictly diagonally dominant or not
- If so, it searches for the max abs element of the main diagonal of A matrix and prints it
- Based on max, a new matrix A[N]x[N] is being created, where:
B[i][j] = max–abs(A[i][j]), i!=j
B[i][j] = max, i==j
- On B matrix, the min element along with its row and column gets found and printed
gcc -o main main.c -fopenmp
./main