a QR decomposition (also called a QR factorization) of a matrix is a decomposition of the matrix into an orthogonal and an upper triangular matrix. QR decomposition is often used to solve the linear least squares problem, and is the basis for a parti

几个简单的计算线性方程系数矩阵分解的算法，包括cholesky、doolittle、等-The calculation of a few simple linear equations coefficient matrix factorization algorithms, including cholesky, doolittle, etc.