QR-decomposition

  QR分解法是目前求一般矩阵全部特征值的最有效并广泛应用的方法，一般矩阵先经过正交相似变化成为Hessenberg矩阵，然后再应用QR方法求特征值和特征向量。它是将矩阵分解成一个正规正交矩阵Q与上三角形矩阵R，所以称为QR分解法,(QR decomposition )

QR分解算法
..........\Debug
..........\.....\QRdecomposition.obj,289816,2013-04-25
..........\.....\QRdecomposition.sbr,0,2013-04-25
..........\.....\QR分解算法.bsc,394240,2013-04-25
..........\.....\QR分解算法.exe,569417,2013-04-25
..........\.....\QR分解算法.ilk,812436,2013-04-25
..........\.....\QR分解算法.pch,3169612,2013-04-25
..........\.....\QR分解算法.pdb,1123328,2013-04-25
..........\.....\vc60.idb,107520,2013-04-25
..........\.....\vc60.pdb,143360,2013-04-25
..........\nr3.h,14110,2013-04-25
..........\printMatrix.h,851,2013-04-25
..........\printVector.h,662,2013-04-25
..........\qrdcmp.h,2977,2013-04-25
..........\QRdecomposition.cpp,887,2013-04-25
..........\QR分解算法.dsp,4585,2013-04-25
..........\QR分解算法.dsw,545,2013-04-25
..........\QR分解算法.ncb,66560,2013-04-25
..........\QR分解算法.opt,50688,2013-04-25
..........\QR分解算法.plg,1075,2013-04-25
..........\readMatrix.h,877,2013-04-25
..........\readVector.h,772,2013-04-25