【数值计算】householder矩阵的QR算法，求特征值

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>

#define N 10

using namespace std;

class MT {
public:
    int x, y;
    double mt[N][N];

    MT() {}
    MT(int x, int y) {
        this->x = x;
        this->y = y;
        for (int i = 0; i < this->x; i++)
            for (int j = 0; j < this->y; j++)
                mt[i][j] = 0.0;
    }

    MT transpose() {
        MT c(this->y, this->x);
        for (int i = 0; i < c.x; i++)
            for (int j = 0; j < c.y; j++)
                c.mt[i][j] = this->mt[j][i];
        return c;
    }

    void print() {
        for (int i = 0; i < this->x; i++) {
            for (int j = 0; j <