public void solve() {
        int n = M.length;
        double omega = 1.1;
        double[] X_k = new double[n];
        double[] X_k_1 = new double[n];
        Arrays.fill(X_k, 0);

        long startTime = System.nanoTime();

        for (int k = 0; k < Max_Iter; k++) {
            for (int i = 0; i < n; i++) {
                double sum = M[i][n]; // B[n]

                for (int j = 0; j < n; j++)
                    if (j != i)
                        sum -= M[i][j] * X_k[j];

                // Uaktualnienie X[i] w celu użycia w kolejnym wierszu obliczeń
                X_k[i] = (1-omega) * X_k[i] + omega / M[i][i] * sum;
            }

            if(!check_stop_condition(X_k, X_k_1, k, startTime))
                return;

            X_k_1 = X_k.clone();
        }
    }