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

基于cordic算法的givens变换实现矩阵QR分解-Transform matrix QR decomposition based on the givens of cordic algorithm

矩阵QR算法 能计算任何矩阵的Q和R，结果很精确，望大家修改使其精简点-Matrix QR algorithm can calculate any matrix Q and R, the results are accurate, we modify and adapt them to look to streamline the point