QR分解的Java实现

package source;

import java.util.HashMap;
import java.util.Vector;


public class QR {

    int dim = 3;
    double[][] A = {{2, 3, 4}, {3, 5, 2}, {4, 3, 30}}; //A矩阵

    double[][] temp = new double[dim][dim];//临时变量
    double[][] L = new double[dim][dim];//LA=R
    double[][] Q = new double[dim][dim];//A=QR
    double[][] R = A;//A=QR 并赋初值
    HashMap Ltemp = new HashMap();//L的存储器
    int Lnumber = 0;//计算L存储器中Li的个数

    public static void main(String[] args) {
        QR qr = new QR();
        qr.paint("A",qr.A);
        qr.run();
        qr.paint("R",qr.R);
        qr.run2();
        qr.buildQ();
        qr.paint("Q",qr.Q);
    }

    public void run() {//行成Li