用CPU 與GPU 來實現找尋矩陣秩的演算法

Abstract

Rank is an important characteristic of a matrix. In this thesis, we realize a known efficient rank-revealing algorithm out of MATLAB, into native C++ environment to achieve greater efficiency. Further more, we utilize the power of GPGPU (General Purpose Graphic Process Unit) to further accelerate the algorithm. The algorithm gained its efficiency due to utilization of basic BLAS routine instead of more expensive LAPACK routine, which translates well to acceleration on GPGPU.