bool lu(double* a, int* pivot, int n);//矩阵LU分解 bool guass(double const* lu, int const* p, double* b, int n);//求线性代数方程组的解 void qr(double* a, double* d, int n); //矩阵的QR分解 bool householder(double const*qr, double const*d, double*b, int n);//求线性代数方程组的解
boolean lu(double[] a, int[] pivot, int n); //矩阵LU分解
boolean guass(double[] a, int[] p, double[] b, int n);//Guass求线性代数方程组的解
void qr(double[] a, double[] d, int n);//矩阵的QR分解
boolean householder(double[] a, double[] d, double[] b, int n);//househol
