Preprocessing algorithm for the generalized SVD on the graphics processing units

Flegar, Goran (2016) Preprocessing algorithm for the generalized SVD on the graphics processing units. Diploma thesis, Faculty of Science > Department of Mathematics.

Language: English

Download (610kB) | Preview


In this thesis we study a preprocessing algorithm for the generalized SVD and its parallelization on the graphics processing unit. The preprocessing algorithm reduces a general matrix pair (A; B) to an upper triangular matrix pair ($\tilde{A}, \tilde{B}$) where B is nonsingular. After the preprocessing step a specialized algorithm, such as the implicit Kogbetliantz or the Hari–Zimmerman algorithm, which requires this structure of the matrix pair can be used to compute the generalized SVD. In the first chapter of the thesis we define the generalized SVD and describe the upper triangular decomposition resulting from the preprocessing step. Additionally, we describe the complete orthogonal decomposition which is used in the preprocessing step. The second chapter describes the challenges that arise when developing algorithms for the GPU and presents an efficient implementation of the preprocessing step. In the final chapter we test the algorithm on a variety of matrices of different sizes and compare the speed, rank detection, backward error and the effect on generalized singular values of our algorithm and LAPACK’s and MKL’s versions of xGGSVP.

Item Type: Thesis (Diploma thesis)
Supervisor: Singer, Sanja
Date: 2016
Number of Pages: 30
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 26 Aug 2016 08:07
Last Modified: 26 Aug 2016 08:07

Actions (login required)

View Item View Item

Nema podataka za dohvacanje citata