engleski

Butterfly Matrices and the Modulus Kogbetliantz Method

In this report we present an adaptation of the Kogbetliantz method for computing the singular value decomposition of triangular matrices to parallel computing. Two novelties are introduced. First, the initial (square or triangular) matrix has to be brought to the special ``butterfly'' form. Second, the Kogbetliantz method is applied to such a matrix, using the special modulus pivot strategy. This leads to the relatively accurate algorithm amenable for parallel processing. The method can be further modified to work with blocks.

Matrix in butterfly form; Kogbetliantz method; parallel algorithm

nije evidentirano